{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:32Z","timestamp":1740160292484,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"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":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0399-9","type":"journal-article","created":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T01:06:49Z","timestamp":1475284009000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A scalable geometric algorithm for community detection from social networks with incremental update"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5239-6674","authenticated-orcid":false,"given":"Subu","family":"Surendran","sequence":"first","affiliation":[]},{"given":"D.","family":"Chithraprasad","sequence":"additional","affiliation":[]},{"given":"M. Ramachandra","family":"Kaimal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,1]]},"reference":[{"issue":"3","key":"399_CR1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","volume":"66","author":"G Agarwal","year":"2008","unstructured":"Agarwal G, Kempe D (2008) Modularity-maximizing graph communities via mathematical programming. Eur Phys J B 66(3):409\u2013418","journal-title":"Eur Phys J B"},{"key":"399_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining graph data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Wang H (2010) Managing and mining graph data. Springer, New York"},{"key":"399_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"ER Barnes","year":"1982","unstructured":"Barnes ER (1982) An algorithm for partitioning the nodes of a graph. SIAM J Algebraic Discret Methods 3:541\u2013550","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"399_CR4","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"399_CR5","unstructured":"Brand M, Huang K (2003) A unifying theorem for spectral embedding and clustering. In: AISTATS"},{"issue":"1","key":"399_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCSS.2014.2307458","volume":"1","author":"M Chen","year":"2014","unstructured":"Chen M, Kuzmin K, Szymanski BK (2014) Community detection via maximization of modularity and its variants. IEEE Trans Comput Soc Syst 1(1):46\u201365","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"399_CR8","volume-title":"Spectral graph theory","author":"FRK Chung","year":"1997","unstructured":"Chung FRK (1997) Spectral graph theory, vol 92. American Mathematical Society, Providence"},{"key":"399_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","volume":"18","author":"A Condon","year":"2001","unstructured":"Condon A, Karp RM (2001) Algorithms for graph partitioning on the planted partition model. Random Struct Algorithms 18:116\u2013140 Citeseer","journal-title":"Random Struct Algorithms"},{"key":"399_CR10","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.neucom.2013.11.015","volume":"131","author":"C Dhanjal","year":"2014","unstructured":"Dhanjal C, Gaudel R, Cl\u00e9men\u00e7on S (2014) Efficient eigen-updating for spectral graph clustering. Neurocomputing 131:440\u2013452 Elsevier","journal-title":"Neurocomputing"},{"key":"399_CR11","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon IS, Guan Y, Kulis B (2007) Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans Pattern Anal Mach Intell 29:1944\u20131957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"399_CR12","unstructured":"DuBois CL (2008) UCI network data repository. University of California, Irvine, School of Information and Computer Sciences. http:\/\/networkdata.ics.uci.edu"},{"key":"399_CR13","doi-asserted-by":"crossref","unstructured":"Duchon J (1977) Splines minimizing rotation-invariant semi-norms in Sobolev spaces. In: Schempp W, Zeller K(eds) Constructive theory of functions of several variables. Springer, Berlin Heidelberg, pp 85\u2013100","DOI":"10.1007\/BFb0086566"},{"key":"399_CR14","doi-asserted-by":"crossref","unstructured":"Ganti V, Ramakrishnan R, Gehrke J, Powell A, French J (1999) Clustering large datasets in arbitrary metric spaces. In: Proceedings of the 15th IEEE international conference on data engineering, 1999, pp 502\u2013511","DOI":"10.1109\/ICDE.1999.754966"},{"issue":"1","key":"399_CR16","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979)\u00a0Algorithm as 136: A k-means clustering algorithm. J R Stat Soc. Series C (Applied Statistics) 28(1):100\u2013108","journal-title":"J R Stat Soc. Series C (Applied Statistics)"},{"issue":"1","key":"399_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998)\u00a0A 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":"399_CR18","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev 41(2):278\u2013300","journal-title":"SIAM Rev"},{"key":"399_CR19","unstructured":"Karypis G, Vipin K (1997) A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm. In: PPSC"},{"issue":"2","key":"399_CR20","doi-asserted-by":"crossref","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"},{"issue":"4","key":"399_CR21","first-page":"46","volume":"78","author":"Andrea Lancichinetti","year":"2008","unstructured":"Lancichinetti Andrea, Fortunato Santo, Radicchi Filippo (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):46\u2013110","journal-title":"Phys Rev E"},{"key":"399_CR22","doi-asserted-by":"crossref","unstructured":"Lanczos C (1950) An iteration method for the solution of the eigen- value problem of linear differential and integral operators. United States Government. Press Office","DOI":"10.6028\/jres.045.026"},{"key":"399_CR23","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"4","key":"399_CR24","doi-asserted-by":"crossref","first-page":"046101","DOI":"10.1103\/PhysRevE.71.046101","volume":"71","author":"CP Massen","year":"2005","unstructured":"Massen CP, Doye JPK (2005) Identifying communities within energy landscapes. Phys Rev E 71(4):046101","journal-title":"Phys Rev E"},{"issue":"2","key":"399_CR25","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.physa.2005.04.022","volume":"358","author":"A Medus","year":"2005","unstructured":"Medus A, Acuna G, Dorso CO (2005) Detection of community structures in networks via global optimization. Phys A Stat Mech Appl 358(2):593\u2013604 Elsevier","journal-title":"Phys A Stat Mech Appl"},{"issue":"4","key":"399_CR26","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.patcog.2003.09.005","volume":"37","author":"W Min","year":"2004","unstructured":"Min W, Ke L, He X (2004) Locality pursuit embedding. Pattern Recognit 37(4):781\u2013788","journal-title":"Pattern Recognit"},{"issue":"6","key":"399_CR27","first-page":"066","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066\u2013133","journal-title":"Phys Rev E"},{"issue":"23","key":"399_CR28","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"399_CR29","doi-asserted-by":"crossref","first-page":"042822","DOI":"10.1103\/PhysRevE.88.042822","volume":"88","author":"MEJ Newman","year":"2013","unstructured":"Newman MEJ (2013) Spectral methods for community detection and graph partitioning. Phys Rev E 88(4):042822","journal-title":"Phys Rev E"},{"key":"399_CR30","first-page":"849","volume":"2","author":"AY Ng","year":"2002","unstructured":"Ng AY, Jordan MI, Weiss Y et al (2002)\u00a0On spectral clustering: Analysis and an algorithm. Adv Neural Inf Process Syst 2:849\u2013856","journal-title":"Adv Neural Inf Process Syst"},{"key":"399_CR31","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 of the IEEE INFOCOM, pp 2282\u20132290","DOI":"10.1109\/INFCOM.2011.5935045"},{"issue":"4","key":"399_CR32","doi-asserted-by":"crossref","first-page":"e91431","DOI":"10.1371\/journal.pone.0091431","volume":"9","author":"NP Nguyen","year":"2014","unstructured":"Nguyen NP, Dinh TN, Shen Y, Thai MT (2014) Dynamic social community detection and its applications. PloS One 9(4):e91431","journal-title":"PloS One"},{"key":"399_CR33","doi-asserted-by":"crossref","unstructured":"Ning H, Xu W, Chi Y, Gong Y, Huang TS (2007) Incremental spectral clustering with application to monitoring of evolving blog communities. In: SIAM, pp 261\u2013272","DOI":"10.1137\/1.9781611972771.24"},{"key":"399_CR34","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"2012","unstructured":"Preparata FP, Shamos M (2012) Computational geometry: an introduction. Springer, New York"},{"key":"399_CR35","doi-asserted-by":"crossref","unstructured":"Rattigan MJ, Maier M, Jensen D (2007) Graph clustering with network structure indices. In: Proceedings of the 24th international conference on machine learning, ACM, pp 783\u2013790","DOI":"10.1145\/1273496.1273595"},{"issue":"39","key":"399_CR36","doi-asserted-by":"crossref","first-page":"15224","DOI":"10.1073\/pnas.0703740104","volume":"104","author":"M Sales-Pardo","year":"2007","unstructured":"Sales-Pardo M, Guimera R, Moreira AA, Nunes Amaral LA (2007) Extracting the hierarchical organization of complex systems. Proc Natl Acad Sci 104(39):15224\u201315229","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"399_CR37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s11390-012-1227-y","volume":"27","author":"H-W Shen","year":"2012","unstructured":"Shen H-W, Cheng X-Q, Wang Y-Z, Chen Y (2012) A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks. J Comput Sci Technol 27(2):341\u2013357","journal-title":"J Comput Sci Technol"},{"key":"399_CR38","doi-asserted-by":"crossref","unstructured":"Surendran S, Chitraprasad D, Kaimal MR (2014) Voronoi diagram-based geometric approach for social network analysis. In: Computational intelligence, cyber security and computational models, Springer, pp 359\u2013369","DOI":"10.1007\/978-81-322-1680-3_39"},{"issue":"1\u201341","key":"399_CR40","first-page":"66","volume":"10","author":"Laurens JP Maaten van der","year":"2009","unstructured":"van der Maaten Laurens JP, Postma Eric O, van den Herik H Jaap (2009) Dimensionality reduction: a comparative review. J Mach Learn Res 10(1\u201341):66\u201371","journal-title":"J Mach Learn Res"},{"key":"399_CR41","doi-asserted-by":"crossref","unstructured":"Whang JJ, Sui X, Dhillon IS (2012) Scalable and memory efficient clustering of large-scale social networks. In: IEEE 12th international conference on data mining (ICDM), pp 705\u2013714","DOI":"10.1109\/ICDM.2012.148"},{"issue":"2","key":"399_CR42","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10115-008-0161-3","volume":"19","author":"Shiming Xiang","year":"2009","unstructured":"Xiang Shiming, Nie Feiping, Song Yangqiu, Zhang Changshui, Zhang Chunxia (2009) Embedding new data points for manifold learning via coordinate propagation. Knowl Inf Syst 19(2):159\u2013184","journal-title":"Knowl Inf Syst"},{"key":"399_CR43","doi-asserted-by":"crossref","unstructured":"Xie J, Chen M, Szymanski BK (2013) LabelrankT: incremental community detection in dynamic networks via label propagation. In: Proceedings of the workshop on dynamic networks management and mining, ACM, pp 25\u201332","DOI":"10.1145\/2489247.2489249"},{"key":"399_CR44","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452\u2013473","journal-title":"J Anthropol Res"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0399-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0399-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0399-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T01:30:09Z","timestamp":1568424609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0399-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["399"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0399-9","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2016,10,1]]},"article-number":"90"}}