{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:06:05Z","timestamp":1742943965970,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031263897"},{"type":"electronic","value":"9783031263903"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26390-3_4","type":"book-chapter","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T09:04:46Z","timestamp":1678957486000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Summarizing Labeled Multi-graphs"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Berberidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre J.","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leman","family":"Akoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36\u201343 (2005)","DOI":"10.1145\/1134271.1134277"},{"key":"4_CR2","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Data Compression Conference IEEE Computer Society (2001)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Akoglu, L.: Quantifying political polarity based on bipartite opinion networks. In: ICWSM (2014)","DOI":"10.1609\/icwsm.v8i1.14524"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, pp. 117\u2013122 (2008)","DOI":"10.1145\/1327452.1327494"},{"key":"4_CR5","unstructured":"Besta, M., Hoefler, T.: Survey and taxonomy of lossless graph compression and space-efficient graph representations (2018). arxiv:1806.01799"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: WWW, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM, pp. 95\u2013106. ACM (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"4_CR8","unstructured":"Chong, E.K., Zak, S.H.: An introduction to optimization. John Wiley & Sons (2004)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1993","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231\u2013255 (1993)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: SIGCHI, pp. 3247\u20133256 (2013)","DOI":"10.1145\/2470654.2466444"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Giles, C.L., Bollacker, K.D., Lawrence, S.: CiteSeer: an automatic citation indexing system. In: Proceedings of the Conference on Digital Libraries, pp. 89\u201398 (1998)","DOI":"10.1145\/276675.276685"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P.D.: The Minimum Description Length Principle. The MIT Press, Cambridge, MA (2007)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond \u2018caveman communities\u2019: hubs and spokes for graph compression and mining. In: ICDM, pp. 300\u2013309 (2011)","DOI":"10.1109\/ICDM.2011.26"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Khan, K.U., Nawaz, W., Lee, Y.K.: Set-based approximate approach for lossless graph summarization. Computing 97(12) (2015)","DOI":"10.1007\/s00607-015-0454-9"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/sam.11267","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: Summarizing and understanding large graphs. Statist. Anal. Data Min. 8(3), 183\u2013202 (2015)","journal-title":"Statist. Anal. Data Min."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: Grass: graph structure summarization. In: SDM, pp. 454\u2013465. SIAM (2010)","DOI":"10.1137\/1.9781611972801.40"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Liakos, P., Papakonstantinopoulou, K., Sioutis, M.: Pushing the envelope in graph compression. In: CIKM, pp. 1549\u20131558 (2014)","DOI":"10.1145\/2661829.2662053"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. 51(3), 1\u201334 (2018)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"4_CR19","first-page":"32","volume":"7","author":"Z Liu","year":"2012","unstructured":"Liu, Z., Yu, J.X., Cheng, H.: Approximate homogeneous graph summarization. Info. Media Tech. 7(1), 32\u201343 (2012)","journal-title":"Info. Media Tech."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD, pp. 419\u2013432. ACM (2008)","DOI":"10.1145\/1376616.1376661"},{"issue":"D1","key":"4_CR21","first-page":"D529","volume":"47","author":"R Oughtred","year":"2019","unstructured":"Oughtred, R., et al.: The biogrid interaction database 47(D1), D529\u2013D541 (2019)","journal-title":"The biogrid interaction database"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W.K., Choudhary, A.: Fast algorithms for the maximum clique problem on massive sparse graphs. In: International Workshop. AMWG (2013)","DOI":"10.1007\/978-3-319-03536-9_13"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s10618-016-0468-8","volume":"31","author":"M Riondato","year":"2017","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. Data Min. Knowl. Disc. 31(2), 314\u2013349 (2017)","journal-title":"Data Min. Knowl. Disc."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Shin, K., Ghoting, A., Kim, M., Raghavan, H.: SWeG: lossless and lossy summarization of web-scale graphs. In: WWW, pp. 1679\u20131690. ACM (2019)","DOI":"10.1145\/3308558.3313402"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R., Patel, J.: Efficient aggregation for graph summarization. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: KDD (2011)","DOI":"10.1145\/2020408.2020566"},{"key":"4_CR27","unstructured":"Ying, Z., You, J., Morris, C., Ren, X., Hamilton, W., Leskovec, J.: Hierarchical graph representation learning with differentiable pooling. In: NeurIPS, pp. 4800\u20134810 (2018)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Zhu, L., Ghasemi-Gol, M., Szekely, P., Galstyan, A., Knoblock, C.A.: Unsupervised entity resolution on multi-type graphs. In: International Semantic Web Conference, pp. 649\u2013667 (2016)","DOI":"10.1007\/978-3-319-46523-4_39"}],"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-031-26390-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T07:03:18Z","timestamp":1697180598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26390-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031263897","9783031263903"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26390-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","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":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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":"3-4","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":"3-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":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}