{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:22:17Z","timestamp":1771467737715,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10489-021-02684-w","type":"journal-article","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T14:07:03Z","timestamp":1627913223000},"page":"5034-5046","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Slither: finding local dense subgraphs measured by average degree"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8026-4035","authenticated-orcid":false,"given":"Zixuan","family":"Deng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9477-284X","authenticated-orcid":false,"given":"Yanping","family":"Xiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,2]]},"reference":[{"issue":"4","key":"2684_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824777.1824780","volume":"6","author":"R Andersen","year":"2010","unstructured":"Andersen R (2010) A local algorithm for finding dense subgraphs. ACM Trans Algorithm 6 (4):1\u201312","journal-title":"ACM Trans Algorithm"},{"issue":"1","key":"2684_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/080744888","volume":"42","author":"DA Spielman","year":"2013","unstructured":"Spielman DA, Teng S-H (2013) A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J Comput 42(1):1\u201326","journal-title":"SIAM J Comput"},{"key":"2684_CR3","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K (2006) Local Graph Partitioning using PageRank Vectors. In: 2006 47Th annual IEEE symposium on foundations of computer science","DOI":"10.1109\/FOCS.2006.44"},{"key":"2684_CR4","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Bonchi F, Gionis A, Gullo F, Tsiarli MA (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"key":"2684_CR5","doi-asserted-by":"crossref","unstructured":"Hooi B, Song HA, Beutel A, Shah N, Shin K, Faloutsos C (2016) FRAUDAR: Bounding Graph fraud in the face of camouflag. In: International conference on knowledge discovery and data mining, pp 895\u2013904","DOI":"10.1145\/2939672.2939747"},{"key":"2684_CR6","unstructured":"Kannan R, Vinay V (1999) Analyzing the structure of large graphs, Technical report"},{"key":"2684_CR7","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. Approximation algorithms for combinatorial optimization, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"key":"2684_CR8","doi-asserted-by":"crossref","unstructured":"Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: Latin american symposium on theoretical informatics, pp 598\u2013612","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"1","key":"2684_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno T (2010) An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56(1):3\u201316","journal-title":"Algorithmica"},{"key":"2684_CR10","doi-asserted-by":"crossref","unstructured":"Zhang S, Zhou D, Yildirim MY, Alcorn S, He J, Davulcu H, Tong H (2017) HiDDen: Hierarchical dense subgraph detection with application to financial fraud detection. In: Proceedings of the 17th SIAM International Conference on Data Mining, pp 570\u2013578","DOI":"10.1137\/1.9781611974973.64"},{"key":"2684_CR11","unstructured":"Goldberg AV (1984) Finding a Maximum Density Subgraph. Technical report, University of California, Berkeley"},{"issue":"1","key":"2684_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo G, Grigoriadis MD, Tarjan RE (1989) Fast parametric maximum flow algorithm and applications. SIAM J Comput 18(1):30\u201355","journal-title":"SIAM J Comput"},{"issue":"1","key":"2684_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within n1\u2212\ud835\udf16. Acta Math 182(1):105\u2013142","journal-title":"Acta Math"},{"issue":"2","key":"2684_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2004","unstructured":"Feige U (2004) Approximating maximum clique by removing subgraphs. SIAM J Discret Math 18(2):219\u2013225","journal-title":"SIAM J Discret Math"},{"key":"2684_CR15","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of tura\u0307n. Can J Math 17:533\u2013540","journal-title":"Can J Math"},{"issue":"9","key":"2684_CR16","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"3","key":"2684_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"issue":"1","key":"2684_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept. J Math Sociol 6(1):139\u2013154","journal-title":"J Math Sociol"},{"issue":"2","key":"2684_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce RD (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2):169\u2013190","journal-title":"Psychometrika"},{"issue":"2","key":"2684_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken RJ (1979) Cliques, clubs and clans. Qual Quant 13(2):161\u2013173","journal-title":"Qual Quant"},{"key":"2684_CR21","unstructured":"Cao Q, Sirivianos M, Yang X, Pregueiro T (2012) Aiding the detection of fake accounts in large scale social online services. In: Proceedings of NSDI 2012: 9th USENIX Symposium on Networked Systems Design and Implementation, pp 197\u2013 210"},{"key":"2684_CR22","doi-asserted-by":"crossref","unstructured":"Jia J, Wang B, Gong NZ (2017) Random walk based fake account detection in online social networks. In: 2017 47Th annual IEEE\/IFIP international conference on dependable systems and networks (DSN), pp 273\u2013284","DOI":"10.1109\/DSN.2017.55"},{"key":"2684_CR23","doi-asserted-by":"crossref","unstructured":"Fogaras D, Ra\u0307cz B (2004) Towards scaling fully personalized pagerank. In: International workshop on algorithms and models for the web-graph, pp 105\u2013117","DOI":"10.1007\/978-3-540-30216-2_9"},{"key":"2684_CR24","doi-asserted-by":"crossref","unstructured":"Lovasz L, Simonovits M (1990) The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume. In: 31St annual symposium on foundations of computer science, pp 346\u2013354","DOI":"10.1109\/FSCS.1990.89553"},{"key":"2684_CR25","doi-asserted-by":"crossref","unstructured":"Jindal N, Liu B (2008) Opinion spam and analysis. In: Proceedings of the 2008 international conference on web search and data mining, pp 219\u2013230","DOI":"10.1145\/1341531.1341560"},{"key":"2684_CR26","doi-asserted-by":"crossref","unstructured":"Grier C, Thomas K, Paxson V, Zhang M (2010) @Spam The Underground on 140 Characters or Less. In: Proceedings of the 17th ACM conference on Computer and communications security, pp 27\u201337","DOI":"10.1145\/1866307.1866311"},{"key":"2684_CR27","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","DOI":"10.1145\/2623330.2623632"},{"key":"2684_CR28","doi-asserted-by":"crossref","unstructured":"Yang C, Harkreader R, Zhang J, Shin S, Gu G (2012) Analyzing spammers\u2019 social networks for fun and profit: a case study of cyber criminal ecosystem on twitter. In: Proceedings of the 21st international conference on World Wide Web, pp 71\u201380","DOI":"10.1145\/2187836.2187847"},{"key":"2684_CR29","doi-asserted-by":"crossref","unstructured":"Prakash BA, Seshadri M, Sridharan A, Machiraju S, Faloutsos C (2010) Eigenspokes: Surprising Patterns and Community Structure in Large Graphs. In: Pacific-asia conference on knowledge discovery and data mining, pp 435\u2013448","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"2684_CR30","doi-asserted-by":"crossref","unstructured":"Shah N, Beutel A, Gallagher B, Faloutsos C (2014) Spotting suspicious link behavior with fbox: an adversarial perspective. In: 2014 IEEE International conference on data mining, pp 959\u2013964","DOI":"10.1109\/ICDM.2014.36"},{"key":"2684_CR31","doi-asserted-by":"crossref","unstructured":"Shin K, Hooi B, Faloutsos C (2016) M-zoom: Fast dense-block detection in tensors with quality guarantees. In: Joint european conference on machine learning and knowledge discovery in databases, pp 264\u2013280","DOI":"10.1007\/978-3-319-46128-1_17"},{"issue":"1","key":"2684_CR32","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.laa.2006.07.018","volume":"423","author":"F Chung","year":"2007","unstructured":"Chung F (2007) Random walks and local cuts in graphs. Linear Algebra Appl 423(1):22\u201332","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"2684_CR33","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala TH (2003) Topic-sensitive pagerank:A context-sensitive ranking algorithm for web search. IEEE Trans Knowl Data Eng 15(4):784\u2013796","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2684_CR34","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Allen C, Sarkar R (2021) Multi-scale Attributed Node Embedding. J Compl Netw 9:(2)","DOI":"10.1093\/comnet\/cnab014"},{"key":"2684_CR35","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"2684_CR36","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: 28Th ACM conference on human factors in computing systems, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"key":"2684_CR37","unstructured":"McAuley J, Leskovec J (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, vol 1, pp 539\u2013547"},{"key":"2684_CR38","doi-asserted-by":"crossref","unstructured":"McAuley J, Leskovec J (2013) Hidden factors and hidden topics: understanding rating dimensions with review text. In: Proceedings of the 7th ACM conference on Recommender systems, pp 165\u2013172","DOI":"10.1145\/2507157.2507163"},{"key":"2684_CR39","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: Extraction and mining of academic social networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 990\u2013998","DOI":"10.1145\/1401890.1402008"},{"key":"2684_CR40","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media?. In: Proceedings of the 19th international conference on World Wide Web, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02684-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02684-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02684-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T05:16:33Z","timestamp":1646457393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02684-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,2]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["2684"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02684-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,2]]},"assertion":[{"value":"12 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}