International Journal of Neural Systems · 2008 · 87 citations · 12 references
ComputingComputer ScienceMathematicsData MiningMachine LearningOptimizationCluster VisualizationDocument ClusteringOnline AlgorithmsOptimization For Machine LearningText ClusteringUnsupervised LearningClusteringK-means ClusteringLatent Space EmbeddingLatent Space ExplorationLatent Space InterpretationOnline Clustering
We introduce a set of clustering algorithms whose performance function is such that the algorithms overcome one of the weaknesses of K-means, its sensitivity to initial conditions which leads it to converge to a local optimum rather than the global optimum. We derive online learning algorithms and illustrate their convergence to optimal solutions which K-means fails to find. We then extend the algorithm by underpinning it with a latent space which enables a topology preserving mapping to be found. We show visualisation results on some standard data sets.
12
Least squares quantization in PCM
Sheelagh Lloyd · IEEE Transactions on Information Theory · 1982 · 15.6K citations · Full text
Information theory, inference, and learning algorithms
Choice Reviews Online · 2004 · 6.6K citations
k-means++: the advantages of careful seeding
David Arthur, Sergei Vassilvitskii · 2007 · 6.3K citations