A SAT-based framework for efficient constrained clustering

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 94-105

  Davidson, Ian ^a   Ravi, S S ^b   Shamis, Leonid ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DATA MINING; POLYNOMIAL APPROXIMATION;

CLUSTERING SOLUTIONS; CONSTRAINED CLUSTERING; CONSTRAINT SATISFACTION; DATA MINING COMMUNITY; GLOBAL OPTIMUM; OBJECTIVE FUNCTIONS; OVER-CONSTRAINED; POLYNOMIAL-TIME ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 84873178417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.9     Document Type: Conference Paper

References (17)

1. A. Bar-Hillel, T. Hertz, N. Shental and D. Weinshall, "Learning Distance Functions Using Equivalence Relations,", Proc. Intl. Conference on Machine Learning (ICML 2003), Washington, DC, Aug. 2003, pp. 11-18.
2. S. Basu, I. Davidson, and K. Wagstaff, (editors) Constrained Clustering: Theory, Algorithms and Applications, CRC Prentice Hall, 2008.
3. 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, Aug. 2004, pp. 59-68.
4. T. Coleman, J. Saunderson and A. Wirth, "Spectral Clustering with Inconsistent Advice,", Proc. Intl. Conference on Machine Learning (ICML 2008), Helsinki, Finland, June 2008, pp. 152-159.
5. I. Davidson and S. S. Ravi, "Identifying and Generating Easy Sets of Constraints For Clustering,", Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI 2006), Boston, MA, July 2006, 6 pages.
6. I. Davidson and S. S. Ravi, "The Complexity of Non-Hierarchical Clustering with Constraints,", J. Knowledge Discovery and Data Mining (DMKD), Vol. 14, No. 1, 2007, pp. 25-61.
7. I. Davidson and S. S. Ravi, "Intractability and Clustering with Constraints,", Proc. Intl. Conference on Machine Learning (ICML 2007), Corvallis, OR, June 2007, pp. 201-208.
8. I. Davidson and S. S. Ravi, "Using Instance-Level Constraints in Hierarchical Agglomerative Clustering: Theoretical and Empirical Results,", Data Mining and Knowledge Discovery, Vol. 18, No. 2, Apr. 2009, pp. 257-282.
9. I. Davidson, K. Wagstaff and S. Basu, "Measuring Constraint-Set Utility for Partitional Clustering Algorithms,", Proc. Intl. Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), Berlin, Germany, Sept. 2006, pp. 115-126.
10. P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay, Clustering of large graphs via the singular value decomposition, Machine Learning (56), pp. 9-33, 2004.
11. P. Hansen and B. Jaumard, "Minimum Sum of Diameters Clustering,", J. Classification, Vol. 4, 1987, pp. 215-226.
12. E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan and S. S. Ravi, "Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,", Mobile Networks and Applications (MONET), Vol. 10, Issue 1-2, Feb.-Apr. 2005, pp. 19-34.
13. C. H. Papadimitriou, Computational Complexity, Addison Wesley, Reading, MA, 1994.
14. R. Sarnath, "Dynamic Digraph Connectivity Hastens Minimum-Sum-of-Diameters Clustering,", SIAM J. Discrete Mathematics, Vol. 18, No. 2, Oct. 2004, pp. 272-286.
15. K. Wagstaff, Intelligent Clustering with Instance-Level Constraints, Ph. D. Dissertation, Department of Computer Science, Cornell University, Ithaca, NY, 2002.
16. 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.
17. 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.