Clustering social networks using distance-preserving subgraphs

Proceedings - 2010 International Conference on Advances in Social Network Analysis and Mining, ASONAM 2010

Volumn , Issue , 2010, Pages 380-385

  Nussbaum, Ronald ^a   Esfahanian, Abdol Hossein ^a   Tan, Pang Ning ^a  

^a Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NUMBER; DATA SETS; GRAPH PROPERTIES; GRAPH-BASED; NOTION OF DISTANCE; REAL-WORLD; SHORTEST PATH; SOCIAL NETWORKS; SUBGRAPHS;

CLUSTER ANALYSIS; DATA PROCESSING; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; SOCIAL NETWORKING (ONLINE);

CLUSTERING ALGORITHMS;

EID: 77958171614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2010.78     Document Type: Conference Paper

References (18)

1. J. MacQueen, "Some methods for classification and analysis of multivariate observations, " Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, p. 281-297, 1966.
2. M. Ankerst, M. Breunig, H. Kriegel, and J. Sander, "OPTICS: Ordering Points To Identify the Clustering Structure, " ACM SIGMOD Record, vol. 28, no. 2, pp. 49-60, 1999.
3. M. Ester, H. Kriegel, J. Sander, and X. Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, " in Proc. KDD, vol. 96, 1996, pp. 226-231.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani, "Incremental Clustering and Dynamic Information Retrieval, " in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. ACM New York, NY, USA, 1997, pp. 626-635.
5. G. Flake, R. Tarjan, and K. Tsioutsiouliklis, "Graph Clustering and Minimum Cut Trees, " Internet Mathematics, vol. 1, no. 4, pp. 385-408, 2004.
6. J. Plesnik, "A heuristic for the p-center problem in graphs." DISCRETE APPL. MATH., vol. 17, no. 3, pp. 263-268, 1987.
7. L. Getoor and C. Diehl, "Link Mining: A Survey, " ACM SIGKDD Explorations Newsletter, vol. 7, no. 2, p. 12, 2005.
8. P. Doreian, V. Batagelj, and A. Ferligoj, "Positional analyses of sociometric data, " Models and methods in social network analysis, pp. 77-97, 2005.
9. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.
10. M. Newman and M. Girvan, "Finding and evaluating community structure in networks, " Physical review E, vol. 69, no. 2, p. 26113, 2004.
11. J. Scripps and P. Tan, "Constrained Overlapping Clusters: Minimizing the Negative Effects of Bridge-Nodes, " Statistical Analysis and Data Mining, vol. 3, no. 1, pp. 20-37, 2010.
12. K. Liu, K. Bhaduri, K. Das, P. Nguyen, and H. Kargupta, "Client-side web mining for community formation in peer-to-peer environments, " ACM SIGKDD Explorations Newsletter, vol. 8, no. 2, p. 20, 2006.
13. D. Zhou, I. Councill, H. Zha, and C. Giles, "Discovering Temporal Communities from Social Network Documents, " in Proceedings of the 2007 Seventh IEEE International Conference on Data Mining. IEEE Computer Society Washington, DC, USA, 2007, pp. 745-750.
14. C. Tantipathananandh, T. Berger-Wolf, and D. Kempe, "A Framework For Community Identification in Dynamic Social Networks, " in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2007, p. 726.
15. E. Howorka, "A characterization of distance-hereditary graphs, " Quart. J. Math. Oxford Ser, vol. 2, no. 28, pp. 417-420, 1977.
16. H. Bandelt and H. Mulder, "Distance-Hereditary Graphs, " Journal of combinatorial theory. Series B, vol. 41, no. 2, pp. 182-208, 1986.
17. G. Damiand, M. Habib, and C. Paul, "A simple paradigm for graph recognition: application to cographs and distance hereditary graphs, " Theoretical Computer Science, vol. 263, no. 1-2, pp. 99-111, 2001.
18. P. Hammer and F. Maffray, "Completely separable graphs, " Discrete Applied Mathematics, vol. 27, no. 1-2, pp. 85-99, 1990.