{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:37Z","timestamp":1740160297382,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSF","award":["IIS-1149851"],"award-info":[{"award-number":["IIS-1149851"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-017-0481-y","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T12:43:36Z","timestamp":1513860216000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Incremental eigenpair computation for graph Laplacian matrices: theory and applications"],"prefix":"10.1007","volume":"8","author":[{"given":"Pin-Yu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8802-7237","authenticated-orcid":false,"given":"Baichuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"481_CR1","first-page":"333","volume":"4","author":"S Basu","year":"2004","unstructured":"Basu S, Banerjee A, Mooney RJ (2004) Active semi-supervision for pairwise constrained clustering. SDM 4:333\u2013344","journal-title":"SDM"},{"issue":"6","key":"481_CR2","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396","journal-title":"Neural Comput"},{"key":"481_CR3","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"},{"issue":"1","key":"481_CR4","first-page":"21","volume":"2","author":"D Calvetti","year":"1994","unstructured":"Calvetti D, Reichel L, Sorensen DC (1994) An implicitly restarted lanczos method for large symmetric eigenvalue problems. Electr Trans Numer Anal 2(1):21","journal-title":"Electr Trans Numer Anal"},{"issue":"21","key":"481_CR5","doi-asserted-by":"crossref","first-page":"5706","DOI":"10.1109\/TSP.2015.2458782","volume":"63","author":"P-Y Chen","year":"2015","unstructured":"Chen P-Y, Hero A (2015) Deep community detection. IEEE Trans Signal Process 63(21):5706\u20135719","journal-title":"IEEE Trans Signal Process"},{"issue":"16","key":"481_CR6","doi-asserted-by":"crossref","first-page":"4339","DOI":"10.1109\/TSP.2015.2442958","volume":"63","author":"P-Y Chen","year":"2015","unstructured":"Chen P-Y, Hero A (2015) Phase transitions in spectral community detection. IEEE Trans Signal Process 63(16):4339\u20134347","journal-title":"IEEE Trans Signal Process"},{"key":"481_CR7","doi-asserted-by":"crossref","unstructured":"Chen P-Y, Hero AO (2013) Node removal vulnerability of the largest component of a network. In: GlobalSIP, pp 587\u2013590","DOI":"10.1109\/GlobalSIP.2013.6736946"},{"issue":"11","key":"481_CR8","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/MCOM.2014.6957154","volume":"52","author":"P-Y Chen","year":"2014","unstructured":"Chen P-Y, Hero AO (2014) Assessing and safeguarding network resilience to nodal attacks. IEEE Commun Mag 52(11):138\u2013143","journal-title":"IEEE Commun Mag"},{"key":"481_CR9","unstructured":"Chen P-Y, Hero AO (2016) Phase transitions and a model order selection criterion for spectral graph clustering. arXiv preprint \n                        arXiv:1604.03159"},{"key":"481_CR10","volume-title":"Spectral graph theory","author":"FRK Chung","year":"1997","unstructured":"Chung FRK (1997) Spectral graph theory. American Mathematical Society, Providence"},{"key":"481_CR11","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","journal-title":"Neurocomputing"},{"key":"481_CR12","volume-title":"Matrix analysis","author":"RA Horn","year":"1990","unstructured":"Horn RA, Johnson CR (1990) Matrix analysis. Cambridge University Press, Cambridge"},{"issue":"16","key":"481_CR13","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1016\/j.patrec.2009.08.005","volume":"30","author":"P Jia","year":"2009","unstructured":"Jia P, Yin J, Huang X, Hu D (2009) Incremental laplacian eigenmaps by preserving adjacent information between data points. Pattern Recognit Lett 30(16):1457\u20131463","journal-title":"Pattern Recognit Lett"},{"key":"481_CR14","doi-asserted-by":"crossref","first-page":"20935","DOI":"10.1073\/pnas.1312486110","volume":"110","author":"F Krzakala","year":"2013","unstructured":"Krzakala F, Moore C, Mossel E, Neeman J, Sly A, Zdeborova L, Zhang P (2013) Spectral redemption in clustering sparse networks. Proc Natl Acad Sci 110:20935\u201320940","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"481_CR15","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczynski","year":"1992","unstructured":"Kuczynski J, Wozniakowski H (1992) Estimating the largest eigenvalue by the power and lanczos algorithms with a random start. SIAM J Matrix Anal Appl 13(4):1094\u20131122","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"4","key":"481_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos C (1950) An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res Natl Bureau Stand 45(4):255\u2013282","journal-title":"J Res Natl Bureau Stand"},{"key":"481_CR17","unstructured":"Larsen RM (2000) Computing the SVD for large and sparse matrices. SCCM, Stanford University, June 16"},{"key":"481_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods","author":"RB Lehoucq","year":"1998","unstructured":"Lehoucq RB, Sorensen DC, Yang C (1998) ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods, vol 6. SIAM, New Delhi"},{"issue":"4","key":"481_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"481_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197\u2013198","author":"R Merris","year":"1994","unstructured":"Merris R (1994) Laplacian matrices of graphs: a survey. Linear Alg Appl 197\u2013198:143\u2013176","journal-title":"Linear Alg Appl"},{"key":"481_CR21","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: NIPS, pp 849\u2013856"},{"key":"481_CR22","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: SDM, pp 261\u2013272","DOI":"10.1137\/1.9781611972771.24"},{"issue":"1","key":"481_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.patcog.2009.06.001","volume":"43","author":"H Ning","year":"2010","unstructured":"Ning H, Xu W, Chi Y, Gong Y, Huang TS (2010) Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognit 43(1):113\u2013127","journal-title":"Pattern Recognit"},{"issue":"1","key":"481_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber R, Fax J, Murray R (2007) Consensus and cooperation in networked multi-agent systems. Proc IEEE 95(1):215\u2013233","journal-title":"Proc IEEE"},{"key":"481_CR25","volume-title":"The symmetric eigenvalue problem","author":"BN Parlett","year":"1980","unstructured":"Parlett BN (1980) The symmetric eigenvalue problem, vol 7. SIAM, New Delhi"},{"key":"481_CR26","unstructured":"Polito M, Perona P (2001) Grouping and dimensionality reduction by locally linear embedding. In: NIPS"},{"key":"481_CR27","unstructured":"Poon LKM, Liu AH, Liu T, Zhang NL (2012) A model-based approach to rounding in spectral clustering. In: UAI, pp 68\u2013694"},{"issue":"3","key":"481_CR28","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Simon HD, Liou K-P (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 11(3):430\u2013452","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"11","key":"481_CR29","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1038\/nphys2761","volume":"9","author":"F Radicchi","year":"2013","unstructured":"Radicchi F, Arenas A (2013) Abrupt transition in the structural formation of interconnected networks. Nat Phys 9(11):717\u2013720","journal-title":"Nat Phys"},{"key":"481_CR30","doi-asserted-by":"crossref","unstructured":"Ranjan G, Zhang Z-L, Boley D (2014) Incremental computation of pseudo-inverse of laplacian. In: Combinatorial optimization and applications. Springer. pp 729\u2013749","DOI":"10.1007\/978-3-319-12691-3_54"},{"key":"481_CR31","doi-asserted-by":"crossref","unstructured":"Saade A, Krzakala F, Lelarge M, Zdeborova L (2015) Spectral detection in the censored block model. \n                        arXiv:1502.00163","DOI":"10.1109\/ISIT.2015.7282642"},{"issue":"8","key":"481_CR32","doi-asserted-by":"crossref","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 Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"481_CR33","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"D Shuman","year":"2013","unstructured":"Shuman D, Narang S, Frossard P, Ortega A, Vandergheynst P (2013) The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process Mag 30(3):83\u201398","journal-title":"IEEE Signal Process Mag"},{"key":"481_CR34","unstructured":"Van\u00a0Dongen SM (2000) Graph clustering by flow simulation. PhD thesis, University of Utrecht"},{"key":"481_CR35","first-page":"76","volume":"5","author":"S White","year":"2005","unstructured":"White S, Smyth P (2005) A spectral clustering approach to finding communities in graph. SDM 5:76\u201384","journal-title":"SDM"},{"issue":"2","key":"481_CR36","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu K, Simon H (2000) Thick-restart lanczos method for large symmetric eigenvalue problems. SIAM J Matrix Anal Appl 22(2):602\u2013616","journal-title":"SIAM J Matrix Anal Appl"},{"key":"481_CR37","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810114","volume-title":"Data mining and analysis: fundamental concepts and algorithms","author":"MJ Zaki","year":"2014","unstructured":"Zaki MJ, Jr WM (2014) Data mining and analysis: fundamental concepts and algorithms. Cambridge University Press, Cambridge"},{"key":"481_CR38","unstructured":"Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. In: NIPS, pp 1601\u20131608"},{"key":"481_CR39","unstructured":"Zhang B, Choudhury S, Hasan MA, Ning X, Agarwal K, Cabrera PP (2016) Trust from the past: Bayesian personalized ranking based link prediction in knowledge graphs. In: SDM MNG workshop"},{"key":"481_CR40","doi-asserted-by":"crossref","unstructured":"Zhang B, Saha TK, Hasan MA (2014) Name disambiguation from link data in a collaboration graph. In: ASONAM, pp 81\u201384","DOI":"10.1109\/ASONAM.2014.6921563"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-017-0481-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T09:00:05Z","timestamp":1544691605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-017-0481-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s13278-017-0481-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"article-number":"4"}}