Clustering with Constraints: Feasibility Issues and the k-Means Algorithm.
作者： S. S. Ravi , Ian Davidson
DOI:
关键词:
摘要: … that the k-Means clustering algorithm can be viewed as a two step algorithm with one step … incorporates constraint violations and rederive a new constrained k-Means algorithm. This …
ucdavis.edu 
cnr.it 参考文章(18)
Sepandar D. Kamvar, Christopher D. Manning, Dan Klein, From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering international conference on machine learning. pp. 307- 314 ,(2002)
Usama M. Fayyad, Paul S. Bradley, Refining Initial Points for K-Means Clustering international conference on machine learning. pp. 91- 99 ,(1998)
Hans-Peter Kriegel, Martin Ester, Jörg Sander, Xiaowei Xu, A density-based algorithm for discovering clusters in large spatial Databases with Noise knowledge discovery and data mining. pp. 226- 231 ,(1996)
Teofilo F. Gonzalez, Clustering to minimize the maximum intercluster distance Theoretical Computer Science. ,vol. 38, pp. 293- 306 ,(1985) , 10.1016/0304-3975(85)90224-5
Dan Pelleg, Andrew Moore, Accelerating exact k-means algorithms with geometric reasoning knowledge discovery and data mining. pp. 277- 281 ,(1999) , 10.1145/312129.312248
M.E Dyer, A.M Frieze, Planar 3DM is NP -complete Journal of Algorithms. ,vol. 7, pp. 174- 184 ,(1986) , 10.1016/0196-6774(86)90002-7
R. Tamassia, I.G. Tollis, Planar grid embedding in linear time IEEE Transactions on Circuits and Systems. ,vol. 36, pp. 1230- 1234 ,(1989) , 10.1109/31.34669
Pierre Hansen, Brigitte Jaumard, Cluster analysis and mathematical programming Mathematical Programming. ,vol. 79, pp. 191- 215 ,(1997) , 10.1007/BF02614317
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Claire Cardie, Kiri Wagstaff, Clustering with Instance-level Constraints international conference on machine learning. pp. 1103- 1110 ,(2000)