{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:48:58Z","timestamp":1778860138757,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030676575","type":"print"},{"value":"9783030676582","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67658-2_11","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T12:03:33Z","timestamp":1614168213000},"page":"181-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["SpecGreedy: Unified Dense Subgraph Detection"],"prefix":"10.1007","author":[{"given":"Wenjie","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huawei","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"issue":"3","key":"11_CR1","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 Min. Knowl. Discov. 29(3), 626\u2013688 (2015). https:\/\/doi.org\/10.1007\/s10618-014-0365-y","journal-title":"Data Min. Knowl. Discov."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2009","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25\u201337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95995-3_3"},{"issue":"11","key":"11_CR3","first-page":"1501","volume":"13","author":"R Andersen","year":"2007","unstructured":"Andersen, R., Cioaba, S.M.: Spectral densest subgraph and independence number of a graph. J. UCS 13(11), 1501\u20131513 (2007)","journal-title":"J. UCS"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Boob, D., et al.: Flowless: Extracting densest subgraphs without flow computations. In: WWW 2020 (2020)","DOI":"10.1145\/3366423.3380140"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"11_CR8","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. In: IEEE TKDE (2010)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chu, L., Wang, Z., Pei, J., Wang, J., Zhao, Z., Chen, E.: Finding gangs in war from signed networks. In: KDD, pp. 1505\u20131514. ACM (2016)","DOI":"10.1145\/2939672.2939855"},{"key":"11_CR10","unstructured":"Fan, R.K.C.: Spectral graph theory. American Mathematical Society (1996)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4236\/apm.2013.39A2002","volume":"3","author":"A Dax","year":"2013","unstructured":"Dax, A.: From eigenvalues to singular values: a review. APM 3, 17 (2013)","journal-title":"APM"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Eikmeier, N., Gleich, D.F.: Revisiting power-law distributions in spectra of real world networks. In: KDD, pp. 817\u2013826 (2017)","DOI":"10.1145\/3097983.3098128"},{"key":"11_CR13","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. UCB (1984)"},{"key":"11_CR14","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU Press, Baltimore (2012)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: FRAUDAR: bounding graph fraud in the face of camouflage. In: SIGKDD, pp. 895\u2013904 (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 303\u2013336. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_10","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"11_CR17","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. JMLR 11, 985\u20131042 (2010)","journal-title":"JMLR"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"019901","DOI":"10.1103\/PhysRevE.91.019901","volume":"91","author":"Z Li","year":"2015","unstructured":"Li, Z., Zhang, S., Wang, R.-S., Zhang, X.-S., Chen, L.: Erratum: quantitative function for community detection. Phys. Rev. E 91(1), 019901 (2015)","journal-title":"Phys. Rev. E"},{"issue":"12","key":"11_CR19","first-page":"2235","volume":"31","author":"S Liu","year":"2018","unstructured":"Liu, S., Hooi, B., Faloutsos, C.: A contrast metric for fraud detection in rich graphs. TKDE 31(12), 2235\u20132248 (2018)","journal-title":"TKDE"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhu, L., Szekely, P.A., Galstyan, A., Koutra, D.: Coupled clustering of time-series and networks. In: SDM, pp. 531\u2013539. SIAM (2019)","DOI":"10.1137\/1.9781611975673.60"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Miyauchi, A., Kakimura, N.: Finding a dense subgraph with sparse cut. In: CIKM (2018)","DOI":"10.1145\/3269206.3271720"},{"key":"11_CR22","unstructured":"Papailiopoulos, D., Mitliagkas, I., Dimakis, A., Caramanis, C.: Finding dense subgraphs via low-rank bilinear optimization. In: ICML, pp. 1890\u20131898 (2014)"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","volume":"29","author":"M Pavan","year":"2006","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 167\u2013172 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-13672-6_42","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"BA Prakash","year":"2010","unstructured":"Prakash, B.A., Sridharan, A., Seshadri, M., Machiraju, S., Faloutsos, C.: EigenSpokes: surprising patterns and scalable community chipping in large graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS (LNAI), vol. 6119, pp. 435\u2013448. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13672-6_42"},{"issue":"10","key":"11_CR25","doi-asserted-by":"publisher","first-page":"P10020","DOI":"10.1088\/1742-5468\/2010\/10\/P10020","volume":"2010","author":"H-W Shen","year":"2010","unstructured":"Shen, H.-W., Cheng, X.-Q.: Spectral methods for the detection of network community structure: a comparative analysis. JSTAT 2010(10), P10020 (2010)","journal-title":"JSTAT"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM, pp. 608\u2013617. IEEE (2008)","DOI":"10.1109\/ICDM.2008.72"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-030-46150-8_23","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"CE Tsourakakis","year":"2020","unstructured":"Tsourakakis, C.E., Chen, T., Kakimura, N., Pachocki, J.: Novel dense subgraph discovery primitives: risk aversion and exclusion queries. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds.) ECML PKDD 2019. LNCS (LNAI), vol. 11906, pp. 378\u2013394. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46150-8_23"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1162\/dint_a_00006","volume":"1","author":"H Wan","year":"2019","unstructured":"Wan, H., Zhang, Y., Zhang, J., Tang, J.: AMiner: search and mining of academic social networks. Data Intell. 1(1), 58\u201376 (2019)","journal-title":"Data Intell."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Wang, Z., Chu, L., Pei, J., Al-Barakati, A., Chen, E.: Tradeoffs between density and size in extracting dense subgraphs: a unified framework. In: ASONAM (2016)","DOI":"10.1109\/ASONAM.2016.7752211"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Wong, S.W., Pastrello, C., Kotlyar, M., Faloutsos, C., Jurisica, I.: SDREGION: fast spotting of changing communities in biological networks. In: SIGKDD (2018)","DOI":"10.1145\/3219819.3219854"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Yang, Y., Chu, L., Zhang, Y., Wang, Z., Pei, J., Chen, E.: Mining density contrast subgraphs. In: ICDE, pp. 221\u2013232. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00029"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: KDD, pp. 555\u2013564 (2017)","DOI":"10.1145\/3097983.3098069"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67658-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:08:45Z","timestamp":1740352125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67658-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676575","9783030676582"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67658-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}