gSkeletonClu: Density-based network clustering via structure-connected tree division or agglomeration

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 481-490

  Sun, Heli ^a   Huang, Jianbin ^b   Hanr, Jiawei ^c   Deng, Hongbo ^c   Zhaor, Peixiang ^c   Feng, Boqin ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b XIDIAN UNIVERSITY   (China)

^c University of Illinois at Urbana Champaign ^*  (United States)

Author keywords

Community discovery; Density based network clustering; Hubs and outliers; Parameter selection

Indexed keywords

AGGLOMERATIVE CLUSTERING; BASELINE METHODS; COMMUNITY DETECTION; COMMUNITY DISCOVERY; COMPLEX NETWORKS; CONNECTED COMPONENT; DENSITY-BASED; EDGE WEIGHTS; HUBS AND OUTLIERS; NETWORK CLUSTERING; OPTIMAL PARAMETER; PARAMETER SELECTION; REAL-WORLD; SENSITIVE PARAMETER; SIMILARITY THRESHOLD; SIZE AND SHAPE; SPANNING TREE; SYNTHETIC NETWORKS; UNDIRECTED NETWORK; USER INTERACTION;

AGGLOMERATION; DATA MINING; TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

EID: 79951764387     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.69     Document Type: Conference Paper

References (22)

1. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," in Proc. of SODA'98, 1998, pp. 668-677.
2. X. Xu, N. Yuruk, Z. Feng, and T. Schweiger, "SCAN: a structural clustering algorithm for networks," in KDD'07. ACM, 2007, pp. 824-833. (Pubitemid 350237348)
3. M. Ester, H. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in KDD'96, vol. 96, 1996, pp. 226-231.
4. D.-H. Kim, J. D. Noh, and H. Jeong, "Scale-free trees: The skeletons of complex networks," Phys. Rev. E, vol. 70, no. 4, p. 046126, Oct 2004.
5. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," The Bell System Technical Journal, vol. 49, no. 1, pp. 291-307, 1970.
6. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998. (Pubitemid 128689516)
7. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE TPAMI, vol. 22, no. 8, pp. 888-905, 2000.
8. S. White and P. Smyth, "A spectral clustering approach to finding communities in graph," in SDM'05, 2005.
9. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander, "Optics: Ordering points to identify the clustering structure," in SIGMOD'99, 1999, pp. 49-60. (Pubitemid 129597323)
10. D. Bortner and J. Han, "Progressive clustering of networks using structure-connected order of traversal," in ICDE'10, 2010.
11. C. Zahn, "Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters," IEEE Transactions on Computers, vol. 100, no. 20, pp. 68-86, 1971.
12. J. C. Gower and G. J. S. Ross, "Minimum spanning trees and single linkage cluster analysis," Journal of the Royal Statistical Society. Series C (Applied Statistics), vol. 18, no. 1, pp. 54-64, 1969.
13. Y. Xu, V. Olman, and D. Xu, "Minimum spanning trees for gene expression data clustering," Genome Informatics, vol. 12, p. 2001, 2001.
14. M. Halkidi, Y. Batistakis, and M. Vazirgiannis, "Clustering validity checking methods: part I," SIGMOD Rec., vol. 31, no. 2, pp. 40-45, 2002.
15. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, no. 2, p. 026113, 2004.
16. Z. Feng, X. Xu, N. Yuruk, and T. A. J. Schweiger, "A novel similarity-based modularity function for graph partitioning," in DaWaK'07, 2007, pp. 385-396.
17. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Phys. Rev. E, vol. 70, no. 6, p. 066111, Dec 2004.
18. R. Guimera and L. N. Amaral, "Functional cartography of complex metabolic networks," Nature, vol. 433, no. 7028, pp. 895-900, 2005. (Pubitemid 40314902)
19. S. Fortunato and M. Barthélemy, "Resolution limit in community detection," PNAS, vol. 104, no. 1, p. 36, 2007.
20. http://www-personal.umich.edu/mejn/netdata/.
21. A. Lancichinetti, S. Fortunato, and F. Radicchi, "Benchmark graphs for testing community detection algorithms," Phys. Rev. E, vol. 78, no. 4, p.046110, 2008.
22. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, "Comparing community structure identification," Journal of Statistical Mechanics: Theory and Experiment, vol. 2005, p. P09008, 2005.