A heuristic branch-and-bound based thresholding algorithm for unveiling cognitive activity from EEG data.
M. ThilagaRamasamy VijayalakshmiNadarajan RethnasamyD. NandagopalBernie CocksC. ArchanaNabaraj DahalPublished in: Neurocomputing (2015)
Keyphrases
- branch and bound
- thresholding algorithm
- eeg data
- branch and bound procedure
- optimal solution
- search algorithm
- combinatorial optimization
- tree search algorithm
- branch and bound method
- beam search
- brain activity
- tree search
- branch and bound search
- branch and bound algorithm
- lower bound
- column generation
- depth first search
- search strategies
- heuristic solution
- search space
- lagrangian heuristic
- upper bound
- brain computer interface
- cognitive states
- brain signals
- visuo motor
- linear programming relaxation
- independent component analysis
- network design problem
- eeg signals
- lagrangian relaxation
- partial solutions
- randomly generated problems
- mixed integer programming
- optimization problems
- np hard
- simulated annealing
- objective function
- mini bucket
- linear programming
- metaheuristic
- heuristic search
- linear program
- information processing
- signal processing
- feasible solution
- search tree
- image processing
- lower and upper bounds
- max sat