Clustering with constraints: Feasibility issues and the k-Means algorithm

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 138-149

  Davidson, Ian ^a   Ravi, S S ^a  

^a State University of New York   (United States)

Author keywords

Constraints; K Means clustering

Indexed keywords

DATA MINING; ITERATIVE METHODS;

BACKGROUND INFORMATION; COMPLEXITY RESULTS; CONSTRAINT TYPES; CONSTRAINTS; FEASIBLE SOLUTION; ITERATIVE ALGORITHM; NUMBER OF ITERATIONS; REAL-WORLD OBJECTS;

K-MEANS CLUSTERING;

EID: 84880095768     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.13     Document Type: Conference Paper

References (19)

1. A. Hertz and D. de Werra, "Using Tabu Search Techniques for Graph Coloring", Computing, Vol. 39, 1987, pp. 345-351.
2. L. Bottou and Y. Bengio, "Convergence Properties of the K-Means Algorithms", Advances in Neural Information Processing Systems, Vol. 7, Edited by G. Tesauro and D. Touretzky and T. Leen, MIT Press, Cambridge, MA, 1995, pp. 585-592.
3. S. Basu, A. Banerjee and R. J. Mooney, "Semi-supervised Learning by Seeding", Proc. 19th Intl. Conf. on Machine Learning (ICML-2002), Sydney, Australia, July 2002, pp. 19-26.
4. S. Basu, M. Bilenko and R. J. Mooney, "A Probabilistic Framework for Semi-Supervised Clustering", Proc. 10th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (KDD-2004), Seattle, WA, August 2004.
5. S. Basu, M. Bilenko and R. J. Mooney, "Active Semi-Supervision for Pairwise Constrained Clustering", Proc. 4th SIAM Intl. Conf. on Data Mining (SDM-2004).
6. P. S. Bradley and U. M. Fayyad, "Refining initial points for K-Means clustering", Proc. 15th Intl. Conf. on Machine Learning (ICML-1998), 1998, pp. 91-99.
7. G. Campers, O. Henkes and J. P. Leclerq, "Graph Coloring Heuristics: A Survey, Some New Propositions and Computational Experiences on Random and Leighton's Graphs", in Proc. Operational Research '87, Buenos Aires, 1987, pp. 917-932.
8. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, Second Edition, MIT Press and McGraw-Hill, Cambridge, MA, 2001.
9. M. E. Dyer and A. M. Frieze, "Planar 3DM is NP-Complete", J. Algorithms, Vol. 7, 1986, pp. 174-184.
10. I. Davidson and A. Satyanarayana, "Speeding up K-Means Clustering Using Bootstrap Averaging", Proc. IEEE ICDM 2003 Workshop on Clustering Large Data Sets, Melbourne, FL, Nov. 2003, pp. 16-25.
11. M. Ester, H. Kriegel, J. Sander and X. Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", Proc. 2nd Intl. Conf. on Knowledge Discovery and Data Mining (KDD-96), Portland, OR, 1996, pp. 226-231.
12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman and Co., San Francisco, CA, 1979.
13. T. F. Gonzalez, "Clustering to Minimize the Maximum Intercluster Distance", Theoretical Computer Science, Vol. 38, No. 2-3, June 1985, pp. 293-306.
14. P. Hansen and B. Jaumard, "Cluster Analysis and Mathematical Programming", Mathematical Programming, Vol. 79, Aug. 1997, pp. 191-215.
15. D. Klein, S. D. Kamvar and C. D. Manning, "From Instance-Level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering", Proc. 19th Intl. Conf. on Machine Learning (ICML 2002), Sydney, Australia, July 2002, pp. 307-314.
16. D. Pelleg and A. Moore, "Accelerating Exact k-means Algorithms with Geometric Reasoning", Proc. ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, Aug. 1999, pp. 277-281.
17. R. Tamassia and I. Tollis, "Planar Grid Embedding in Linear Time", IEEE Trans. Circuits and Systems, Vol. CAS-36, No. 9, Sept. 1989, pp. 1230-1234.
18. K. Wagstaff and C. Cardie, "Clustering with Instance-Level Constraints", Proc. 17th Intl. Conf. on Machine Learning (ICML 2000), Stanford, CA, June-July 2000, pp. 1103-1110.
19. K. Wagstaff, C. Cardie, S. Rogers and S. Schroedl, "Constrained K-means Clustering with Background Knowledge", Proc. 18th Intl. Conf. on Machine Learning (ICML 2001), Williamstown, MA, June-July 2001, pp. 577-584.