{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:16:07Z","timestamp":1780049767238,"version":"3.53.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T00:00:00Z","timestamp":1444867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10115-015-0883-y","type":"journal-article","created":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T04:49:39Z","timestamp":1444884579000},"page":"399-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Inferring lockstep behavior from connectivity pattern in large graphs"],"prefix":"10.1007","volume":"48","author":[{"given":"Meng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Beutel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiqiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,15]]},"reference":[{"issue":"1","key":"883_CR1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1198\/TECH.2009.08136","volume":"52","author":"RA Becker","year":"2010","unstructured":"Becker RA, Volinsky C, Wilks AR (2010) Fraud detection in telecommunications: history and lessons learned. Technometrics 52(1):20\u201333","journal-title":"Technometrics"},{"key":"883_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/11871637_14","volume-title":"Knowledge discovery in databases: PKDD 2006","author":"DH Chau","year":"2006","unstructured":"Chau DH, Pandit S, Faloutsos C (2006) Detecting fraudulent personalities in networks of online auctioneers. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) Knowledge discovery in databases: PKDD 2006. Springer, Berlin Heidelberg, pp 103\u2013114"},{"key":"883_CR3","doi-asserted-by":"crossref","unstructured":"Beutel A, Xu W, Guruswami V, Palow C, Faloutsos C (2013) CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd international conference on World Wide Web, pp 119\u2013130. International World Wide Web Conferences Steering Committee","DOI":"10.1145\/2488388.2488400"},{"key":"883_CR4","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th international conference on World Wide Web, pp 695-704. ACM","DOI":"10.1145\/1367497.1367591"},{"issue":"3","key":"883_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"Santo Fortunato","year":"2010","unstructured":"Fortunato Santo (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"issue":"7","key":"883_CR6","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"Jie Chen","year":"2012","unstructured":"Chen Jie, Saad Yousef (2012) Dense subgraph extraction with application to community detection. Knowl Data Eng IEEE Trans 24(7):1216\u20131230","journal-title":"Knowl Data Eng IEEE Trans"},{"key":"883_CR7","doi-asserted-by":"crossref","unstructured":"Zha H, He X, Ding C, Simon H, Gu M (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on Information and knowledge management, pp 25\u201332. ACM","DOI":"10.1145\/502585.502591"},{"key":"883_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-642-37453-1_22","volume-title":"Advances in knowledge discovery and data mining","author":"S Gnnemann","year":"2013","unstructured":"Gnnemann S, Boden B, Frber I, Seidl T (2013) Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors. In: Pei J, Tseng VS, Cao L, Motoda H, Xu G (eds) Advances in knowledge discovery and data mining. Springer, Berlin, Heidelberg, pp 261\u2013275"},{"issue":"25","key":"883_CR9","doi-asserted-by":"crossref","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung F, Linyuan L (2002) The average distances in random graphs with given expected degrees. Proc Natl Acad Sci 99(25):15879\u201315882","journal-title":"Proc Natl Acad Sci"},{"key":"883_CR10","doi-asserted-by":"crossref","unstructured":"Jiang M, Cui P, Beutel A, Faloutsos C, Yang S (2014) Inferring strange behavior from connectivity pattern in social networks. In: Tseng VS, Ho TB, Zhou Z-H, Chen ALP, Kao H-Y (eds) Advances in knowledge discovery and data mining. Springer, pp 126\u2013138","DOI":"10.1007\/978-3-319-06608-0_11"},{"key":"883_CR11","unstructured":"Chakrabarti S (2002) Mining the web: discovering knowledge from hypertext data. Elsevier, San Francisco"},{"key":"883_CR12","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wang H (2010) Managing and mining graph data, vol 40. Springer, New York","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"883_CR13","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp 228\u2013238. ACM","DOI":"10.1145\/1081870.1081898"},{"issue":"4","key":"883_CR14","first-page":"16","volume":"2","author":"D Jiang","year":"2009","unstructured":"Jiang D, Pei J (2009) Mining frequent cross-graph quasi-cliques. ACM Trans Knowl Discov Data (TKDD) 2(4):16","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"883_CR15","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 286\u2013295. ACM","DOI":"10.1145\/956750.956784"},{"issue":"3","key":"883_CR16","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10115-009-0253-8","volume":"24","author":"M Lahiri","year":"2010","unstructured":"Lahiri M, Berger-Wolf TY (2010) Periodic subgraph mining in dynamic networks. Knowl Inf Syst 24(3):467\u2013497","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"883_CR17","doi-asserted-by":"crossref","first-page":"454","DOI":"10.14778\/2140436.2140442","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Kumar R, Vassilvitskii Sergei (2012) Densest subgraph in streaming and mapreduce. Proc VLDB Endow 5(5):454\u2013465","journal-title":"Proc VLDB Endow"},{"key":"883_CR18","doi-asserted-by":"crossref","unstructured":"Jiang M, Cui P, Beutel A, Faloutsos C, Yang S (2014) CatchSync: catching synchronized behavior in large directed graphs. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 941\u2013950. ACM","DOI":"10.1145\/2623330.2623632"},{"issue":"1","key":"883_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1142\/S0218213008003753","volume":"17","author":"HDK Moonesinghe","year":"2008","unstructured":"Moonesinghe HDK, Tan P-N (2008) Outrank: a graph-based outlier detection framework using random walk. Int J Artif Intell Tools 17(1):19\u201336","journal-title":"Int J Artif Intell Tools"},{"issue":"1","key":"883_CR20","doi-asserted-by":"crossref","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":"11","key":"883_CR21","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(11):1944\u20131957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"883_CR22","doi-asserted-by":"crossref","unstructured":"Chakrabarti D (2004) Autopart: Parameter-free graph partitioning and outlier detection. In: Boulicaut J-F, Esposito F, Giannotti F, Pedreschi D (eds) Knowledge discovery in databases: PKDD 2004, vol 3202. Springer, Berlin, Heidelberg, pp 112\u2013124","DOI":"10.1007\/978-3-540-30116-5_13"},{"issue":"1","key":"883_CR23","first-page":"410","volume":"17","author":"L Akoglu","year":"2010","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. AKDDM 17(1):410\u2013421","journal-title":"AKDDM"},{"key":"883_CR24","doi-asserted-by":"crossref","unstructured":"Feng J, He X, Konte B, Bhm C, Plant C (2012) Summarization-based mining bipartite graphs. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1249\u20131257. ACM","DOI":"10.1145\/2339530.2339725"},{"key":"883_CR25","doi-asserted-by":"crossref","unstructured":"Jiang M, Cui P, Beutel A, Faloutsos C, Yang S (2014) Detecting suspicious following behavior in multimillion-node social networks. In: Proceedings of the companion publication of the 23rd international conference on World wide web companion, pp 305\u2013306. International World Wide Web Conferences Steering Committee","DOI":"10.1145\/2567948.2577306"},{"key":"883_CR26","doi-asserted-by":"crossref","unstructured":"Jiang M, Hooi B, Beutel A, Yang S, Cui P, Faloutsos C (2015) A general suspiciousness metric for dense blocks in multimodal data. In: Proceedings of IEEE international conference on data mining. IEEE","DOI":"10.1109\/ICDM.2015.61"},{"key":"883_CR27","doi-asserted-by":"crossref","unstructured":"Yan D, Huang L, Jordan MI (2009) Fast approximate spectral clustering. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 907\u2013916. ACM","DOI":"10.1145\/1557019.1557118"},{"key":"883_CR28","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering analysis and an algorithm. In: Proceedings of advances in neural information processing systems. Cambridge, MIT Press 14: 849\u2013856"},{"key":"883_CR29","unstructured":"Huang L, Yan D, Jordan MI, Taft N (2008) Spectral clustering with perturbed data. In: NIPS, vol 21"},{"key":"883_CR30","doi-asserted-by":"crossref","unstructured":"Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C (2010) Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Advances in knowledge discovery and data mining, pp 435\u2013448. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"883_CR31","first-page":"709","volume":"9","author":"X Ying","year":"2009","unstructured":"Ying X, Xintao W (2009) On randomness measures for social networks. SDM 9:709\u2013720","journal-title":"SDM"},{"key":"883_CR32","unstructured":"Wu L, Ying X, Wu X, Zhou Z-H (2011) Line orthogonality in adjacency eigenspace with application to community partition. In: Proceedings of the twenty-second international joint conference on artificial intelligence, Vol 3, pp 2349\u20132354. AAAI Press"},{"issue":"3","key":"883_CR33","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"Mark EJ Newman","year":"2006","unstructured":"Newman Mark EJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"key":"883_CR34","doi-asserted-by":"crossref","unstructured":"Satuluri V, Parthasarathy S (2009) Scalable graph clustering using stochastic flows: applications to community discovery. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 737\u2013746. ACM","DOI":"10.1145\/1557019.1557101"},{"issue":"6","key":"883_CR35","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"C Aaron","year":"2004","unstructured":"Aaron C, Newman MEJ, Cristopher M (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"key":"883_CR36","doi-asserted-by":"crossref","unstructured":"Wakita K, Tsurumi T (2007) Finding community structure in mega-scale social networks:[extended abstract]. In: Proceedings of the 16th international conference on World Wide Web, pp 1275\u20131276. ACM","DOI":"10.1145\/1242572.1242805"},{"key":"883_CR37","doi-asserted-by":"crossref","first-page":"2","DOI":"10.2307\/2687269","volume":"27","author":"D Kalman","year":"1996","unstructured":"Kalman D (1996) A singularly valuable decomposition: the SVD of a matrix. Coll Math J 27:2\u201323","journal-title":"Coll Math J"},{"issue":"8","key":"883_CR38","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1145\/358198.358222","volume":"27","author":"DRK Brownrigg","year":"1984","unstructured":"Brownrigg DRK (1984) The weighted median filter. Commun ACM 27(8):807\u2013818","journal-title":"Commun ACM"},{"issue":"2","key":"883_CR39","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TKDE.2012.244","volume":"26","author":"U Kang","year":"2014","unstructured":"Kang U, Meeder B, Papalexakis EE, Faloutsos C (2014) Heigen: spectral analysis for billion-scale graphs. Knowl Data Eng IEEE Trans 26(2):350\u2013362","journal-title":"Knowl Data Eng IEEE Trans"},{"issue":"1","key":"883_CR40","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener Janet (2000) Graph structure in the web. Comput Netw 33(1):309\u2013320","journal-title":"Comput Netw"},{"key":"883_CR41","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: ACM SIGCOMM computer communication review, vol 29, no 4, pp 251\u2013262. ACM","DOI":"10.1145\/316194.316229"},{"key":"883_CR42","doi-asserted-by":"crossref","unstructured":"Hall BH, Jaffe AB, Trajtenberg M (2001) The NBER patent citations data file: lessons, insights and methodological tools. In: NBER working papers 8498, National Bureau of Economic Research, Inc","DOI":"10.3386\/w8498"},{"issue":"2","key":"883_CR43","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s11518-010-5134-x","volume":"19","author":"CV Trappey","year":"2001","unstructured":"Trappey CV, Trappey AJC, Wu C-Y (2001) Clustering patents using non-exhaustive overlaps. J Syst Sci Syst Eng 19(2):162\u2013181","journal-title":"J Syst Sci Syst Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0883-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0883-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0883-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:18Z","timestamp":1559110278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0883-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,15]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["883"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0883-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,15]]}}}