Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10326524 | Neural Networks | 2008 | 15 Pages |
Abstract
After a theoretical study of the error convergence bound of the SAKM local learning, a comparison with NORMA and ALMA algorithms is made. In the end, some experiments conducted on simulation data, UCI benchmarks and real data are given to illustrate the capacities of the SAKM algorithm for online clustering in non-stationary and multi-class environment.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Habiboulaye Amadou Boubacar, Stéphane Lecoeuche, Salah Maouche,