Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters

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

Volumn , Issue , 2007, Pages 510-519

  Moser, Flavia ^a   Ge, Rong ^a   Ester, Martin ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Algorithms; Clustering; Community identification; Graph structured data; Hotspot analysis; Joint cluster analysis

Indexed keywords

COMMUNITY IDENTIFICATION; GRAPH-STRUCTURED DATA; HOTSPOT ANALYSIS; JOINT CLUSTER ANALYSIS;

CLUSTERING ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; PROBLEM SOLVING;

DATABASE SYSTEMS;

EID: 36849038426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281248     Document Type: Conference Paper

References (31)

1. M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander. Optics: ordering points to identify the clustering structure. In SIGMOD, 1999.
2. C. M. Bishop. Neural networks for pattern recognition. Oxford: Clarendon Press, 1995.
3. P. S. Bradley and U. M. Fayyad. Refining initial points for k-means clustering. In ICML, 1998.
4. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Algorithms - ESA 2003, 11th Annual European Symposium, Budapest ,Hungary, 2003.
5. C. Carson, M. Thomas, S. Belongie, J. M. Hellerstein, and J. Malik. Blobworld: A system for region-based image indexing and retrieval. In VIS. Springer, 1999.
6. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A min-max cut algorithm for graph partitioning and data clustering. ICDM, 2001.
7. R. Duda and P. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973.
8. M. Ester, R. Ge, B. J. Gao, Z. Hu, and B. Ben-Moshe. Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In SDM, 2006.
9. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, 1996.
10. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. New York: Wiley, 1968.
11. P. Fjallstrom. Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science, 1998.
12. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified np-complete problems. In Sixth annual ACM symposium on Theory of computing, 1974.
13. S. Guha, R. Rastogi, and K. Shim. Cure: an efficient clustering algorithm for large databases. In SIGMOD, 1998.
14. S. Guha, R. Rastogi, and K. Shim. Rock: A robust clustering algorithm for categorical attributes. In Information Systems, 2000.
15. L. Hagen and A. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on Computed Aided Desgin, 1992.
16. R. A. Hanneman and M. Riddle. Introduction to social network methods. http://faculty.ucr.edu/~hanneman/, 2005.
17. A. Jain and R. Dubes. Algorithms for clustering data. Prentice Hall, 1988.
18. G. Karypis, E.-H. Han, and V. Kumar. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 1999.
19. L. Kaufman and P. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. New York: Wiley, 1990.
20. T. M. Mitchell. Machine Learning. New York; London: McGraw-Hill, 1997.
21. M. Newman. The structure of scientific collaboration networks. In Proc. Natl. Acad. Sci. 98, 2001.
22. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review, 2004.
23. A. Okabe, K.-I. Okunuki, and S. Shino. The sanet toolbox: New methods for network spatial analysis. In Transactions in GIS. Blackwell Publishing, July 2006.
24. D. Pelleg and A. Moore. X-means: Extending k-means with efficient estimation of the number of clusters. In ICML, San Francisco, 2000.
25. G. Salton and M. J. McGill. Introduction to modern information retrieval. McGraw-Hill, 1983.
26. J. Scott. Social Network Analysis: A handbook. Sage Publications, London, 2000.
27. J. Shi and J. Malik. Normalized cuts and image segmentation. In IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000.
28. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, 1994.
29. Y. Wei and C. Cheng. Towards efficient hierarchical designs by ratio cut partitioning. In IEEE Conf. on Computer-Aided Design, 1989.
30. S. White and P. Smyth. A spectral clustering approach to finding comm. in graphs. In SDM, 2005.
31. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In SIGMOD, 1996.