An Algorithm for Online K-Means Clustering.
Edo LibertyRam SriharshaMaxim SviridenkoPublished in: ALENEX (2016)
Keyphrases
- k means
- dynamic programming
- learning algorithm
- computational cost
- experimental evaluation
- single pass
- times faster
- detection algorithm
- search space
- computational complexity
- significant improvement
- data structure
- real time
- computationally efficient
- optimization algorithm
- preprocessing
- experimental study
- classification algorithm
- objective function
- cost function
- selection algorithm
- path planning
- clustering algorithm
- convergence rate
- estimation algorithm
- theoretical analysis
- worst case
- expectation maximization
- particle swarm optimization
- input data
- motion estimation
- state space
- probabilistic model
- optimal solution
- np hard
- association rules
- lower bound
- feature space