{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:07:38Z","timestamp":1742976458868,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031059322"},{"type":"electronic","value":"9783031059339"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05933-9_5","type":"book-chapter","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T13:04:50Z","timestamp":1652101490000},"page":"54-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Are Edge Weights in Summary Graphs Useful? - A Comparative Study"],"prefix":"10.1007","author":[{"given":"Shinhwan","family":"Kang","sequence":"first","affiliation":[]},{"given":"Kyuhan","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,10]]},"reference":[{"key":"5_CR1","unstructured":"Online appendix, source code and datasets (2022). https:\/\/github.com\/ShinhwanKang\/PAKDD22-ComparativeStudy"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-93040-4_40","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"MA Beg","year":"2018","unstructured":"Beg, M.A., Ahmad, M., Zaman, A., Khan, I.: Scalable approximation algorithm for graph summarization. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 502\u2013514. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_40"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Belth, C., Zheng, X., Vreeken, J., Koutra, D.: What is normal, what is strange, and what is missing in a knowledge graph: unified characterization via inductive summarization. In: WWW (2020)","DOI":"10.1145\/3366423.3380189"},{"key":"5_CR4","unstructured":"Besta, M., Hoefler, T.: Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799 (2018)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW (2004)","DOI":"10.1145\/988672.988752"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Davis, M., Liu, W., Miller, P., Redpath, G.: Detecting anomalies in graphs with numeric labels. In: CIKM (2011)","DOI":"10.1145\/2063576.2063749"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., Shalita, A.: Compressing graphs and indexes with recursive graph bisection. In: KDD (2016)","DOI":"10.1145\/2939672.2939862"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: CHI (2013)","DOI":"10.1145\/2470654.2466444"},{"issue":"12","key":"5_CR11","first-page":"2596","volume":"19","author":"T Dwyer","year":"2013","unstructured":"Dwyer, T., Riche, N.H., Marriott, K., Mears, C.: Edge compression techniques for visualization of dense directed graphs. TVCG 19(12), 2596\u20132605 (2013)","journal-title":"TVCG"},{"key":"5_CR12","unstructured":"Fahrbach, M., Goranci, G., Peng, R., Sachdeva, S., Wang, C.: Faster graph embeddings via coarsening. In: ICML (2020)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kang, S., Lee, K., Shin, K.: Personalized graph summarization: formulation, scalable algorithms, and applications. In: ICDE (2022)","DOI":"10.1109\/ICDE53745.2022.00219"},{"issue":"12","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"KU Khan","year":"2015","unstructured":"Khan, K.U., Nawaz, W., Lee, Y.-K.: Set-based approximate approach for lossless graph summarization. Computing 97(12), 1185\u20131207 (2015). https:\/\/doi.org\/10.1007\/s00607-015-0454-9","journal-title":"Computing"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ko, J., Kook, Y., Shin, K.: Incremental lossless graph summarization. In: KDD (2020)","DOI":"10.1145\/3394486.3403074"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VOG: summarizing and understanding large graphs. In: SDM (2014)","DOI":"10.1137\/1.9781611973440.11"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Lee, K., Jo, H., Ko, J., Lim, S., Shin, K.: SSumM: sparse summarization of massive graphs. In: KDD (2020)","DOI":"10.1145\/3394486.3403057"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: Grass: graph structure summarization. In: SDM (2010)","DOI":"10.1137\/1.9781611972801.40"},{"issue":"12","key":"5_CR19","first-page":"3077","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim, Y., Kang, U., Faloutsos, C.: SlashBurn: graph compression and mining beyond caveman communities. TKDE 26(12), 3077\u20133089 (2014)","journal-title":"TKDE"},{"issue":"3","key":"5_CR20","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. CSUR 51(3), 1\u201334 (2018)","journal-title":"CSUR"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: KDD (2011)","DOI":"10.1145\/2020408.2020492"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-40991-2_4","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Y Mehmood","year":"2013","unstructured":"Mehmood, Y., Barbieri, N., Bonchi, F., Ukkonen, A.: CSI: community-level social influence analysis. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8189, pp. 48\u201363. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40991-2_4"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"5_CR24","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"issue":"2","key":"5_CR25","first-page":"314","volume":"31","author":"M Riondato","year":"2017","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. DMKD 31(2), 314\u2013349 (2017)","journal-title":"DMKD"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-018-0121-z","volume":"5","author":"RA Rossi","year":"2018","unstructured":"Rossi, R.A., Zhou, R.: GraphZIP: a clique-based sparse graph compression method. J. Big Data 5(1), 1\u201314 (2018)","journal-title":"J. Big Data"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: TimeCrunch: interpretable dynamic graph summarization. In: KDD (2015)","DOI":"10.1145\/2783258.2783321"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Shin, K., Ghoting, A., Kim, M., Raghavan, H.: SWeG: lossless and lossy summarization of web-scale graphs. In: WWW (2019)","DOI":"10.1145\/3308558.3313402"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Shoaran, M., Thomo, A., Weber-Jahnke, J.H.: Zero-knowledge private graph summarization. In: Big Data (2013)","DOI":"10.1109\/BigData.2013.6691628"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10723-018-9435-5","volume":"16","author":"P Sui","year":"2018","unstructured":"Sui, P., Yang, X.: A privacy-preserving compression storage method for large trajectory data in road network. J. Grid Comput. 16(2), 229\u2013245 (2018)","journal-title":"J. Grid Comput."},{"issue":"3","key":"5_CR31","first-page":"327","volume":"14","author":"H Tong","year":"2008","unstructured":"Tong, H., Faloutsos, C., Pan, J.Y.: Random walk with restart: fast solutions and applications. KAIS 14(3), 327\u2013346 (2008)","journal-title":"KAIS"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, H., Liu, S., Lee, K., Shin, K., Shen, H., Cheng, X.: DPGS: degree-preserving graph summarization. In: SDM (2021)","DOI":"10.1137\/1.9781611976700.32"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05933-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T18:49:56Z","timestamp":1675536596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05933-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031059322","9783031059339"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05933-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"16 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd.net\/index.html","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":"558","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":"121","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.75","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":"6.45","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}