{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:39:13Z","timestamp":1768869553420,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030161446","type":"print"},{"value":"9783030161453","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16145-3_35","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:50:37Z","timestamp":1554346237000},"page":"449-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph Compression with Stars"],"prefix":"10.1007","author":[{"given":"Faming","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T Feder","year":"1995","unstructured":"Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci. 51(2), 261\u2013272 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: KDD, pp. 965\u2013973 (2011)","DOI":"10.1145\/2020408.2020566"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"35_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.I.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1\u20133), 325\u2013330 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR6","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM, vol. 4, pp. 442\u2013446 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.2307\/2532051","volume":"45","author":"L Li","year":"1989","unstructured":"Li, L.: A concordance correlation coefficient to evaluate reproducibility. Biometrics 45(1), 255\u2013268 (1989)","journal-title":"Biometrics"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD, pp. 567\u2013580 (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: ICDE, pp. 880\u2013891 (2010)","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Ruan, N., Jin, R., Huang, Y.: Distance preserving graph simplification. In: ICDM, pp. 1200\u20131205 (2011)","DOI":"10.1109\/ICDM.2011.57"},{"issue":"3","key":"35_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10618-013-0328-8","volume":"27","author":"F Bonchi","year":"2013","unstructured":"Bonchi, F., Morales, G.D.F., Gionis, A., Ukkonen, A.: Activity preserving graph simplification. Data Min. Knowl. Disc. 27(3), 321\u2013343 (2013)","journal-title":"Data Min. Knowl. Disc."},{"key":"35_CR14","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: OSDI, pp. 17\u201330 (2012)"},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TKDE.2014.2327037","volume":"27","author":"Y Shao","year":"2015","unstructured":"Shao, Y., Cui, B., Ma, L.: PAGE: a partition aware engine for parallel graph computation. IEEE Trans. Knowl. Data Eng. 27(2), 518\u2013530 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW, pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"},{"key":"35_CR17","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: DCC, pp. 203\u2013212 (2001)"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.3390\/a2031031","volume":"2","author":"A Apostolico","year":"2009","unstructured":"Apostolico, A., Drovandi, G.: Graph compression by BFS. Algorithms 2(3), 1031\u20131044 (2009)","journal-title":"Algorithms"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: SIGMOD, pp. 157\u2013168 (2012)","DOI":"10.1145\/2213836.2213855"}],"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-030-16145-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:06:31Z","timestamp":1710335191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16145-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030161446","9783030161453"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16145-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 March 2019","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":"Macau","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pakdd2019.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":"Microsoft Conf. Man. Toolkit CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"542","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":"137","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":"25% - 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.79","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":"5.85","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)"}},{"value":"In addition, there were 31 PAKDD 2019 Workshops' papers accepted for publication","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)"}}]}}