{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T01:00:43Z","timestamp":1780189243520,"version":"3.54.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030773847","type":"print"},{"value":"9783030773854","type":"electronic"}],"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-77385-4_15","type":"book-chapter","created":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T19:02:53Z","timestamp":1622401373000},"page":"249-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Refining Transitive and Pseudo-Transitive Relations at Web Scale"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1261-9930","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7891-7738","authenticated-orcid":false,"given":"Joe","family":"Raad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0189-5817","authenticated-orcid":false,"given":"Peter","family":"Bloem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7913-0048","authenticated-orcid":false,"given":"Frank","family":"van Harmelen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,31]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-11964-9_14","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"W Beek","year":"2014","unstructured":"Beek, W., Rietveld, L., Bazoobandi, H.R., Wielemaker, J., Schlobach, S.: LOD laundromat: a uniform way of publishing other people\u2019s dirty data. In: Mika, P. (ed.) ISWC 2014. LNCS, vol. 8796, pp. 213\u2013228. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_14"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-25318-8_3","volume-title":"Programming Languages and Systems","author":"N Bj\u00f8rner","year":"2011","unstructured":"Bj\u00f8rner, N.: Engineering theories with Z3. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 4\u201316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25318-8_3"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bonatti, P.A., Hogan, A., Polleres, A., Sauro, L.: Robust and scalable linked data reasoning incorporating provenance and trust annotations. J. Web Semant. 9(2), 165\u2013201 (2011). ISSN 1570-8268. Provenance in the Semantic Web","DOI":"10.1016\/j.websem.2011.06.003"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-68204-4_7","volume-title":"The Semantic Web \u2013 ISWC 2017","author":"JD Fern\u00e1ndez","year":"2017","unstructured":"Fern\u00e1ndez, J.D., Beek, W., Mart\u00ednez-Prieto, M.A., Arias, M.: LOD-a-lot. In: d\u2019Amato, C. (ed.) ISWC 2017. LNCS, vol. 10588, pp. 75\u201383. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68204-4_7"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Fossati, M., Kontokostas, D., Lehmann, J.: Unsupervised learning of an extensive and usable taxonomy for dbpedia. In: International Conference on Semantic Systems, pp. 177\u2013184 (2015)","DOI":"10.1145\/2814864.2814881"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Harth, A., Kinsella, S., Decker, S.: Using naming authority to rank data and ontologies for web search. In: ISWC (2009)","DOI":"10.1007\/978-3-642-04930-9_18"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Heist, N., Paulheim, H.: Entity extraction from wikipedia list pages. In: ESWC, pp. 327\u2013342 (2020)","DOI":"10.1007\/978-3-030-49461-2_19"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Hertling, S., Paulheim, H.: WebIsALOD: providing hypernymy relations extracted from the web as linked open data. In: ISWC, pp. 111\u2013119 (2017)","DOI":"10.1007\/978-3-319-68204-4_11"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hsu, D., Lan, X., Miller, G., Baird, D.: A comparative study of algorithm for computing strongly connected components. In: 15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), pp. 431\u2013437 (2017)","DOI":"10.1109\/DASC-PICom-DataCom-CyberSciTec.2017.85"},{"key":"15_CR10","unstructured":"Miles, A., Bechhofer, S.: SKOS simple knowledge organization system reference. W3C recommendation (2009)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Mones, E., Vicsek, L., Vicsek, T.: Hierarchy measure for complex networks. PLOS ONE 7(3), (2012)","DOI":"10.1371\/journal.pone.0033799"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"\u00d6nc\u00fc, H., Agi, M.A.N., Gu\u00e9rin, J.: A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis. Comput. Oper. Res. 115, 104857 (2020)","DOI":"10.1016\/j.cor.2019.104857"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.3233\/SW-160218","volume":"8","author":"H Paulheim","year":"2017","unstructured":"Paulheim, H.: Knowledge graph refinement: a survey of approaches and evaluation methods. Semant. web 8(3), 489\u2013508 (2017)","journal-title":"Semant. web"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Paulheim, H., Bizer, C.: Improving the quality of linked data using statistical distributions. Int. J. Semant. Web Inf. Syst. (IJSWIS) 10(2), 63\u201386 (2014)","DOI":"10.4018\/ijswis.2014040104"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1162\/dint_a_00057","volume":"2","author":"J Raad","year":"2020","unstructured":"Raad, J., Beek, W., van Harmelen, F., Wielemaker, J., Pernelle, N., Sa\u00efs, F.: Constructing and cleaning identity graphs in the LOD cloud. Data Intell. 2(3), 323\u2013352 (2020)","journal-title":"Data Intell."},{"issue":"3","key":"15_CR16","first-page":"133","volume":"10","author":"M Simpson","year":"2016","unstructured":"Simpson, M., Srinivasan, V., Thomo, A.: Efficient computation of feedback arc set at web-scale. VLDB 10(3), 133\u2013144 (2016)","journal-title":"VLDB"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Sun, J., Ajwani, D., Nicholson, P.K., Sala, A., Parthasarathy, S.: Breaking cycles in noisy hierarchies. In: Proceedings of the 2017 ACM on Web Science Conference, pp. 151\u2013160 (2017)","DOI":"10.1145\/3091478.3091495"},{"key":"15_CR18","unstructured":"Wang, S., Bloem, P., Raad, J., van Harmelen, F.: SUBMASSIVE: Resolving subclass cycles in very large knowledge graphs. In: Workshop on Large Scale RDF Analytics (2020)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77385-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T00:04:07Z","timestamp":1780185847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77385-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030773847","9783030773854"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77385-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esws2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.eswc-conferences.org\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"41","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":"2","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":"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":"2","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}