Almost sure convergence of the one-dimensional Kohonen algorithm.
Avec M. BenaïmJean-Claude FortGilles PagèsPublished in: ESANN (1997)
Keyphrases
- detection algorithm
- learning algorithm
- convergence rate
- k means
- preprocessing
- times faster
- neural network
- computational cost
- experimental evaluation
- optimal solution
- high accuracy
- worst case
- np hard
- cost function
- significant improvement
- convergence analysis
- linear programming
- global convergence
- search space
- tree structure
- classification algorithm
- recognition algorithm
- computational complexity
- rapid convergence
- faster convergence
- convergence proof
- convex hull
- path planning
- clustering method
- optimization algorithm
- multi dimensional
- similarity measure
- clustering algorithm