Constraint-driven clustering

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 320-329

  Ge, Rong ^a   Ester, Martin ^a   Jin, Wen ^a   Davidson, Ian ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b State University of New York   (United States)

Author keywords

Clustering; Constraints; NP hardness

Indexed keywords

CONSTRAINT-DRIVEN CLUSTERING (CDC); DATA-DRIVEN METHODS; ENERGY AWARE SENSOR NETWORKS; PRIVACY PRESERVATION;

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA PRIVACY; DATA STRUCTURES; PROBLEM SOLVING; REQUIREMENTS ENGINEERING; SENSOR NETWORKS;

CLUSTERING ALGORITHMS;

EID: 36849047834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281229     Document Type: Conference Paper

References (35)

1. M. Abramowitz and I. A. Stegun(Eds.). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. New York: Dover, 1972.
2. C. C. Aggarwal and P. S. Yu. A condensation approach to privacy preserving data mining. In EDBT, 2004.
3. G. Aggarwal, T. F. K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k-anonymity. Journal of Privacy Technology, 2005.
4. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In INFOCOM, 2000.
5. S. Bandyopadhyay and E. J. Coyle. An energy-efficient hierarchical clustering algorithm for wireless sensor networks. In INFOCOM, 2003.
6. A. Banerjee and J. Ghosh. On scaling up balanced clustering algorithms. In ICDM, 2002.
7. A. Banerjee and J. Ghosh. Scalable clustering algorithms with balancing constraints. Data Mining Knowledge Discovery, 13(3), 2006.
8. S. Banerjee and S. Khuller. A clustering scheme for hierarchical control in multi-hop wireless networks. In INFOCOM, 2001.
9. P. Bradley, K. P. Bennett, and A. Demiriz. Constrained k-means clustering. Technical report, MSR-TR-2000-65, Microsoft Research, 2000.
10. J. Cartigny, D. Simplot, and I. Stojmenovic. Localized minimum-energy broadcasting in ad-hoc networks. In INFOCOM, 2003.
11. I. Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In SDM, 2005.
12. I. Davidson and S. S. Ravi. Identifying and generating easy sets of constraints for clustering. In AAAI, 2006.
13. I. Davidson and S. S. Ravi. The complexity of non-hierarchical clustering with constraints. Journal of Knowledge Discovery and Data Mining, To Appear.
14. J. Domingo-Ferrer and J. M. Mateo-Sanz. Practical data-oriented microaggregation for statistical disclosure control. IEEE Transactions on Knowledge and Data Engineering, 14(1), 2002.
15. M. E. Dyer and A. M. Frieze. Planar 3dm is np-complete. J. Algorithms, 7(2), 1986.
16. M. Ester, R. Ge, W. Jin, and Z. Hu. A microeconomic data mining problem: customer-oriented catalog segmentation. In KDD, 2004.
17. R. Ge, M. Ester, W. Jin, and Z. Hu. A disc-based approach to data summarization and privacy preservation. In SSDBM, 2006.
18. S. Ghiasi, A. Srivastava, X. Yang, and M. Sarrafzadeh. Optimal energy aware clustering in sensor network. Sensor, 2(7), 2002.
19. J. Ghosh and A. Strehl. Clustering and visualization of retail market baskets. In N. R. Pal and L. Jain, editors, Knowledge Discovery in Advanced Information Systems. Springer, 2002.
20. G. Gupta and M. Younis. Load-balanced clustering of wireless sensor networks. IEEE International Conference on Communications, 2003.
21. N. P. Jedid-Jah Jonkera and D. V. den Poel. Joint optimization of customer segmentation and marketing policy to maximize long-term profitability. Expert Systems with Applications, 27(2), 2004.
22. W. Jin, R. Ge, and W. Qian. On robust and effective k-anonymity in large databases. In PAKDD, 2006.
23. V. Kawadia and P. R. Kumar. Power control and clustering in ad hoc networks. In INFOCOM, 2003.
24. J. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. J. Data Mining and Knowledge Discovery, 1999.
25. R. Krishnan and D. Starobinski. Efficient clustering algorithms for self-organizing wireless sensor networks. Journal of Ad-Hoc Networks, 2005.
26. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS, 2004.
27. D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases, 1998.
28. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In PODS, 1998.
29. A. Strehl and J. Ghosh. A scalable approach to balanced, high-dimensional clustering of market-baskets. In HiPC 2000, 2000.
30. L. Sweeney, k-anonymity: A model for protecting privacy. In IJUFKS, 2002.
31. A. K. H. Tung, J. Han, R. T. Ng, and L. V. S. Lakshmanan. Constraint-based clustering in large databases. In ICDT, 2001.
32. K. Wagstaff and C. Cardie. Clustering with instance-level constraints. In ICML, 2000.
33. D. R. Woods. Drawing planar graphs. Technical report, Report No. STAN-CS-82-943, Computer Science Department, Stanford University, 1981.
34. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In SIGMOD, 1996.
35. S. Zhong and J. Ghosh. Scalable, balanced model-based clustering. In SDM, 2003.