{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:17:39Z","timestamp":1780085859523,"version":"3.54.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031472398","type":"print"},{"value":"9783031472404","type":"electronic"}],"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-47240-4_32","type":"book-chapter","created":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T08:02:40Z","timestamp":1698825760000},"page":"599-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["FeaBI: A Feature Selection-Based Framework for\u00a0Interpreting KG Embeddings"],"prefix":"10.1007","author":[{"given":"Youmna","family":"Ismaeil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daria","family":"Stepanova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trung-Kien","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: ISWC\/ASWC, pp. 722\u2013735 (2007)","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"32_CR2","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Patel-Schneider, P., Nardi, D., et al.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Betz, P., Meilicke, C., Stuckenschmidt, H.: Adversarial explanations for knowledge graph embeddings. In: Raedt, L.D. (ed.) IJCAI 2022, pp. 2820\u20132826 (2022)","DOI":"10.24963\/ijcai.2022\/391"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Bhatt, U., Xiang, A., Shubham Sharma, t.: Explainable machine learning in deployment. In: FAT* 2020, pp. 648\u2013657 (2020)","DOI":"10.1145\/3351095.3375624"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: SIGMOD 2008, pp. 1247\u20131250 (2008)","DOI":"10.1145\/1376616.1376746"},{"key":"32_CR6","unstructured":"Bordes, A., Usunier, N., Garc\u00eda-Dur\u00e1n, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NeurIPs, pp. 2787\u20132795 (2013)"},{"key":"32_CR7","unstructured":"Chandrahas, Sengupta, T., Pragadeesh, C., Talukdar, P.P.: Inducing interpretability in knowledge graph embeddings. In: Bhattacharyya, P., Sharma, D.M., Sangal, R. (eds.) ICON 2020, pp. 70\u201375 (2020)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, W., Kasneci, G., Graepel, T., Stern, D.H., Herbrich, R.: Automated feature generation from structured knowledge. In: CIKM, 2011, pp. 1395\u20131404 (2011)","DOI":"10.1145\/2063576.2063779"},{"key":"32_CR9","unstructured":"Costabello, L., et al.: On explainable AI: from theory to motivation, applications and limitations. In: A Tutorial at AAAI 2019 (2019)"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga, L.: Effects of locality and rule language on explanations for knowledge graph embeddings. CoRR abs\/2302.06967 (2023)","DOI":"10.1007\/978-3-031-30047-9_12"},{"key":"32_CR12","unstructured":"Galkin, M., Denis, E.G., Wu, J., Hamilton, W.L.: NodePiece: compositional and parameter-efficient representations of large knowledge graphs. In: ICLR 2022 (2022)"},{"key":"32_CR13","unstructured":"Gusm\u00e3o, A.C., Correia, A.H.C., Bona, G.D., Cozman, F.G.: Interpreting embedding models of knowledge bases: a pedagogical approach. CoRR abs\/1806.09504 (2018)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Halliwell, N., Gandon, F., L\u00e9cu\u00e9, F.: User scored evaluation of non-unique explanations for relational graph convolutional network link prediction on knowledge graphs. In: K-CAP, pp. 57\u201364 (2021)","DOI":"10.1145\/3486622.3493921"},{"key":"32_CR15","unstructured":"Haykin, S.: Neural Networks: A Comprehensive Foundation (1994)"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-00671-6_5","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"VT Ho","year":"2018","unstructured":"Ho, V.T., Stepanova, D., Gad-Elrab, M.H., Kharlamov, E., Weikum, G.: Rule Learning from Knowledge Graphs Guided by Embedding Models. In: Vrande\u010di\u0107, D., Bontcheva, K., Su\u00e1rez-Figueroa, M.C., Presutti, V., Celino, I., Sabou, M., Kaffee, L.-A., Simperl, E. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 72\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00671-6_5"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Jain, N., Kalo, J.C., Balke, W.T., Krestel, R.: Do embeddings actually capture knowledge graph semantics? In: ESWC (2021)","DOI":"10.1007\/978-3-030-77385-4_9"},{"key":"32_CR18","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR 2017 (2017)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Krogel, M., Rawles, S.A., Zelezn\u00fd, F., Flach, P.A., Lavrac, N., Wrobel, S.: In: ILP 2003, vol. 2835, pp. 197\u2013214 (2003)","DOI":"10.1007\/978-3-540-39917-9_14"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-49461-2_3","volume-title":"The Semantic Web","author":"J Lajus","year":"2020","unstructured":"Lajus, J., Gal\u00e1rraga, L., Suchanek, F.: Fast and exact rule mining with AMIE 3. In: Harth, A., et al. (eds.) ESWC 2020. LNCS, vol. 12123, pp. 36\u201352. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49461-2_3"},{"issue":"7","key":"32_CR21","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1007\/s10994-020-05890-8","volume":"109","author":"N Lavra\u010d","year":"2020","unstructured":"Lavra\u010d, N., \u0160krlj, B., Robnik-\u0160ikonja, M.: Propositionalization and embeddings: two sides of the same coin. Mach. Learn. 109(7), 1465\u20131507 (2020)","journal-title":"Mach. Learn."},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1007\/s10699-020-09649-1","volume":"26","author":"I Lawler","year":"2021","unstructured":"Lawler, I., Sullivan, E.: Model explanation versus model-induced explanation. Found. Sci. 26, 1049\u20131074 (2021)","journal-title":"Found. Sci."},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Meilicke, C., Chekol, M.W., Ruffinelli, D., Stuckenschmidt, H.: Anytime bottom-up rule learning for knowledge graph completion. In: IJCAI 2019, pp. 3137\u20133143 (2019)","DOI":"10.24963\/ijcai.2019\/435"},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"212568","DOI":"10.1109\/ACCESS.2020.3039541","volume":"8","author":"S Me\u017enar","year":"2020","unstructured":"Me\u017enar, S., Lavra\u010d, N., \u0160krlj, B.: Snore: scalable unsupervised learning of symbolic node representations. IEEE Access 8, 212568\u2013212588 (2020)","journal-title":"IEEE Access"},{"key":"32_CR25","unstructured":"Nandwani, Y., Gupta, A., Agrawal, A., Chauhan, M.S., Singla, P., Mausam: OXKBC: outcome explanation for factorization based knowledge base completion. In: AKBC 2020 (2020)"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.Q.: A novel embedding model for knowledge base completion based on convolutional neural network. In: NAACL (2018)","DOI":"10.18653\/v1\/N18-2053"},{"key":"32_CR27","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-030-49461-2_33","volume-title":"The Semantic Web","author":"MA Pellegrino","year":"2020","unstructured":"Pellegrino, M.A., Altabba, A., Garofalo, M., Ristoski, P., Cochez, M.: GEval: a modular and extensible evaluation framework for graph embedding techniques. In: Harth, A., et al. (eds.) ESWC 2020. LNCS, vol. 12123, pp. 565\u2013582. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49461-2_33"},{"issue":"3","key":"32_CR29","doi-asserted-by":"publisher","first-page":"399","DOI":"10.3233\/SW-212892","volume":"13","author":"J Portisch","year":"2022","unstructured":"Portisch, J., Heist, N., Paulheim, H.: Knowledge graph embedding for data mining vs. knowledge graph embedding for link prediction - two sides of the same coin? Semant. Web 13(3), 399\u2013422 (2022)","journal-title":"Semant. Web"},{"key":"32_CR30","unstructured":"Ristoski, P., Paulheim, H.: A comparison of propositionalization strategies for creating features from linked open data. In: Tiddi, I., d\u2019Aquin, M., Jay, N. (eds.) LOD Workshop at ECML PKDD 2014 (2014)"},{"issue":"4","key":"32_CR31","doi-asserted-by":"publisher","first-page":"721","DOI":"10.3233\/SW-180317","volume":"10","author":"P Ristoski","year":"2019","unstructured":"Ristoski, P., Rosati, J., Noia, T.D., Leone, R.D., Paulheim, H.: RDF2Vec: RDF graph embeddings and their applications. Semant. Web 10(4), 721\u2013752 (2019)","journal-title":"Semant. Web"},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Rossi, A., Firmani, D., Merialdo, P., Teofili, T.: Explaining link prediction systems based on knowledge graph embeddings. In: SIGMOD 2022, pp. 2062\u20132075 (2022)","DOI":"10.1145\/3514221.3517887"},{"key":"32_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/widm.12","volume":"1","author":"M Segal","year":"2011","unstructured":"Segal, M., Xiao, Y.: Multivariate random forests. WIREs Data Min. Knowl. Disc. 1, 80\u201387 (2011)","journal-title":"WIREs Data Min. Knowl. Disc."},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Shi, B., Weninger, T.: Open-world knowledge graph completion. ArXiv abs\/1711.03438 (2018)","DOI":"10.1609\/aaai.v32i1.11535"},{"issue":"2","key":"32_CR35","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s10618-021-00806-z","volume":"36","author":"B Steenwinckel","year":"2022","unstructured":"Steenwinckel, B., Vandewiele, G., Weyns, M., Agozzino, T., Turck, F.D., Ongenae, F.: INK: knowledge graph embeddings for node classification. Data Min. Knowl. Discov. 36(2), 620\u2013667 (2022)","journal-title":"Data Min. Knowl. Discov."},{"key":"32_CR36","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: A core of semantic knowledge. In: WWW 2007 (2007)","DOI":"10.1145\/1242572.1242667"},{"key":"32_CR37","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1016\/j.csbj.2020.07.009","volume":"18","author":"J Tang","year":"2020","unstructured":"Tang, J., et al.: Computational advances of tumor marker selection and sample classification in cancer proteomics. Comput. Struct. Biotechnol. J. 18, 2012\u20132025 (2020)","journal-title":"Comput. Struct. Biotechnol. J."},{"key":"32_CR38","doi-asserted-by":"crossref","unstructured":"Toutanova, K., Chen, D.: Observed versus latent features for knowledge base and text inference. In: Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality (2015)","DOI":"10.18653\/v1\/W15-4007"},{"key":"32_CR39","unstructured":"Trouillon, T., Welbl, J., Riedel, S., Gaussier, \u00c9., Bouchard, G.: Complex embeddings for simple link prediction. In: ICML, pp. 2071\u20132080 (2016)"},{"key":"32_CR40","unstructured":"Vashishth, S., Sanyal, S., Nitin, V., Talukdar, P.P.: Composition-based multi-relational graph convolutional networks. In: ICLR 2020 (2020)"},{"issue":"12","key":"32_CR41","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: a survey of approaches and applications. IEEE Trans. Knowl. Data Eng. 29(12), 2724\u20132743 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"32_CR42","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? CoRR abs\/1810.00826 (2018)"},{"key":"32_CR43","unstructured":"Yang, B., Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: ICLR (2015)"},{"key":"32_CR44","doi-asserted-by":"crossref","unstructured":"Yogatama, D., Gillick, D., Lazic, N.: Embedding methods for fine grained entity type classification. In: ACL 2015, pp. 291\u2013296 (2015)","DOI":"10.3115\/v1\/P15-2048"},{"key":"32_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, W., et al.: Iteratively learning embeddings and rules for knowledge graph reasoning. In: WWW 2019, pp. 2366\u20132377 (2019)","DOI":"10.1145\/3308558.3313612"},{"key":"32_CR46","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Zhang, A., Xie, R., Liu, K., Wang, X.: Connecting embeddings for knowledge graph entity typing. In: Jurafsky, D., Chai, J., Schluter, N., Tetreault, J.R. (eds.) ACL 2020, pp. 6419\u20136428 (2020)","DOI":"10.18653\/v1\/2020.acl-main.572"},{"key":"32_CR47","unstructured":"Zhu, Z., Zhang, Z., Xhonneux, L.A.C., Tang, J.: Neural bellman-ford networks: a general graph neural network framework for link prediction. In: NeurIPS 2021, pp. 29476\u201329490 (2021)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47240-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T08:11:51Z","timestamp":1698826311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47240-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031472398","9783031472404"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47240-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","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":"semweb2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2023.semanticweb.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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248","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":"58","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":"23% - 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":"1","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)"}}]}}