{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:42:53Z","timestamp":1742938973448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398469"},{"type":"electronic","value":"9783031398476"}],"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-39847-6_2","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Summarization for Knowledge Graphs with Controlled Utility Loss"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3060-9522","authenticated-orcid":false,"given":"Yi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00778-018-0528-3","volume":"28","author":"S \u010cebiri\u0107","year":"2019","unstructured":"\u010cebiri\u0107, S., et al.: Summarizing semantic graphs: a survey. VLDB J. 28, 295\u2013327 (2019). https:\/\/doi.org\/10.1007\/s00778-018-0528-3","journal-title":"VLDB J."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"100647","DOI":"10.1016\/j.websem.2021.100647","volume":"69","author":"Q Liu","year":"2021","unstructured":"Liu, Q., Cheng, G., Gunaratna, K., Qu, Y.: Entity summarization: state of the art and future challenges. J. Web Semant. 69, 100647 (2021)","journal-title":"J. Web Semant."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Lissandrini, M., Pedersen, T.B., Hose, K., Mottin, D.: Knowledge graph exploration: where are we and where are we going? Dl.Acm.Org. 1\u20138 (2020)","DOI":"10.1145\/3409481.3409485"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-20424-6_9","volume-title":"Data Science","author":"\u0160 \u010cebiri\u0107","year":"2015","unstructured":"\u010cebiri\u0107, \u0160, Goasdou\u00e9, F., Manolescu, I.: Query-oriented summarization of RDF graphs. In: Maneth, S. (ed.) BICOD 2015. LNCS, vol. 9147, pp. 87\u201391. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20424-6_9"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Stefanoni, G., Motik, B., Kostylev, E. V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: Proceedings of the World Wide Web Conference, WWW 2018, pp. 1043\u20131052 (2018)","DOI":"10.1145\/3178876.3186003"},{"key":"2_CR6","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: Proceedings of the World Wide Web Conference, WWW 2020, pp. 1115\u20131126 (2020)","DOI":"10.1145\/3366423.3380189"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Riondato, M., Garcia-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. In: Proceedings - IEEE International Conference on Data Mining, ICDM, pp. 947\u2013952 (2014)","DOI":"10.1109\/ICDM.2014.56"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez, L., Hogan, A.: Modelling dynamics in semantic web knowledge graphs with formal concept analysis. In: Proceedings of the World Wide Web Conference, WWW 2018, pp. 1175\u20131184 (2018)","DOI":"10.1145\/3178876.3186016"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hajiabadi, M., Singh, J., Srinivasan, V., Thomo, A.: Graph summarization with controlled utility loss. Association for Computing Machinery (2021)","DOI":"10.1145\/3447548.3467359"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Song, Q., Wu, Y., Dong, X.L.: Mining summaries for knowledge graph search. In: Proceedings of IEEE International Conference on Data Mining, ICDM, pp. 1215\u20131220 (2017)","DOI":"10.1109\/ICDM.2016.0162"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Safavi, T., Belth, C., Faber, L., Mottin, D., Muller, E., Koutra, D.: Personalized knowledge graph summarization: From the cloud to your pocket. In: Proceedings of IEEE International Conference on Data Mining, ICDM, pp. 528\u2013537 (2019)","DOI":"10.1109\/ICDM.2019.00063"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Pires, C.E., Sousa, P., Kedad, Z., Salgado, A.C.: Summarizing ontology-based schemas in PDMS. In: Proceedings of International Conference on Data Engineering, pp. 239\u2013244 (2010)","DOI":"10.1109\/ICDEW.2010.5452706"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.3233\/SW-170264","volume":"8","author":"G Troullinou","year":"2017","unstructured":"Troullinou, G., Kondylakis, H., Daskalaki, E., Plexousakis, D.: Ontology understanding without tears: the summarization approach. Semant. Web J. 8, 797\u2013815 (2017)","journal-title":"Semant. Web J."},{"key":"2_CR14","first-page":"236","volume":"4","author":"PO Queiroz-Sousa","year":"2013","unstructured":"Queiroz-Sousa, P.O., Salgado, A.C., Pires, C.E.: A method for building personalized ontology summaries. J. Inf. Data Manag. 4, 236\u2013250 (2013)","journal-title":"J. Inf. Data Manag."},{"key":"2_CR15","unstructured":"Presutti, V., Aroyo, L., Adamou, A., Schopman, B., Gangemi, A., Schreiber, G.: Extracting core knowledge from linked data. In: CEUR Workshop (2011)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010, pp. 454\u2013465 (2010)","DOI":"10.1137\/1.9781611972801.40"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-19545-2_17","volume-title":"formal concept analysis","author":"S\u00e9bastien Ferr\u00e9","year":"2015","unstructured":"Ferr\u00e9, S\u00e9bastien.: A proposal for extending formal concept analysis to knowledge graphs. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS (LNAI), vol. 9113, pp. 271\u2013286. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19545-2_17"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-01815-2_23","volume-title":"Formal Concept Analysis","author":"R Wille","year":"2009","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 314\u2013339. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01815-2_23"},{"key":"2_CR19","unstructured":"Alam, M., Napoli, A.: An approach towards classifying and navigating RDF data based on pattern structures. In: CEUR Workshop Proceedings, pp. 33\u201348 (2015)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-319-60438-1_67","volume-title":"Foundations of Intelligent Systems","author":"J Reynaud","year":"2017","unstructured":"Reynaud, J., Alam, M., Toussaint, Y., Napoli, A.: A proposal for classifying the content of the web of data based on FCA and pattern structures. In: Kryszkiewicz, M.,  et al. (eds.) ISMIS 2017. LNCS (LNAI), vol. 10352, pp. 684\u2013694. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60438-1_67"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32, 245\u2013251 (2010)","journal-title":"Soc. Netw."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Rehyani Hamedani, M., Kim, S.W.: AdaSim: a recursive similarity measure in graphs. In: International Conference on Information and Knowledge Management, Proceedings, pp. 1528\u20131537 (2021)","DOI":"10.1145\/3459637.3482316"},{"key":"2_CR23","first-page":"1","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. Semant. Web Inf. Syst. 5, 1\u201324 (2009)","journal-title":"Int. J. Semant. Web Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:25:49Z","timestamp":1710332749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_2","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":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","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":"49","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":"35","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":"32% - 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","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","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":"For the workshops 7 full and 3 short papers have been accepted from 20 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)"}}]}}