A robust algorithm for forming note complexes.
Silvana Gómez MeireMiguel Reboiro-JatoCarlos H. Fajardo ToroDavid N. OlivieriFlorentino Fdez-RiverolaPublished in: Inteligencia Artif. (2010)
Keyphrases
- k means
- learning algorithm
- worst case
- dynamic programming
- detection algorithm
- computational complexity
- computational cost
- cost function
- parameter tuning
- computationally efficient
- preprocessing
- experimental evaluation
- segmentation algorithm
- probabilistic model
- significant improvement
- improved algorithm
- ant colony optimization
- classification algorithm
- kalman filter
- optimization algorithm
- single pass
- multi objective
- search space
- optimal solution
- objective function
- similarity measure
- input data
- high accuracy
- clustering method
- memory requirements
- decision trees