{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:06:54Z","timestamp":1743134814273,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030676636"},{"type":"electronic","value":"9783030676643"}],"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-67664-3_2","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T07:06:46Z","timestamp":1614150406000},"page":"20-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Dense Subgraphs with Similar Edges"],"prefix":"10.1007","author":[{"given":"Polina","family":"Rozenshtein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Preti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Velegrakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00778-013-0340-z","volume":"23","author":"A Angel","year":"2013","unstructured":"Angel, A., Koudas, N., Sarkas, N., Srivastava, D., Svendsen, M., Tirthapura, S.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 23, 175\u2013199 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0340-z","journal-title":"VLDB J."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Balalau, O.D., Bonchi, F., Chan, T., Gullo, F., Sozio, M.: Finding subgraphs with maximum total density and limited overlap. In: WSDM, pp. 379\u2013388 (2015)","DOI":"10.1145\/2684822.2685298"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/978-3-540-30182-0_78","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"R Ba\u00f1os","year":"2004","unstructured":"Ba\u00f1os, R., Gil, C., Montoya, M.G., Ortega, J.: A new pareto-based algorithm for multi-objective graph partitioning. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 779\u2013788. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30182-0_78"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$O(n^{1\/4})$$ approximation for densest $$k$$-subgraph. In: STOC, pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Boden, B., G\u00fcnnemann, S., Hoffmann, H., Seidl, T.: Mining coherent subgraphs in multi-layer graphs with edge labels. In: SIGKDD, pp. 1258\u20131266 (2012)","DOI":"10.1145\/2339530.2339726"},{"key":"2_CR6","unstructured":"Carranza, A.G., Rossi, R.A., Rao, A., Koh, E.: Higher-order spectral clustering for heterogeneous graphs. arXiv preprint arXiv:1810.02959 (2018)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chan, H., Han, S., Akoglu, L.: Where graph topology matters: the robust subgraph problem. In: SIAM, pp. 10\u201318 (2015)","DOI":"10.1137\/1.9781611974010.2"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/opre.1080.0572","volume":"57","author":"BG Chandran","year":"2009","unstructured":"Chandran, B.G., Hochbaum, D.S.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Oper. Res. 57, 358\u2013376 (2009)","journal-title":"Oper. Res."},{"key":"2_CR9","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":"2_CR10","first-page":"1216","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. TKDE 24, 1216\u20131230 (2012)","journal-title":"TKDE"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-24465-5_16","volume-title":"Advances in Intelligent Data Analysis XIV","author":"D Combe","year":"2015","unstructured":"Combe, D., Largeron, C., G\u00e9ry, M., Egyed-Zsigmond, E.: I-louvain: an attributed graph clustering method. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds.) IDA 2015. LNCS, vol. 9385, pp. 181\u2013192. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24465-5_16"},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Falih, I., Grozavu, N., Kanawati, R., Bennani, Y.: Community detection in attributed network. In: Companion Proceedings of WWW. pp. 1299\u20131306 (2018)","DOI":"10.1145\/3184558.3191570"},{"issue":"12","key":"2_CR14","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. VLDB 9(12), 1233\u20131244 (2016)","journal-title":"VLDB"},{"key":"2_CR15","first-page":"30","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. J. Comp. 18, 30\u201355 (1989)","journal-title":"J. Comp."},{"key":"2_CR16","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. University of California Berkeley, CA (1984)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"56","author":"DS Hochbaum","year":"2008","unstructured":"Hochbaum, D.S.: The pseudoflow algorithm: a new algorithm for the maximum-flow problem. Oper. Res. 56, 992\u20131009 (2008)","journal-title":"Oper. Res."},{"key":"2_CR18","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":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On Finding dense Subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, P.I., et al.: Efficient algorithms for a robust modularity-driven clustering of attributed graphs. In: SIAM, pp. 100\u2013108 (2015)","DOI":"10.1137\/1.9781611974010.12"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10115-011-0452-y","volume":"34","author":"P Shelokar","year":"2013","unstructured":"Shelokar, P., Quirin, A., Cord\u00f3n, O.: Mosubdue: a pareto dominance-based multiobjective subdue algorithm for frequent subgraph mining. KAIS 34, 75\u2013108 (2013). https:\/\/doi.org\/10.1007\/s10115-011-0452-y","journal-title":"KAIS"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The $$k$$-clique densest subgraph problem. In: WWW (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: SIGKDD, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-31235-9_14","volume-title":"Scientific and Statistical Database Management","author":"E Valari","year":"2012","unstructured":"Valari, E., Kontaki, M., Papadopoulos, A.N.: Discovery of top-k dense subgraphs in dynamic graph collections. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 213\u2013230. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31235-9_14"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhu, X., Zhang, X.: Finding dense and connected subgraphs in dual networks. In: ICDE, pp. 915\u2013926 (2015)","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Yikun, B., Xin, L., Ling, H., Yitao, D., Xue, L., Wei, X.: No place to hide: catching fraudulent entities in tensors. In: The World Wide Web Conference (2019)","DOI":"10.1145\/3308558.3313403"}],"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-67664-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:03:44Z","timestamp":1740351824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67664-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676636","9783030676643"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67664-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}