Synonyms
Glossary
- Cluster:
-
A group of densely interconnected nodes
- Community Detection:
-
A function of network analysis that identifies groups of densely connected nodes
- Graph:
-
A set of nodes and edges connecting the nodes
- Hub:
-
A special role of node that bridges multiple clusters
- Network:
-
A graph extended with semantics and interactions between nodes and edges, respectively
- Outlier:
-
A special role of node that is not hub and does not belong to any clusters. In many cases outliers are regarded as noises
- Partition:
-
Division of nonoverlapping subsets
Definition
Graph is one of the fundamental data structures and we can easily find graphs in many applications and services. Graph cluster analysis is a key technique to understand structures, characteristics, and interrelationships graphs. The problem of the graph cluster analysis is to find clusters inside of which nodes are densely connected and sparsely connected inter clusters, and this...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008
Boyer F, Morgat A, Labarre L, Pothier J, Viari A (2005) Syntons, metabolons and interactions: an exact graph-theoretical approach for exploring neighborhood between genomic and functional data. Bioinformatics 21(23):4209–4215
Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5(2):25:1–25:31
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111
Ding CHQ, He X, Zha H, Gu M, Simon HD (2001) A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of the 2001 I.E. international conference on data mining, San Jose, pp 107–114
Ding Y, Chen M, Liu Z, Ding D, Ye Y, Zhang M, Kelly R, Guo L, Su Z, Harris S, Qian F, Ge W, Fang H, Xu X, Tong W (2012) atBioNet – An integrated network analysis tool for genomics and biomarker discovery. BMC Genomics 13(1):1–12
Dinh T, Xuan Y, Thai M (2012) Towards social-aware routing in dynamic communication networks. In Proceedings IPCCC 2009, pp 161–168
Ester M, Kriegel HP, Sander J, Xu X, (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings SIGKDD 1996, pp 226–231
Feng Z, Xu X, Yuruk N, Schweiger TAJ (2007) A novel similarity-based modularity function for graph partitioning. In Proceedings DaWaK 2007, pp 385–396
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41
Furuta T, Sasaki M, Ishizaki F, Suzuki A, Miyazawa H (2006) A new cluster formation method for sensor networks using facility location theory. Technical report NANZAN-TR-2006-01
Grout V, Cunningham S, Picking R (2007) Practical large-scale network design with variable costs for links and switches. Int J Comp Sci Netw Secur 7(7):113–125
Huang J, Deng H, Sun H, Sun Y, Han J, Liu Y (2014) SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks. In Proceedings CIKM 2010, pp 219–228
Janga C, Tzakos A (2009) Structure and organization of drug-target networks: insights from genomic approaches for drug discovery. Mol BioSyst 5(12):1536–1548
Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359–392
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307
Lee P, Lakshmanan LVS, Milios EE (2014) Incremental cluster evolution tracking from highly dynamic network data. In Proceedings ICDE 2011, pp 3–14
Lim S, Ryu S, Kwon S, Jung K, Lee JG (2014) LinkSCAN∗: overlapping community detection using the link-space transformation. In Proceedings ICDE 2014, pp 292–303
Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113
Nguyen NP, Dinh TN, Xuan Y, Thai MT (2011) Adaptive algorithms for detecting community structure in dynamic social networks. In Proceedings INFOCOM 2011, pp 2282–2290
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE TPAMI 22(8):888–905
Shiokawa H, Fujiwara Y, Onizuka M (2013) Fast algorithm for modularity-based graph clustering. In Proceedings of the 27th AAAI conference on artificial intelligence, Bellevue, pp 1170–1176
Shiokawa H, Fujiwara Y, Onizuka M (2015) SCAN++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. Proc VLDB Endowment 8(11):1178–1189
Sporns O, Tononi G, Kötter R (2005) The Human Connectome: a structural description of the human brain. PLoS Comput Biol 1(4):e42
Sun H, Huang J, Han J, Deng H, Zhao P, Feng B (2014) gSkeletonClu: density-based network clustering via structure-connected tree division or agglomeration,3e4. In Proceedings ICDM 2010, pp 481–490
Toutanova K, Manning CD (2000) Enriching the knowledge sources used in a maximum entropy part-of-speech tagger. In Proceedings EMNLP 2000, pp 63–70
Wang L, Xiao Y, Shao B, Wang H (2014) How to partition a billion-node graph. In Proceedings ICDE2014, pp 568–579
Xu Y, Olman V, Xu D (2002) Clustering Gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics 18(4):536–545
Xu X, Yuruk N, Geng Z, Schweiger TAJ (2007) SCAN: a structural clustering algorithm for networks. In Proceedings SIGKDD 2007, pp 824–833
Yuruk N, Mete M, Xu X, Shweiger TAJ (2007) A divisive hierarchical structural clustering algorithm for networks. In Proceedings ICDM Workshops 2007, pp 441–446
Zhou W, Jin H, Liu Y (2012) Community discovery and profiling with social messages. In Proceedings SIGKDD 2012, pp 388–396
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media LLC, part of Springer Nature
About this entry
Cite this entry
Shiokawa, H., Onizuka, M. (2018). Scalable Graph Clustering and Its Applications. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7131-2_110185
Download citation
DOI: https://doi.org/10.1007/978-1-4939-7131-2_110185
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-7130-5
Online ISBN: 978-1-4939-7131-2
eBook Packages: Computer ScienceReference Module Computer Science and Engineering