{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:29:55Z","timestamp":1772130595574,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T00:00:00Z","timestamp":1493164800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s40537-017-0073-8","type":"journal-article","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T12:50:43Z","timestamp":1493211043000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Outlier edge detection using random graph generation models and applications"],"prefix":"10.1186","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8229-852X","authenticated-orcid":false,"given":"Honglei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serkan","family":"Kiranyaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moncef","family":"Gabbouj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,26]]},"reference":[{"key":"73_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M. Networks: an introduction. 1st ed. New York: Oxford; 2010.","edition":"1"},{"key":"73_CR2","doi-asserted-by":"publisher","unstructured":"Jiang M, Cui P, Beutel A, Faloutsos C, Yang S. CatchSync: catching synchronized behavior in large directed graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining., KDD \u201914. New York: ACM; 2014. p. 941\u201350.","DOI":"10.1145\/2623330.2623632"},{"key":"73_CR3","doi-asserted-by":"publisher","unstructured":"Beutel A, Xu W, Guruswami V, Palow C, Faloutsos C. CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd international conference on World Wide Web, 2013. p. 119\u2013130.","DOI":"10.1145\/2488388.2488400"},{"issue":"1","key":"73_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2980765.2980767","volume":"18","author":"R Yu","year":"2016","unstructured":"Yu R, Qiu H, Wen Z, Lin C, Liu Y. A survey on social media anomaly detection. SIGKDD Explor Newslett. 2016;18(1):1\u201314.","journal-title":"SIGKDD Explor Newslett"},{"issue":"3","key":"73_CR5","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D. Graph based anomaly detection and description: a survey. Data Mining Knowl Discov. 2015;29(3):626\u201388.","journal-title":"Data Mining Knowl Discov"},{"key":"73_CR6","doi-asserted-by":"publisher","unstructured":"Noble CC, Cook DJ. Graph-based anomaly detection. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining. KDD '03, Washington, D.C. New York: ACM; 2003. p. 631\u2013636. doi: 10.1145\/956750.956831 .","DOI":"10.1145\/956750.956831"},{"key":"73_CR7","doi-asserted-by":"publisher","unstructured":"Dai H, Zhu F, Lim EP, Pang H. Detecting anomalies in bipartite graphs with mutual dependency principles. In: 2012 IEEE 12th international conference on data mining (ICDM). IEEE; 2012. p. 171\u201380.","DOI":"10.1109\/ICDM.2012.167"},{"key":"73_CR8","doi-asserted-by":"publisher","unstructured":"Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L. Rolx: structural role extraction & mining in large graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM; 2012. p. 1231\u20139.","DOI":"10.1145\/2339530.2339723"},{"issue":"2","key":"73_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/B:AIRE.0000045502.10941.a9","volume":"22","author":"VJ Hodge","year":"2004","unstructured":"Hodge VJ, Austin J. A survey of outlier detection methodologies. Artif Intell Rev. 2004;22(2):85\u2013126.","journal-title":"Artif Intell Rev"},{"key":"73_CR10","doi-asserted-by":"publisher","unstructured":"Xu X, Yuruk N, Feng Z, Schweiger TAJ. SCAN: a structural clustering algorithm for networks. Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining., KDD \u201907. New York: ACM; 2007. p. 824\u201333.","DOI":"10.1145\/1281192.1281280"},{"key":"73_CR11","doi-asserted-by":"publisher","unstructured":"Gao J, Liang F, Fan W, Wang C, Sun Y, Han J. On community outliers and their efficient detection in information networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining., KDD \u201910. New York: ACM; 2010. p. 813\u201322.","DOI":"10.1145\/1835804.1835907"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C. oddball: spotting anomalies in weighted graphs. In: Zaki MJ, Yu JX, Ravindran B, Pudi V, eds. Advances in knowledge discovery and data mining. Lecture notes in computer science. 2010. pp. 410\u2013421.","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"73_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.eswa.2016.10.026","volume":"69","author":"L Liu","year":"2017","unstructured":"Liu L, Zuo WL, Peng T. Detecting outlier pairs in complex network based on link structure and semantic relationship. Expert Syst Appl. 2017;69:40\u20139.","journal-title":"Expert Syst Appl"},{"key":"73_CR14","doi-asserted-by":"publisher","unstructured":"Chakrabarti D. AutoPart: parameter-free graph partitioning and outlier detection. In: Boulicaut JF, Esposito F, Giannotti F, Pedreschi D, eds. Knowledge discovery in databases: PKDD 2004. Lecture notes in computer science. 2004. p. 112\u201324.","DOI":"10.1007\/978-3-540-30116-5_13"},{"key":"73_CR15","doi-asserted-by":"publisher","unstructured":"Easley D, Kleinberg J. Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press; 2010.","DOI":"10.1017\/CBO9780511761942"},{"issue":"6","key":"73_CR16","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L Lu","year":"2011","unstructured":"Lu L, Zhou T. Link prediction in complex networks: a survey. Physica A Stat Mech Appl. 2011;390(6):1150\u201370.","journal-title":"Physica A Stat Mech Appl"},{"key":"73_CR17","doi-asserted-by":"publisher","unstructured":"Barbieri N, Bonchi F, Manco G. Who to follow and why: link prediction with explanations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining., KDD \u201914. New York: ACM; 2014. p. 1266\u201375.","DOI":"10.1145\/2623330.2623733"},{"issue":"3","key":"73_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0165-4896(82)90076-2","volume":"3","author":"LC Freeman","year":"1982","unstructured":"Freeman LC. Centered graphs and the structure of ego networks. Math Soc Sci. 1982;3(3):291\u2013304.","journal-title":"Math Soc Sci"},{"issue":"6684","key":"73_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH. Collective dynamics of \u2018small-world\u2019networks. Nature. 1998;393(6684):440\u20132.","journal-title":"Nature"},{"key":"73_CR20","doi-asserted-by":"publisher","unstructured":"Coscia M, Rossetti G, Giannotti F, Pedreschi D. DEMON: a local-first discovery method for overlapping communities. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining., KDD \u201912. New York: ACM; 2012. p. 615\u201323.","DOI":"10.1145\/2339530.2339630"},{"key":"73_CR21","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B. Random graphs. 2 ed. Cambridge : New York; 2001.","DOI":"10.1017\/CBO9780511814068"},{"issue":"23","key":"73_CR22","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ. Modularity and community structure in networks. Proc Natl Acad Sci. 2006;103(23):8577\u201382.","journal-title":"Proc Natl Acad Sci"},{"key":"73_CR23","doi-asserted-by":"publisher","unstructured":"Cho E, Myers SA, Leskovec J. Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. New York: ACM; 2011. p. 1082\u201390.","DOI":"10.1145\/2020408.2020579"},{"key":"73_CR24","doi-asserted-by":"publisher","unstructured":"Kunegis J. Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web. New York: ACM; 2013. p. 1343\u201350.","DOI":"10.1145\/2487788.2488173"},{"key":"73_CR25","doi-asserted-by":"publisher","unstructured":"Massa P, Salvetti M, Tomasoni D. Bowling alone and trust decline in social network sites. In: IEEE International conference on dependable, autonomic and secure computing, 2009. DASC\u201909 Eighth. 2009. p. 658\u201363.","DOI":"10.1109\/DASC.2009.130"},{"key":"73_CR26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1609\/icwsm.v4i1.14024","volume":"10","author":"M Choudhury De","year":"2010","unstructured":"De Choudhury M, Lin YR, Sundaram H, Candan KS, Xie L, Kelliher A. How does the data sampling strategy impact the discovery of information diffusion in social media? ICWSM. 2010;10:34\u201341.","journal-title":"ICWSM"},{"key":"73_CR27","doi-asserted-by":"publisher","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP. On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM workshop on online social networks. New York: ACM; 2009. p. 37\u201342.","DOI":"10.1145\/1592665.1592675"},{"issue":"1","key":"73_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C. Graph evolution: densification and shrinking diameters. ACM Transa Knowl Discov Data. 2007;1(1):2.","journal-title":"ACM Transa Knowl Discov Data"},{"issue":"1","key":"73_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J. Defining and evaluating network communities based on ground-truth. Knowl Inform Syst. 2015;42(1):181\u2013213.","journal-title":"Knowl Inform Syst"},{"key":"73_CR30","doi-asserted-by":"publisher","unstructured":"Leskovec J, Lang KJ, Dasgupta A. Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th international conference on World Wide Web. New York: ACM; 2008. pp. 695\u2013704.","DOI":"10.1145\/1367497.1367591"},{"issue":"3\u20135","key":"73_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S. Community detection in graphs. Phys Rep. 2010;486(3\u20135):75\u2013174.","journal-title":"Phys Rep"},{"issue":"5","key":"73_CR32","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1002\/sam.10133","volume":"4","author":"M Coscia","year":"2011","unstructured":"Coscia M, Giannotti F, Pedreschi D. A classification for community discovery methods in complex networks. Stat Anal Data Min. 2011;4(5):512\u201346.","journal-title":"Stat Anal Data Min"},{"issue":"3","key":"73_CR33","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2011","unstructured":"Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P. Community detection in social media. Data Min Knowl Discov. 2011;24(3):515\u201354.","journal-title":"Data Min Knowl Discov"},{"issue":"10","key":"73_CR34","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech Theory Exp. 2008;2008(10):10008.","journal-title":"J Stat Mech Theory Exp"},{"issue":"09","key":"73_CR35","doi-asserted-by":"publisher","first-page":"09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J, Arenas A. Comparing community structure identification. J Stat Mech Theory Exp. 2005;2005(09):09008.","journal-title":"J Stat Mech Theory Exp"},{"issue":"2","key":"73_CR36","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M. Finding and evaluating community structure in networks. Phys Rev E. 2004;69(2):026113.","journal-title":"Phys Rev E"},{"issue":"1","key":"73_CR37","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE. Graph clustering. Comput Sci Rev. 2007;1(1):27\u201364.","journal-title":"Comput Sci Rev"},{"issue":"11","key":"73_CR38","doi-asserted-by":"publisher","first-page":"11010","DOI":"10.1088\/1742-5468\/2006\/11\/P11010","volume":"2006","author":"L Danon","year":"2006","unstructured":"Danon L, D\u00edaz-Guilera A, Arenas A. The effect of size heterogeneity on community identification in complex networks. J Stat Mech Theory Exp. 2006;2006(11):11010.","journal-title":"J Stat Mech Theory Exp"},{"issue":"4","key":"73_CR39","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Phys Rev E. 2008;78(4):046110.","journal-title":"Phys Rev E."},{"issue":"6","key":"73_CR40","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME. Fast algorithm for detecting community structure in networks. Phys Rev E. 2004;69(6):066133.","journal-title":"Phys Rev E."},{"key":"73_CR41","doi-asserted-by":"publisher","unstructured":"Ana LN, Jain AK. Robust data clustering. In: Proceedings 2003 IEEE computer society conference on computer vision and pattern recognition, 2003. vol. 2, p. 128\u20131332.","DOI":"10.1109\/CVPR.2003.1211462"},{"issue":"1","key":"73_CR42","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1186\/s40537-016-0060-5","volume":"3","author":"H Zhang","year":"2016","unstructured":"Zhang H, Raitoharju J, Kiranyaz S, Gabbouj M. Limited random walk algorithm for big graph data clustering. J Big Data. 2016;3(1):26.","journal-title":"J Big Data"},{"issue":"11","key":"73_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2013-40829-0","volume":"86","author":"L Waltman","year":"2013","unstructured":"Waltman L, Eck NJV. A smart local moving algorithm for large-scale modularity-based community detection. The. Eur Phys J B. 2013;86(11):1\u201314.","journal-title":"Eur Phys J B"},{"issue":"4","key":"73_CR44","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT. Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci. 2008;105(4):1118\u201323.","journal-title":"Proc Natl Acad Sci"},{"key":"73_CR45","unstructured":"Dongen S. Graph clustering by flow simulation. PhD thesis, Utrecht: Universiteit Utrecht; 2000."},{"key":"73_CR46","unstructured":"Theodoridis S, Koutroumbas K. Pattern recognition. 4 ed. Amsterdam; 2008."},{"issue":"3","key":"73_CR47","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ. Data clustering: a review. ACM Comput Surv. 1999;31(3):264\u2013323.","journal-title":"ACM Comput Surv"},{"issue":"2","key":"73_CR48","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S. Least squares quantization in PCM. IEEE Trans Inform Theory. 1982;28(2):129\u201337.","journal-title":"IEEE Trans Inform Theory"},{"key":"73_CR49","doi-asserted-by":"publisher","unstructured":"Zhang W, Wang X, Zhao D, Tang X. Graph degree linkage: agglomerative clustering on a directed graph. In: Fitzgibbon A, Lazebnik S, Perona P, Sato Y, Schmid C, editors. Computer Vision - ECCV 2012. Lecture Notes in Computer Science. 2012. p. 428\u201341.","DOI":"10.1007\/978-3-642-33718-5_31"},{"key":"73_CR50","doi-asserted-by":"publisher","unstructured":"Harel D, Koren Y. On clustering using random walks. In: Hariharan R, Vinay V, Mukund M, editors. FST TCS 2001: Foundations of software technology and theoretical computer science. Lecture notes in computer science. 2001. pp. 18\u201341.","DOI":"10.1007\/3-540-45294-X_3"},{"issue":"11","key":"73_CR51","doi-asserted-by":"publisher","first-page":"5820","DOI":"10.1109\/TSP.2012.2212886","volume":"60","author":"X Dong","year":"2012","unstructured":"Dong X, Frossard P, Vandergheynst P, Nefedov N. Clustering with multi-layer graphs: a spectral perspective. IEEE Trans Sign Process. 2012;60(11):5820\u201331.","journal-title":"IEEE Trans Sign Process"},{"issue":"1","key":"73_CR52","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-7152(96)00213-1","volume":"35","author":"MR Brito","year":"1997","unstructured":"Brito MR, Ch\u00e1vez EL, Quiroz AJ, Yukich JE. Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Stat Probab Lett. 1997;35(1):33\u201342.","journal-title":"Stat Probab Lett"},{"key":"73_CR53","unstructured":"Ozaki K, Shimbo M, Komachi M, Matsumoto Y. Using the mutual k-nearest neighbor graphs for semi-supervised classification of natural language data. In: Proceedings of the fifteenth conference on computational natural language learning. 2011. p. 154\u201362."},{"issue":"8","key":"73_CR54","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han E-H, Kumar V. Chameleon: hierarchical clustering using dynamic modeling. Computer. 1999;32(8):68\u201375.","journal-title":"Computer"},{"key":"73_CR55","unstructured":"6 functions for generating artificial datasets - File Exchange - MATLAB Central. http:\/\/se.mathworks.com\/matlabcentral\/fileexchange\/41459 . Accessed 23 Feb 2017."},{"issue":"8","key":"73_CR56","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell. 2000;22(8):888\u2013905.","journal-title":"IEEE Trans Pattern Anal Mach Intell."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-017-0073-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T08:50:16Z","timestamp":1692780616000},"score":1,"resource":{"primary":{"URL":"http:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-017-0073-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,26]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1186\/s40537-017-0073-8","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,26]]},"article-number":"11"}}