Constrained overlapping clusters: Minimizing the negative effects of bridge-nodes

Statistical Analysis and Data Mining

Volumn 3, Issue 1, 2010, Pages 20-37

  Scripps, Jerry ^a   Tan, Pang Ning ^b  

^a GRAND VALLEY STATE UNIVERSITY   (United States)

^b Michigan State University   (United States)

Author keywords

Constrained clustering; Overlapping clustering

Indexed keywords

CLUSTERING ALGORITHMS; GENETIC ALGORITHMS;

CONSTRAINED CLUSTERING; MIN-CUT; NEW APPROACHES; OVERLAPPING CLUSTERING; OVERLAPPING CLUSTERS; REAL DATA SETS; TRADITIONAL CLUSTERING;

APPROXIMATION ALGORITHMS;

EID: 77950234725     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10066     Document Type: Article

References (37)

1. A. Jain and R. Dubes. Algorithms for clustering data, New Jersey, Prentice-Hall, Inc., 1988.
2. P. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining, Addison Wesley, Inc., 2005.
3. F. R. K. Chung. Spectral Graph Theory, Providence, RI, American Mathematical Society, 1997.
4. J. Shi and J. Malik. Normalized cuts and image segmentation, IEEE Trans Pattern Anal Mach Intell 22(8) (2000), 888-905.
5. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: hierarchical clustering using dynamic modeling, IEEE Comput 8 (1999), 68-75.
6. L. Ertoz, M. Steinbach, and V. Kumar. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data, In Proceedings of SDM '03: SIAM Int'l Conf on Data Mining, San Francisco, CA, 2003.
7. A. Strehl and J. Ghosh. A scalable approach to balanced, high-dimensional clustering of market-baskets, In Proceedings of the 7th International Conference on High Performance Computing, Dallas, TX, 2000.
8. S. Basu, M. Bilenko, and R. Mooney. A probabilistic framework for semi-supervised clustering, In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seatle, WA, 2004.
9. M. Bilenko, S. Basu, and R. Mooney. Integrating constraints and metric learning in semi-supervised clustering, In Proceedings of the 21st International Conference on Machine learning, Brighton, UK, 2004.
10. I. Davidson and S. Ravi. Clustering with constraints: feasibility issues and the k-means algorithm, In Proceedings of SDM'06: SIAM International Conference on Data Mining, Newport Beach, CA, 2005.
11. I. Davidson and S. Ravi. Towards efficient and improved hierarchical clustering with instance and cluster level constraints, Department of Computer Science, University at Albany, Technical Report, 2005.
12. K. Wagstaff and C. Cardie. Clustering with instancelevel constraints, In Proceedings of the 17th International Conference on Machine Learning, Palo Alto, CA, 2000.
13. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge, In Proceedings of 18th International Conference on Machine Learning, Williamstown, MA, 2001.
14. J. Scripps and P. N. Tan. Clustering in the presence of bridgenodes, In Proceedings of SDM'06: SIAM International Conference on Data Mining, Bethesda, MD, 2006.
15. M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-completeness, New York, San Francisco, CA, W.H. Freeman and Company, 1979.
16. G. Chartrand and O. Oellermann. Applied and Algorithmic Graph Theory, New York, McGraw Hill, Inc., 1992.
17. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, Cambridge, MA, The MIT Press, 1990.
18. J. Beasley. Heuristic algorithms for the unconstrained binary quadratic programming problem, London, Management School, Imperial College, Technical Report, 1998.
19. P. Merz and B. Freisleben. Genetic algorithms for binary quadratic programming, In GECCO-1999: Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, FL, Morgan Kauffman, 1999.
20. H. W. Kuhn. Variants of the hungarian method for assignment problems, Nav Res Log Q 3 (1956), 253-258.
21. J. Munkres. Algorithms for the assignment and transportation problems, J Soc Ind Appl Math 5 (1957), 32-38.
22. Sunday mirror, 1996-2004,, 1 http://infotrac.galegroup.com
23. T. Mitchell. 20 newsgroups, 1999.
24. D. Lewis. Reuters-21578, The UCI KDD Archive, Irvine, CA, University of California, 1997,, http://kdd.ics.uci.edu.
25. A. Banerjee, C. Krumpelman, J. Ghosh, S. Basu, and R. Mooney. Model based overlapping clustering, In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, IL, 2005.
26. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: an efficient data clustering method for very large databases, In Proceedings of SIGMOD, Montreal, Canada. 1996.
27. S. Guha, R. Rastogi, and K. Shim. Cure: an efficient clustering algorithm for large databases, In Proceedings of ACM SIGMOD International Conference on Management of Data, Seatle, WA, 1998.
28. O. Grygorash, Y. Zhou, and Z. Jorgensen. Minimum spanning tree based clustering algorithms, In Proceedings of the International Conference on Tools with Artificial Intelligence, Washington, DC, 2006.
29. G. Flake, K. Tsioutsiouliklis, and R. Tarjan. Graph clustering techniques based on minimum cut trees, Princeton, NJ, NEC, Technical Report, 2002.
30. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review, ACM Comput Surv 31 (1999), 264-323.
31. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise, In Proceedings of the 2nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996.
32. J. Gao, P. N. Tan, and H. Cheng. Semi-supervised clustering with partial background information, In Proceedings of SDM'06: SIAM International Conference on Data Mining, Hong Kong, 2006.
33. M. H. C. Law, A. Topchy, and A. Jain. Clustering with soft and group constraints, In Joint IAPR International Workshops on Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition, Lisbon, 2004.
34. A. Demiriz, K. Bennett, and M. Embrechts. Semi-supervised clustering using genetic algorithms, New York, Troy, Rensselaer Polytechnic Institute. Technical Report No. 9901, 1999.
35. N. Bansal, A. Blum, and S. Chawla. Correlation clustering, In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002.
36. J. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms, New York, Plenum Press, 1981.
37. S. Asur, D. Ucar, and S. Parthasarathy. An ensemble framework for clustering protein-protein interaction networks, In 15th Annual International Conference on Intelligent Systems(ISMB), Vienna, 2007