{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:06:51Z","timestamp":1767182811726,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":32,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493971305"},{"type":"electronic","value":"9781493971312"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4939-7131-2_110185","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:07:47Z","timestamp":1528744067000},"page":"2290-2299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scalable Graph Clustering and Its Applications"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Shiokawa","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Onizuka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008","key":"110185_CR1929","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"issue":"23","key":"110185_CR1930","doi-asserted-by":"publisher","first-page":"4209","DOI":"10.1093\/bioinformatics\/bti711","volume":"21","author":"F Boyer","year":"2005","unstructured":"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\u20134215","journal-title":"Bioinformatics"},{"issue":"2","key":"110185_CR1931","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2532549","volume":"5","author":"YC Chen","year":"2014","unstructured":"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\u201325:31","journal-title":"ACM Trans Intell Syst Technol"},{"key":"110185_CR1932","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","journal-title":"Phys Rev E"},{"doi-asserted-by":"crossref","unstructured":"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\u2013114","key":"110185_CR1933","DOI":"10.1109\/ICDM.2001.989507"},{"issue":"1","key":"110185_CR1934","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2164-13-325","volume":"13","author":"Y Ding","year":"2012","unstructured":"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 \u2013 An integrated network analysis tool for genomics and biomarker discovery. BMC Genomics 13(1):1\u201312","journal-title":"BMC Genomics"},{"unstructured":"Dinh T, Xuan Y, Thai M (2012) Towards social-aware routing in dynamic communication networks. In Proceedings IPCCC 2009, pp 161\u2013168","key":"110185_CR1935"},{"unstructured":"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\u2013231","key":"110185_CR1936"},{"doi-asserted-by":"crossref","unstructured":"Feng Z, Xu X, Yuruk N, Schweiger TAJ (2007) A novel similarity-based modularity function for graph partitioning. In Proceedings DaWaK 2007, pp 385\u2013396","key":"110185_CR1937","DOI":"10.1007\/978-3-540-74553-2_36"},{"issue":"1","key":"110185_CR1938","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barth\u00e9lemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341","journal-title":"Proc Natl Acad Sci"},{"unstructured":"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","key":"110185_CR1939"},{"issue":"7","key":"110185_CR1940","first-page":"113","volume":"7","author":"V Grout","year":"2007","unstructured":"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\u2013125","journal-title":"Int J Comp Sci Netw Secur"},{"unstructured":"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\u2013228","key":"110185_CR1941"},{"issue":"12","key":"110185_CR1942","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1039\/b908147j","volume":"5","author":"C Janga","year":"2009","unstructured":"Janga C, Tzakos A (2009) Structure and organization of drug-target networks: insights from genomic approaches for drug discovery. Mol BioSyst 5(12):1536\u20131548","journal-title":"Mol BioSyst"},{"issue":"1","key":"110185_CR1943","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"110185_CR1944","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291\u2013307","journal-title":"Bell Syst Tech J"},{"doi-asserted-by":"crossref","unstructured":"Lee P, Lakshmanan LVS, Milios EE (2014) Incremental cluster evolution tracking from highly dynamic network data. In Proceedings ICDE 2011, pp 3\u201314","key":"110185_CR1945","DOI":"10.1109\/ICDE.2014.6816635"},{"doi-asserted-by":"crossref","unstructured":"Lim S, Ryu S, Kwon S, Jung K, Lee JG (2014) LinkSCAN\u2217: overlapping community detection using the link-space transformation. In Proceedings ICDE 2014, pp 292\u2013303","key":"110185_CR1946","DOI":"10.1109\/ICDE.2014.6816659"},{"key":"110185_CR1947","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133","journal-title":"Phys Rev E"},{"key":"110185_CR1948","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113","journal-title":"Phys Rev E"},{"doi-asserted-by":"crossref","unstructured":"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\u20132290","key":"110185_CR1949","DOI":"10.1109\/INFCOM.2011.5935045"},{"issue":"8","key":"110185_CR1950","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE TPAMI 22(8):888\u2013905","journal-title":"IEEE TPAMI"},{"doi-asserted-by":"crossref","unstructured":"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\u20131176","key":"110185_CR1951","DOI":"10.1609\/aaai.v27i1.8455"},{"issue":"11","key":"110185_CR1952","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.14778\/2809974.2809980","volume":"8","author":"H Shiokawa","year":"2015","unstructured":"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\u20131189","journal-title":"Proc VLDB Endowment"},{"issue":"4","key":"110185_CR1953","doi-asserted-by":"publisher","first-page":"e42","DOI":"10.1371\/journal.pcbi.0010042","volume":"1","author":"O Sporns","year":"2005","unstructured":"Sporns O, Tononi G, K\u00f6tter R (2005) The Human Connectome: a structural description of the human brain. PLoS Comput Biol 1(4):e42","journal-title":"PLoS Comput Biol"},{"unstructured":"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\u2013490","key":"110185_CR1954"},{"doi-asserted-by":"crossref","unstructured":"Toutanova K, Manning CD (2000) Enriching the knowledge sources used in a maximum entropy part-of-speech tagger. In Proceedings EMNLP 2000, pp 63\u201370","key":"110185_CR1955","DOI":"10.3115\/1117794.1117802"},{"doi-asserted-by":"crossref","unstructured":"Wang L, Xiao Y, Shao B, Wang H (2014) How to partition a billion-node graph. In Proceedings ICDE2014, pp 568\u2013579","key":"110185_CR1956","DOI":"10.1109\/ICDE.2014.6816682"},{"issue":"4","key":"110185_CR1957","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y Xu","year":"2002","unstructured":"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\u2013545","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Xu X, Yuruk N, Geng Z, Schweiger TAJ (2007) SCAN: a structural clustering algorithm for networks. In Proceedings SIGKDD 2007, pp 824\u2013833","key":"110185_CR1958","DOI":"10.1145\/1281192.1281280"},{"doi-asserted-by":"crossref","unstructured":"Yuruk N, Mete M, Xu X, Shweiger TAJ (2007) A divisive hierarchical structural clustering algorithm for networks. In Proceedings ICDM Workshops 2007, pp 441\u2013446","key":"110185_CR1959","DOI":"10.1109\/ICDMW.2007.73"},{"doi-asserted-by":"crossref","unstructured":"Zhou W, Jin H, Liu Y (2012) Community discovery and profiling with social messages. In Proceedings SIGKDD 2012, pp 388\u2013396","key":"110185_CR1960","DOI":"10.1145\/2339530.2339593"}],"container-title":["Encyclopedia of Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-7131-2_110185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T13:29:20Z","timestamp":1661434160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_110185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_110185","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}