[{"publication":"Proceedings of the ACM Web Conference 2026 (WWW ’26)","type":"conference","abstract":[{"text":"Many real-world datasets, such as citation networks, social networks, and molecular structures, are naturally represented as heterogeneous graphs, where nodes belong to different types and have additional features. For example, in a citation network, nodes representing \"Paper\" or \"Author\" may include attributes like keywords or affiliations. A critical machine learning task on these graphs is node classification, which is useful for applications such as fake news detection, corporate risk assessment, and molecular property prediction. Although Heterogeneous Graph Neural Networks (HGNNs) perform well in these contexts, their predictions remain opaque. Existing post-hoc explanation methods lack support for actual node features beyond one-hot encoding of node type and often fail to generate realistic, faithful explanations. To address these gaps, we propose DiGNNExplainer, a model-level explanation approach that synthesizes heterogeneous graphs with realistic node features via discrete denoising diffusion. In particular, we generate realistic discrete features (e.g., bag-of-words features) using diffusion models within a discrete space, whereas previous approaches are limited to continuous spaces. We evaluate our approach on multiple datasets and show that DiGNNExplainer produces explanations that are realistic and faithful to the model's decision-making, outperforming state-of-the-art methods.","lang":"eng"}],"status":"public","external_id":{"arxiv":["2508.08458"]},"_id":"63918","department":[{"_id":"760"}],"user_id":"11871","language":[{"iso":"eng"}],"year":"2026","citation":{"chicago":"Das, Pallabee, and Stefan Heindorf. “Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features.” In <i>Proceedings of the ACM Web Conference 2026 (WWW ’26)</i>. ACM, 2026.","ieee":"P. Das and S. Heindorf, “Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features,” presented at the The Web Conference, Dubai, United Arab Emirates, 2026.","ama":"Das P, Heindorf S. Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features. In: <i>Proceedings of the ACM Web Conference 2026 (WWW ’26)</i>. ACM; 2026.","apa":"Das, P., &#38; Heindorf, S. (2026). Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features. <i>Proceedings of the ACM Web Conference 2026 (WWW ’26)</i>. The Web Conference, Dubai, United Arab Emirates.","mla":"Das, Pallabee, and Stefan Heindorf. “Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features.” <i>Proceedings of the ACM Web Conference 2026 (WWW ’26)</i>, ACM, 2026.","bibtex":"@inproceedings{Das_Heindorf_2026, title={Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features}, booktitle={Proceedings of the ACM Web Conference 2026 (WWW ’26)}, publisher={ACM}, author={Das, Pallabee and Heindorf, Stefan}, year={2026} }","short":"P. Das, S. Heindorf, in: Proceedings of the ACM Web Conference 2026 (WWW ’26), ACM, 2026."},"publisher":"ACM","oa":"1","date_updated":"2026-02-06T18:47:38Z","date_created":"2026-02-06T18:44:34Z","author":[{"full_name":"Das, Pallabee","last_name":"Das","first_name":"Pallabee"},{"full_name":"Heindorf, Stefan","id":"11871","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"}],"title":"Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features","conference":{"name":"The Web Conference","start_date":"2026-04-13","end_date":"2026-04-17","location":"Dubai, United Arab Emirates"},"main_file_link":[{"url":"https://arxiv.org/pdf/2508.08458","open_access":"1"}]},{"abstract":[{"lang":"eng","text":"In the last decade, there has been increasing interest in allowing users to understand how the predictions of machine-learned models come about, thus increasing transparency and empowering users to understand and potentially contest those decisions.Dialogue-based approaches, in contrast to traditional one-shot eXplainable Artificial Intelligence (XAI) methods, facilitate interactive, in-depth exploration through multi-turn dialogues, simulating expert conversations. This paper reviews the current state of dialogue-based XAI, presenting a systematic review of 1,339 publications, narrowed down to 14 based on inclusion criteria. We explore theoretical foundations of the systems, propose key dimensions along which different solutions to dialogue-based XAI differ, and identify key use cases, target audiences, system components, and the types of supported queries and responses. Furthermore, we investigate the current paradigms by which systems are evaluated and highlight their key limitations. Key findings include identifying the main use cases, objectives, and audiences targeted by dialogue-based XAI methods, and summarize the main types of questions and information needs. Beyond discussing avenues for future work, we present a meta-architecture for these systems from existing literature and outlined prevalent theoretical frameworks."}],"publication":"Artificial Intelligence Review","language":[{"iso":"eng"}],"year":"2025","issue":"3","title":"Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches","date_created":"2024-05-26T18:55:58Z","publisher":"Springer","status":"public","type":"journal_article","article_number":"81","user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"_id":"54450","citation":{"chicago":"Mindlin, Dimitry, Fabian Beer, Leonie Nora Sieger, Stefan Heindorf, Philipp Cimiano, Elena Esposito, and Axel-Cyrille Ngonga Ngomo. “Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches.” <i>Artificial Intelligence Review</i> 58, no. 3 (2025). <a href=\"https://doi.org/10.1007/s10462-024-11007-7\">https://doi.org/10.1007/s10462-024-11007-7</a>.","ieee":"D. Mindlin <i>et al.</i>, “Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches,” <i>Artificial Intelligence Review</i>, vol. 58, no. 3, Art. no. 81, 2025, doi: <a href=\"https://doi.org/10.1007/s10462-024-11007-7\">10.1007/s10462-024-11007-7</a>.","ama":"Mindlin D, Beer F, Sieger LN, et al. Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches. <i>Artificial Intelligence Review</i>. 2025;58(3). doi:<a href=\"https://doi.org/10.1007/s10462-024-11007-7\">10.1007/s10462-024-11007-7</a>","bibtex":"@article{Mindlin_Beer_Sieger_Heindorf_Cimiano_Esposito_Ngonga Ngomo_2025, title={Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches}, volume={58}, DOI={<a href=\"https://doi.org/10.1007/s10462-024-11007-7\">10.1007/s10462-024-11007-7</a>}, number={381}, journal={Artificial Intelligence Review}, publisher={Springer}, author={Mindlin, Dimitry and Beer, Fabian and Sieger, Leonie Nora and Heindorf, Stefan and Cimiano, Philipp and Esposito, Elena and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Mindlin, Dimitry, et al. “Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches.” <i>Artificial Intelligence Review</i>, vol. 58, no. 3, 81, Springer, 2025, doi:<a href=\"https://doi.org/10.1007/s10462-024-11007-7\">10.1007/s10462-024-11007-7</a>.","short":"D. Mindlin, F. Beer, L.N. Sieger, S. Heindorf, P. Cimiano, E. Esposito, A.-C. Ngonga Ngomo, Artificial Intelligence Review 58 (2025).","apa":"Mindlin, D., Beer, F., Sieger, L. N., Heindorf, S., Cimiano, P., Esposito, E., &#38; Ngonga Ngomo, A.-C. (2025). Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches. <i>Artificial Intelligence Review</i>, <i>58</i>(3), Article 81. <a href=\"https://doi.org/10.1007/s10462-024-11007-7\">https://doi.org/10.1007/s10462-024-11007-7</a>"},"intvolume":"        58","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s10462-024-11007-7","open_access":"1"}],"doi":"10.1007/s10462-024-11007-7","author":[{"first_name":"Dimitry","full_name":"Mindlin, Dimitry","last_name":"Mindlin"},{"first_name":"Fabian","full_name":"Beer, Fabian","last_name":"Beer"},{"first_name":"Leonie Nora","last_name":"Sieger","id":"93402","full_name":"Sieger, Leonie Nora"},{"full_name":"Heindorf, Stefan","id":"11871","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"},{"full_name":"Cimiano, Philipp","last_name":"Cimiano","first_name":"Philipp"},{"last_name":"Esposito","full_name":"Esposito, Elena","first_name":"Elena"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"volume":58,"date_updated":"2025-01-24T20:09:20Z","oa":"1"},{"doi":"10.48550/ARXIV.2510.15623","title":"CQD-SHAP: Explainable Complex Query Answering via Shapley Values","department":[{"_id":"760"}],"user_id":"114220","date_created":"2026-01-15T10:24:06Z","_id":"63624","date_updated":"2026-01-15T10:24:29Z","status":"public","citation":{"apa":"<i>CQD-SHAP: Explainable Complex Query Answering via Shapley Values</i>. (2025). <a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">https://doi.org/10.48550/ARXIV.2510.15623</a>","bibtex":"@article{CQD-SHAP: Explainable Complex Query Answering via Shapley Values_2025, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">10.48550/ARXIV.2510.15623</a>}, year={2025} }","short":"(2025).","mla":"<i>CQD-SHAP: Explainable Complex Query Answering via Shapley Values</i>. 2025, doi:<a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">10.48550/ARXIV.2510.15623</a>.","ama":"CQD-SHAP: Explainable Complex Query Answering via Shapley Values. Published online 2025. doi:<a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">10.48550/ARXIV.2510.15623</a>","ieee":"“CQD-SHAP: Explainable Complex Query Answering via Shapley Values,” 2025, doi: <a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">10.48550/ARXIV.2510.15623</a>.","chicago":"“CQD-SHAP: Explainable Complex Query Answering via Shapley Values,” 2025. <a href=\"https://doi.org/10.48550/ARXIV.2510.15623\">https://doi.org/10.48550/ARXIV.2510.15623</a>."},"year":"2025","type":"journal_article"},{"ddc":["510"],"language":[{"iso":"ger"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2026-01-29T10:26:33Z","date_created":"2026-01-29T10:26:33Z","creator":"andreade","file_size":1863647,"file_id":"63808","file_name":"BzMu25_DETTELBACH_Rechenfeld.pdf","access_level":"closed"}],"publication":"Beiträge zum Mathematikunterricht 2025 ","title":"Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld","publisher":"WTM - Verlag für wissenschaftliche Texte und Medien","date_created":"2026-01-29T10:30:52Z","year":"2025","corporate_editor":["Gesellschaft für Mathematik"],"file_date_updated":"2026-01-29T10:26:33Z","_id":"63807","department":[{"_id":"917"}],"user_id":"31391","series_title":"Band 2","editor":[{"first_name":"Lisa","full_name":"Schick, Lisa","last_name":"Schick"},{"first_name":"Melanie","last_name":"Platz","full_name":"Platz, Melanie"},{"first_name":"Anselm","last_name":"Lambert","full_name":"Lambert, Anselm"}],"status":"public","type":"book_chapter","conference":{"start_date":"2025-03-03","name":"58. Jahrestagung der Gesellschaft für Mathematik ","location":"Saarbrücken","end_date":"2025-03-07"},"doi":"10.37626/GA9783959873307.0","date_updated":"2026-01-29T10:40:37Z","author":[{"first_name":"Andrea","full_name":"Dettelbach, Andrea","id":"31391","last_name":"Dettelbach"}],"place":"Münster","page":"634 - 637","citation":{"apa":"Dettelbach, A. (2025). Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld. In L. Schick, M. Platz, A. Lambert, &#38; Gesellschaft für Mathematik (Eds.), <i>Beiträge zum Mathematikunterricht 2025 </i> (pp. 634–637). WTM - Verlag für wissenschaftliche Texte und Medien. <a href=\"https://doi.org/10.37626/GA9783959873307.0\">https://doi.org/10.37626/GA9783959873307.0</a>","short":"A. Dettelbach, in: L. Schick, M. Platz, A. Lambert, Gesellschaft für Mathematik (Eds.), Beiträge zum Mathematikunterricht 2025 , WTM - Verlag für wissenschaftliche Texte und Medien, Münster, 2025, pp. 634–637.","mla":"Dettelbach, Andrea. “Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld.” <i>Beiträge zum Mathematikunterricht 2025 </i>, edited by Lisa Schick et al., WTM - Verlag für wissenschaftliche Texte und Medien, 2025, pp. 634–37, doi:<a href=\"https://doi.org/10.37626/GA9783959873307.0\">10.37626/GA9783959873307.0</a>.","bibtex":"@inbook{Dettelbach_2025, place={Münster}, series={Band 2}, title={Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld}, DOI={<a href=\"https://doi.org/10.37626/GA9783959873307.0\">10.37626/GA9783959873307.0</a>}, booktitle={Beiträge zum Mathematikunterricht 2025 }, publisher={WTM - Verlag für wissenschaftliche Texte und Medien}, author={Dettelbach, Andrea}, editor={Schick, Lisa and Platz, Melanie and Lambert, Anselm and Gesellschaft für Mathematik}, year={2025}, pages={634–637}, collection={Band 2} }","ama":"Dettelbach A. Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld. In: Schick L, Platz M, Lambert A, Gesellschaft für Mathematik, eds. <i>Beiträge zum Mathematikunterricht 2025 </i>. Band 2. WTM - Verlag für wissenschaftliche Texte und Medien; 2025:634-637. doi:<a href=\"https://doi.org/10.37626/GA9783959873307.0\">10.37626/GA9783959873307.0</a>","chicago":"Dettelbach, Andrea. “Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld.” In <i>Beiträge zum Mathematikunterricht 2025 </i>, edited by Lisa Schick, Melanie Platz, Anselm Lambert, and Gesellschaft für Mathematik, 634–37. Band 2. Münster: WTM - Verlag für wissenschaftliche Texte und Medien, 2025. <a href=\"https://doi.org/10.37626/GA9783959873307.0\">https://doi.org/10.37626/GA9783959873307.0</a>.","ieee":"A. Dettelbach, “Rechnen mit Beziehungen - operative Beziehungen erkennen, beschreiben und nutzen. Entwicklung einer digitalbasierten Lernumgebung mit der App Rechenfeld,” in <i>Beiträge zum Mathematikunterricht 2025 </i>, L. Schick, M. Platz, A. Lambert, and Gesellschaft für Mathematik, Eds. Münster: WTM - Verlag für wissenschaftliche Texte und Medien, 2025, pp. 634–637."},"has_accepted_license":"1","publication_identifier":{"unknown":["978-3-95987-329-1"]},"publication_status":"published"},{"status":"public","publication":"Proceedings of the 34th ACM International Conference on Information and Knowledge Management","type":"conference","language":[{"iso":"eng"}],"_id":"62707","department":[{"_id":"760"}],"user_id":"11871","year":"2025","citation":{"apa":"Heindorf, S., &#38; Neib, D. (2025). Assessing Natural Language Explanations of Relational Graph Neural Networks. <i>Proceedings of the 34th ACM International Conference on Information and Knowledge Management</i>. <a href=\"https://doi.org/10.1145/3746252.3760918\">https://doi.org/10.1145/3746252.3760918</a>","mla":"Heindorf, Stefan, and Daniel Neib. “Assessing Natural Language Explanations of Relational Graph Neural Networks.” <i>Proceedings of the 34th ACM International Conference on Information and Knowledge Management</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3746252.3760918\">10.1145/3746252.3760918</a>.","short":"S. Heindorf, D. Neib, in: Proceedings of the 34th ACM International Conference on Information and Knowledge Management, ACM, 2025.","bibtex":"@inproceedings{Heindorf_Neib_2025, title={Assessing Natural Language Explanations of Relational Graph Neural Networks}, DOI={<a href=\"https://doi.org/10.1145/3746252.3760918\">10.1145/3746252.3760918</a>}, booktitle={Proceedings of the 34th ACM International Conference on Information and Knowledge Management}, publisher={ACM}, author={Heindorf, Stefan and Neib, Daniel}, year={2025} }","ama":"Heindorf S, Neib D. Assessing Natural Language Explanations of Relational Graph Neural Networks. In: <i>Proceedings of the 34th ACM International Conference on Information and Knowledge Management</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3746252.3760918\">10.1145/3746252.3760918</a>","ieee":"S. Heindorf and D. Neib, “Assessing Natural Language Explanations of Relational Graph Neural Networks,” 2025, doi: <a href=\"https://doi.org/10.1145/3746252.3760918\">10.1145/3746252.3760918</a>.","chicago":"Heindorf, Stefan, and Daniel Neib. “Assessing Natural Language Explanations of Relational Graph Neural Networks.” In <i>Proceedings of the 34th ACM International Conference on Information and Knowledge Management</i>. ACM, 2025. <a href=\"https://doi.org/10.1145/3746252.3760918\">https://doi.org/10.1145/3746252.3760918</a>."},"publication_status":"published","title":"Assessing Natural Language Explanations of Relational Graph Neural Networks","doi":"10.1145/3746252.3760918","date_updated":"2025-11-28T15:36:57Z","publisher":"ACM","date_created":"2025-11-28T15:36:11Z","author":[{"id":"11871","full_name":"Heindorf, Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"},{"first_name":"Daniel","last_name":"Neib","full_name":"Neib, Daniel"}]},{"citation":{"ama":"Pandit G, Röder M, Ngonga Ngomo A-C. Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>","chicago":"Pandit, Gaurav, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>.","ieee":"G. Pandit, M. Röder, and A.-C. Ngonga Ngomo, “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025.","apa":"Pandit, G., Röder, M., &#38; Ngonga Ngomo, A.-C. (2025). Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>","bibtex":"@inbook{Pandit_Röder_Ngonga Ngomo_2025, place={Cham}, title={Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Pandit, Gaurav and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"G. Pandit, M. Röder, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","mla":"Pandit, Gaurav, et al. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>."},"year":"2025","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"doi":"10.1007/978-3-031-94575-5_4","title":"Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings","author":[{"last_name":"Pandit","full_name":"Pandit, Gaurav","first_name":"Gaurav"},{"id":"67199","full_name":"Röder, Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","first_name":"Michael"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"}],"date_created":"2026-01-06T09:53:58Z","date_updated":"2026-01-06T09:55:26Z","publisher":"Springer Nature Switzerland","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"67199","department":[{"_id":"574"},{"_id":"923"}],"_id":"63507"},{"department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63572","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"conference","status":"public","author":[{"last_name":"Demir","full_name":"Demir, Caglar","id":"43817","first_name":"Caglar"},{"full_name":"Yekini, Moshood Olawale","id":"114533","last_name":"Yekini","first_name":"Moshood Olawale"},{"first_name":"Michael","id":"67199","full_name":"Röder, Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"date_created":"2026-01-12T17:13:22Z","date_updated":"2026-01-12T17:17:07Z","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-032-06066-2_29","conference":{"end_date":"2025-09-19","location":"Porto","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2025-09-15"},"title":"Tree-Based OWL Class Expression Learner over Large Graphs","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783032060655","9783032060662"]},"publication_status":"published","citation":{"apa":"Demir, C., Yekini, M. O., Röder, M., Mahmood, Y., &#38; Ngonga Ngomo, A.-C. (2025). Tree-Based OWL Class Expression Learner over Large Graphs. <i>Lecture Notes in Computer Science</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>","bibtex":"@inproceedings{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham}, title={Tree-Based OWL Class Expression Learner over Large Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Demir, Caglar and Yekini, Moshood Olawale and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"C. Demir, M.O. Yekini, M. Röder, Y. Mahmood, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","mla":"Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","ieee":"C. Demir, M. O. Yekini, M. Röder, Y. Mahmood, and A.-C. Ngonga Ngomo, “Tree-Based OWL Class Expression Learner over Large Graphs,” presented at the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto, 2025, doi: <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","chicago":"Demir, Caglar, Moshood Olawale Yekini, Michael Röder, Yasir Mahmood, and Axel-Cyrille Ngonga Ngomo. “Tree-Based OWL Class Expression Learner over Large Graphs.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>.","ama":"Demir C, Yekini MO, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class Expression Learner over Large Graphs. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>"},"place":"Cham","year":"2025"},{"publication_status":"published","publication_identifier":{"isbn":["9783031945748","9783031945755"],"issn":["0302-9743","1611-3349"]},"citation":{"apa":"Kapoor, S., Sharma, A., Röder, M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2025). Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>","mla":"Kapoor, Sourabh, et al. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","bibtex":"@inproceedings{Kapoor_Sharma_Röder_Demir_Ngonga Ngomo_2025, place={Cham}, title={Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Kapoor, Sourabh and Sharma, Arnab and Röder, Michael and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"S. Kapoor, A. Sharma, M. Röder, C. Demir, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","ama":"Kapoor S, Sharma A, Röder M, Demir C, Ngonga Ngomo A-C. Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>","ieee":"S. Kapoor, A. Sharma, M. Röder, C. Demir, and A.-C. Ngonga Ngomo, “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","chicago":"Kapoor, Sourabh, Arnab Sharma, Michael Röder, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>."},"year":"2025","place":"Cham","date_created":"2026-01-12T17:24:11Z","author":[{"first_name":"Sourabh","full_name":"Kapoor, Sourabh","last_name":"Kapoor"},{"first_name":"Arnab","id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma"},{"first_name":"Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","full_name":"Röder, Michael","id":"67199"},{"first_name":"Caglar","full_name":"Demir, Caglar","id":"43817","last_name":"Demir"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"publisher":"Springer Nature Switzerland","date_updated":"2026-01-12T17:24:49Z","doi":"10.1007/978-3-031-94575-5_15","title":"Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks","type":"conference","publication":"Lecture Notes in Computer Science","status":"public","user_id":"67199","department":[{"_id":"574"},{"_id":"923"}],"_id":"63575","language":[{"iso":"eng"}]},{"publication":"Lecture Notes in Computer Science","type":"conference","status":"public","department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63573","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783032095268","9783032095275"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"A. Memariani, M. Röder, A. Sharma, C. Demir, and A.-C. Ngonga Ngomo, “Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>.","chicago":"Memariani, Adel, Michael Röder, Arnab Sharma, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Link Prediction Under Non-Targeted Attacks: Do Soft Labels Always Help?” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">https://doi.org/10.1007/978-3-032-09527-5_6</a>.","ama":"Memariani A, Röder M, Sharma A, Demir C, Ngonga Ngomo A-C. Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help? In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>","bibtex":"@inproceedings{Memariani_Röder_Sharma_Demir_Ngonga Ngomo_2025, place={Cham}, title={Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Memariani, Adel and Röder, Michael and Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"A. Memariani, M. Röder, A. Sharma, C. Demir, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","mla":"Memariani, Adel, et al. “Link Prediction Under Non-Targeted Attacks: Do Soft Labels Always Help?” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">10.1007/978-3-032-09527-5_6</a>.","apa":"Memariani, A., Röder, M., Sharma, A., Demir, C., &#38; Ngonga Ngomo, A.-C. (2025). Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help? <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-032-09527-5_6\">https://doi.org/10.1007/978-3-032-09527-5_6</a>"},"year":"2025","place":"Cham","author":[{"full_name":"Memariani, Adel","last_name":"Memariani","first_name":"Adel"},{"first_name":"Michael","id":"67199","full_name":"Röder, Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277"},{"last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200","first_name":"Arnab"},{"first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar","id":"43817"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"}],"date_created":"2026-01-12T17:18:35Z","date_updated":"2026-01-12T17:24:46Z","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-032-09527-5_6","title":"Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?"},{"status":"public","publication":"Proceedings of the Knowledge Capture Conference 2025","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63574","citation":{"ama":"Zhang Q, Röder M, Srivastava N, KOUAGOU NJ, Ngonga Ngomo A-C. Explainable Benchmarking through the Lense of Concept Learning. In: <i>Proceedings of the Knowledge Capture Conference 2025</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>","chicago":"Zhang, Quannian, Michael Röder, Nikit Srivastava, N’Dah Jean KOUAGOU, and Axel-Cyrille Ngonga Ngomo. “Explainable Benchmarking through the Lense of Concept Learning.” In <i>Proceedings of the Knowledge Capture Conference 2025</i>. ACM, 2025. <a href=\"https://doi.org/10.1145/3731443.3771359\">https://doi.org/10.1145/3731443.3771359</a>.","ieee":"Q. Zhang, M. Röder, N. Srivastava, N. J. KOUAGOU, and A.-C. Ngonga Ngomo, “Explainable Benchmarking through the Lense of Concept Learning,” 2025, doi: <a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>.","bibtex":"@inproceedings{Zhang_Röder_Srivastava_KOUAGOU_Ngonga Ngomo_2025, title={Explainable Benchmarking through the Lense of Concept Learning}, DOI={<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>}, booktitle={Proceedings of the Knowledge Capture Conference 2025}, publisher={ACM}, author={Zhang, Quannian and Röder, Michael and Srivastava, Nikit and KOUAGOU, N’Dah Jean and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Zhang, Quannian, et al. “Explainable Benchmarking through the Lense of Concept Learning.” <i>Proceedings of the Knowledge Capture Conference 2025</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3731443.3771359\">10.1145/3731443.3771359</a>.","short":"Q. Zhang, M. Röder, N. Srivastava, N.J. KOUAGOU, A.-C. Ngonga Ngomo, in: Proceedings of the Knowledge Capture Conference 2025, ACM, 2025.","apa":"Zhang, Q., Röder, M., Srivastava, N., KOUAGOU, N. J., &#38; Ngonga Ngomo, A.-C. (2025). Explainable Benchmarking through the Lense of Concept Learning. <i>Proceedings of the Knowledge Capture Conference 2025</i>. <a href=\"https://doi.org/10.1145/3731443.3771359\">https://doi.org/10.1145/3731443.3771359</a>"},"year":"2025","publication_status":"published","doi":"10.1145/3731443.3771359","title":"Explainable Benchmarking through the Lense of Concept Learning","author":[{"first_name":"Quannian","id":"104099","full_name":"Zhang, Quannian","last_name":"Zhang","orcid":"0009-0008-9497-3204"},{"id":"67199","full_name":"Röder, Michael","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","first_name":"Michael"},{"first_name":"Nikit","id":"70066","full_name":"Srivastava, Nikit","last_name":"Srivastava","orcid":"0009-0004-5164-4911"},{"full_name":"KOUAGOU, N'Dah Jean","id":"87189","last_name":"KOUAGOU","first_name":"N'Dah Jean"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"date_created":"2026-01-12T17:21:05Z","date_updated":"2026-01-12T17:25:00Z","publisher":"ACM"},{"oa":"1","date_updated":"2024-05-26T19:06:10Z","publisher":"ACM","date_created":"2024-05-26T18:52:47Z","author":[{"full_name":"KOUAGOU, N'Dah Jean","id":"87189","last_name":"KOUAGOU","first_name":"N'Dah Jean"},{"first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar","id":"43817"},{"id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","last_name":"Zahera","orcid":"0000-0003-0215-1278","first_name":"Hamada Mohamed Abdelsamee"},{"orcid":"0000-0002-6575-807X","last_name":"Wilke","id":"9101","full_name":"Wilke, Adrian","first_name":"Adrian"},{"id":"11871","full_name":"Heindorf, Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","first_name":"Stefan"},{"first_name":"Jiayi","full_name":"Li, Jiayi","last_name":"Li"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"title":"Universal Knowledge Graph Embeddings","main_file_link":[{"url":"https://dl.acm.org/doi/abs/10.1145/3589335.3651978","open_access":"1"}],"conference":{"location":"Singapore","end_date":"2024-05-17","start_date":"2024-05-13","name":"Companion Proceedings of the ACM on Web Conference 2024"},"doi":"10.1145/3589335.3651978","publication_status":"published","year":"2024","citation":{"ama":"KOUAGOU NJ, Demir C, Zahera HMA, et al. Universal Knowledge Graph Embeddings. In: <i>Companion Proceedings of the ACM on Web Conference 2024</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>","ieee":"N. J. KOUAGOU <i>et al.</i>, “Universal Knowledge Graph Embeddings,” presented at the Companion Proceedings of the ACM on Web Conference 2024, Singapore, 2024, doi: <a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>.","chicago":"KOUAGOU, N’Dah Jean, Caglar Demir, Hamada Mohamed Abdelsamee Zahera, Adrian Wilke, Stefan Heindorf, Jiayi Li, and Axel-Cyrille Ngonga Ngomo. “Universal Knowledge Graph Embeddings.” In <i>Companion Proceedings of the ACM on Web Conference 2024</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3589335.3651978\">https://doi.org/10.1145/3589335.3651978</a>.","apa":"KOUAGOU, N. J., Demir, C., Zahera, H. M. A., Wilke, A., Heindorf, S., Li, J., &#38; Ngonga Ngomo, A.-C. (2024). Universal Knowledge Graph Embeddings. <i>Companion Proceedings of the ACM on Web Conference 2024</i>. Companion Proceedings of the ACM on Web Conference 2024, Singapore. <a href=\"https://doi.org/10.1145/3589335.3651978\">https://doi.org/10.1145/3589335.3651978</a>","short":"N.J. KOUAGOU, C. Demir, H.M.A. Zahera, A. Wilke, S. Heindorf, J. Li, A.-C. Ngonga Ngomo, in: Companion Proceedings of the ACM on Web Conference 2024, ACM, 2024.","bibtex":"@inproceedings{KOUAGOU_Demir_Zahera_Wilke_Heindorf_Li_Ngonga Ngomo_2024, title={Universal Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>}, booktitle={Companion Proceedings of the ACM on Web Conference 2024}, publisher={ACM}, author={KOUAGOU, N’Dah Jean and Demir, Caglar and Zahera, Hamada Mohamed Abdelsamee and Wilke, Adrian and Heindorf, Stefan and Li, Jiayi and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","mla":"KOUAGOU, N’Dah Jean, et al. “Universal Knowledge Graph Embeddings.” <i>Companion Proceedings of the ACM on Web Conference 2024</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3589335.3651978\">10.1145/3589335.3651978</a>."},"_id":"54449","user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Companion Proceedings of the ACM on Web Conference 2024","status":"public"},{"year":"2024","citation":{"short":"D. Köhler, S. Heindorf, ArXiv:2405.12654 (2024).","mla":"Köhler, Dominik, and Stefan Heindorf. “Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks.” <i>ArXiv:2405.12654</i>, 2024.","bibtex":"@article{Köhler_Heindorf_2024, title={Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks}, journal={arXiv:2405.12654}, author={Köhler, Dominik and Heindorf, Stefan}, year={2024} }","apa":"Köhler, D., &#38; Heindorf, S. (2024). Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks. In <i>arXiv:2405.12654</i>.","ama":"Köhler D, Heindorf S. Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks. <i>arXiv:240512654</i>. Published online 2024.","chicago":"Köhler, Dominik, and Stefan Heindorf. “Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks.” <i>ArXiv:2405.12654</i>, 2024.","ieee":"D. Köhler and S. Heindorf, “Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks,” <i>arXiv:2405.12654</i>. 2024."},"title":"Utilizing Description Logics for Global Explanations of Heterogeneous  Graph Neural Networks","main_file_link":[{"url":"https://arxiv.org/abs/2405.12654","open_access":"1"}],"oa":"1","date_updated":"2024-05-26T19:04:55Z","author":[{"first_name":"Dominik","full_name":"Köhler, Dominik","last_name":"Köhler"},{"orcid":"0000-0002-4525-6865","last_name":"Heindorf","full_name":"Heindorf, Stefan","id":"11871","first_name":"Stefan"}],"date_created":"2024-05-26T18:49:59Z","abstract":[{"lang":"eng","text":"Graph Neural Networks (GNNs) are effective for node classification in\r\ngraph-structured data, but they lack explainability, especially at the global\r\nlevel. Current research mainly utilizes subgraphs of the input as local\r\nexplanations or generates new graphs as global explanations. However, these\r\ngraph-based methods are limited in their ability to explain classes with\r\nmultiple sufficient explanations. To provide more expressive explanations, we\r\npropose utilizing class expressions (CEs) from the field of description logic\r\n(DL). Our approach explains heterogeneous graphs with different types of nodes\r\nusing CEs in the EL description logic. To identify the best explanation among\r\nmultiple candidate explanations, we employ and compare two different scoring\r\nfunctions: (1) For a given CE, we construct multiple graphs, have the GNN make\r\na prediction for each graph, and aggregate the predicted scores. (2) We score\r\nthe CE in terms of fidelity, i.e., we compare the predictions of the GNN to the\r\npredictions by the CE on a separate validation set. Instead of subgraph-based\r\nexplanations, we offer CE-based explanations."}],"status":"public","type":"preprint","publication":"arXiv:2405.12654","language":[{"iso":"eng"}],"_id":"54448","external_id":{"arxiv":["2405.12654"]},"user_id":"11871","department":[{"_id":"760"}]},{"publication_status":"accepted","page":"2204–2215","citation":{"ama":"Blübaum L, Heindorf S. Causal Question Answering with Reinforcement Learning. In: <i>The World Wide Web Conference (WWW)</i>. ACM; :2204–2215. doi:<a href=\"https://doi.org/10.1145/3589334.3645610\">10.1145/3589334.3645610</a>","chicago":"Blübaum, Lukas, and Stefan Heindorf. “Causal Question Answering with Reinforcement Learning.” In <i>The World Wide Web Conference (WWW)</i>, 2204–2215. ACM, n.d. <a href=\"https://doi.org/10.1145/3589334.3645610\">https://doi.org/10.1145/3589334.3645610</a>.","ieee":"L. Blübaum and S. Heindorf, “Causal Question Answering with Reinforcement Learning,” in <i>The World Wide Web Conference (WWW)</i>, Singapore, pp. 2204–2215, doi: <a href=\"https://doi.org/10.1145/3589334.3645610\">10.1145/3589334.3645610</a>.","apa":"Blübaum, L., &#38; Heindorf, S. (n.d.). Causal Question Answering with Reinforcement Learning. <i>The World Wide Web Conference (WWW)</i>, 2204–2215. <a href=\"https://doi.org/10.1145/3589334.3645610\">https://doi.org/10.1145/3589334.3645610</a>","mla":"Blübaum, Lukas, and Stefan Heindorf. “Causal Question Answering with Reinforcement Learning.” <i>The World Wide Web Conference (WWW)</i>, ACM, pp. 2204–2215, doi:<a href=\"https://doi.org/10.1145/3589334.3645610\">10.1145/3589334.3645610</a>.","short":"L. Blübaum, S. Heindorf, in: The World Wide Web Conference (WWW), ACM, n.d., pp. 2204–2215.","bibtex":"@inproceedings{Blübaum_Heindorf, title={Causal Question Answering with Reinforcement Learning}, DOI={<a href=\"https://doi.org/10.1145/3589334.3645610\">10.1145/3589334.3645610</a>}, booktitle={The World Wide Web Conference (WWW)}, publisher={ACM}, author={Blübaum, Lukas and Heindorf, Stefan}, pages={2204–2215} }"},"year":"2024","author":[{"last_name":"Blübaum","full_name":"Blübaum, Lukas","first_name":"Lukas"},{"last_name":"Heindorf","orcid":"0000-0002-4525-6865","id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan"}],"date_created":"2024-03-01T16:32:39Z","date_updated":"2024-05-26T19:01:34Z","oa":"1","publisher":"ACM","conference":{"start_date":"2024-05-13","name":"The Web Conference","location":"Singapore","end_date":"2024-05-17"},"doi":"10.1145/3589334.3645610","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2311.02760"}],"title":"Causal Question Answering with Reinforcement Learning","publication":"The World Wide Web Conference (WWW)","type":"conference","status":"public","department":[{"_id":"760"}],"user_id":"11871","_id":"52231","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"language":[{"iso":"eng"}]},{"_id":"56213","project":[{"grant_number":"NW21-059D","name":"SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen","_id":"285"}],"department":[{"_id":"760"},{"_id":"574"}],"user_id":"11871","language":[{"iso":"eng"}],"publication":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),","type":"conference","status":"public","date_updated":"2024-09-23T12:30:25Z","publisher":"ACM","oa":"1","author":[{"full_name":"Sapkota, Rupesh","id":"89326","last_name":"Sapkota","first_name":"Rupesh"},{"full_name":"Köhler, Dominik","last_name":"Köhler","first_name":"Dominik"},{"id":"11871","full_name":"Heindorf, Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan"}],"date_created":"2024-09-23T12:30:10Z","title":"EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs","doi":"10.1145/3627673.3679904","conference":{"name":"33rd ACM International Conference on Information and Knowledge Management","start_date":"2024-10-21","end_date":"2024-10-25","location":"Boise, Idaho, USA"},"main_file_link":[{"open_access":"1","url":"https://papers.dice-research.org/2024/CIKM_EDGE/public.pdf"}],"place":"Boise, Idaho, USA","year":"2024","citation":{"ama":"Sapkota R, Köhler D, Heindorf S. EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs. In: <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>","chicago":"Sapkota, Rupesh, Dominik Köhler, and Stefan Heindorf. “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs.” In <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. Boise, Idaho, USA: ACM, 2024. <a href=\"https://doi.org/10.1145/3627673.3679904\">https://doi.org/10.1145/3627673.3679904</a>.","ieee":"R. Sapkota, D. Köhler, and S. Heindorf, “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs,” presented at the 33rd ACM International Conference on Information and Knowledge Management, Boise, Idaho, USA, 2024, doi: <a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>.","apa":"Sapkota, R., Köhler, D., &#38; Heindorf, S. (2024). EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs. <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i>. 33rd ACM International Conference on Information and Knowledge Management, Boise, Idaho, USA. <a href=\"https://doi.org/10.1145/3627673.3679904\">https://doi.org/10.1145/3627673.3679904</a>","mla":"Sapkota, Rupesh, et al. “EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs.” <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),</i> ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>.","short":"R. Sapkota, D. Köhler, S. Heindorf, in: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24), ACM, Boise, Idaho, USA, 2024.","bibtex":"@inproceedings{Sapkota_Köhler_Heindorf_2024, place={Boise, Idaho, USA}, title={EDGE: Evaluation Framework for Logical vs. Subgraph Explanations for Node Classifiers on Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1145/3627673.3679904\">10.1145/3627673.3679904</a>}, booktitle={Proceedings of the 33rd ACM International Conference on Information and Knowledge Management (CIKM ’24),}, publisher={ACM}, author={Sapkota, Rupesh and Köhler, Dominik and Heindorf, Stefan}, year={2024} }"}},{"doi":"10.1007/978-3-031-63787-2_7","conference":{"location":"Malta, Valletta","end_date":"2024-07-19","start_date":"2024-07-17","name":"The 2nd World Conference on eXplainable Artificial Intelligence"},"title":"AutoCL: AutoML for Concept Learning","date_created":"2024-09-23T12:31:23Z","author":[{"first_name":"Jiayi","last_name":"Li","full_name":"Li, Jiayi"},{"first_name":"Sheetal","full_name":"Satheesh, Sheetal","last_name":"Satheesh"},{"first_name":"Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","full_name":"Heindorf, Stefan","id":"11871"},{"first_name":"Diego","last_name":"Moussallem","id":"71635","full_name":"Moussallem, Diego"},{"first_name":"René","full_name":"Speck, René","id":"70843","last_name":"Speck"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2024-09-23T12:36:17Z","publisher":"Springer Nature Switzerland","citation":{"mla":"Li, Jiayi, et al. “AutoCL: AutoML for Concept Learning.” <i>Communications in Computer and Information Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>.","bibtex":"@inbook{Li_Satheesh_Heindorf_Moussallem_Speck_Ngonga Ngomo_2024, place={Cham}, title={AutoCL: AutoML for Concept Learning}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>}, booktitle={Communications in Computer and Information Science}, publisher={Springer Nature Switzerland}, author={Li, Jiayi and Satheesh, Sheetal and Heindorf, Stefan and Moussallem, Diego and Speck, René and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"J. Li, S. Satheesh, S. Heindorf, D. Moussallem, R. Speck, A.-C. Ngonga Ngomo, in: Communications in Computer and Information Science, Springer Nature Switzerland, Cham, 2024.","apa":"Li, J., Satheesh, S., Heindorf, S., Moussallem, D., Speck, R., &#38; Ngonga Ngomo, A.-C. (2024). AutoCL: AutoML for Concept Learning. In <i>Communications in Computer and Information Science</i>. The 2nd World Conference on eXplainable Artificial Intelligence, Malta, Valletta. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">https://doi.org/10.1007/978-3-031-63787-2_7</a>","ama":"Li J, Satheesh S, Heindorf S, Moussallem D, Speck R, Ngonga Ngomo A-C. AutoCL: AutoML for Concept Learning. In: <i>Communications in Computer and Information Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">10.1007/978-3-031-63787-2_7</a>","chicago":"Li, Jiayi, Sheetal Satheesh, Stefan Heindorf, Diego Moussallem, René Speck, and Axel-Cyrille Ngonga Ngomo. “AutoCL: AutoML for Concept Learning.” In <i>Communications in Computer and Information Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-63787-2_7\">https://doi.org/10.1007/978-3-031-63787-2_7</a>.","ieee":"J. Li, S. Satheesh, S. Heindorf, D. Moussallem, R. Speck, and A.-C. Ngonga Ngomo, “AutoCL: AutoML for Concept Learning,” in <i>Communications in Computer and Information Science</i>, Cham: Springer Nature Switzerland, 2024."},"year":"2024","place":"Cham","publication_status":"published","publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783031637865","9783031637872"]},"language":[{"iso":"eng"}],"user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"_id":"56214","status":"public","type":"book_chapter","publication":"Communications in Computer and Information Science"},{"author":[{"last_name":"Kouagou","id":"87189","full_name":"Kouagou, N'Dah Jean","first_name":"N'Dah Jean"},{"first_name":"Stefan","last_name":"Heindorf","orcid":"0000-0002-4525-6865","id":"11871","full_name":"Heindorf, Stefan"},{"last_name":"Demir","full_name":"Demir, Caglar","id":"43817","first_name":"Caglar"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"oa":"1","date_updated":"2024-05-22T10:48:24Z","main_file_link":[{"open_access":"1","url":"https://papers.dice-research.org/2023/ECML_NCES2/NCES2_public.pdf"}],"doi":"10.1007/978-3-031-43421-1_12","conference":{"name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2023-09-18","end_date":"2023-09-22","location":"Turin"},"publication_status":"published","publication_identifier":{"isbn":["9783031434204","9783031434211"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","citation":{"chicago":"Kouagou, N’Dah Jean, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Neural Class Expression Synthesis in ALCHIQ(D).” In <i>Machine Learning and Knowledge Discovery in Databases: Research Track</i>. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-43421-1_12\">https://doi.org/10.1007/978-3-031-43421-1_12</a>.","ieee":"N. J. Kouagou, S. Heindorf, C. Demir, and A.-C. Ngonga Ngomo, “Neural Class Expression Synthesis in ALCHIQ(D),” in <i>Machine Learning and Knowledge Discovery in Databases: Research Track</i>, Cham: Springer Nature Switzerland, 2023.","ama":"Kouagou NJ, Heindorf S, Demir C, Ngonga Ngomo A-C. Neural Class Expression Synthesis in ALCHIQ(D). In: <i>Machine Learning and Knowledge Discovery in Databases: Research Track</i>. Springer Nature Switzerland; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-43421-1_12\">10.1007/978-3-031-43421-1_12</a>","apa":"Kouagou, N. J., Heindorf, S., Demir, C., &#38; Ngonga Ngomo, A.-C. (2023). Neural Class Expression Synthesis in ALCHIQ(D). In <i>Machine Learning and Knowledge Discovery in Databases: Research Track</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Turin. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-43421-1_12\">https://doi.org/10.1007/978-3-031-43421-1_12</a>","mla":"Kouagou, N’Dah Jean, et al. “Neural Class Expression Synthesis in ALCHIQ(D).” <i>Machine Learning and Knowledge Discovery in Databases: Research Track</i>, Springer Nature Switzerland, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-43421-1_12\">10.1007/978-3-031-43421-1_12</a>.","bibtex":"@inbook{Kouagou_Heindorf_Demir_Ngonga Ngomo_2023, place={Cham}, title={Neural Class Expression Synthesis in ALCHIQ(D)}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-43421-1_12\">10.1007/978-3-031-43421-1_12</a>}, booktitle={Machine Learning and Knowledge Discovery in Databases: Research Track}, publisher={Springer Nature Switzerland}, author={Kouagou, N’Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2023} }","short":"N.J. Kouagou, S. Heindorf, C. Demir, A.-C. Ngonga Ngomo, in: Machine Learning and Knowledge Discovery in Databases: Research Track, Springer Nature Switzerland, Cham, 2023."},"place":"Cham","user_id":"11871","department":[{"_id":"760"},{"_id":"574"}],"_id":"47421","file_date_updated":"2024-05-22T10:46:58Z","type":"book_chapter","status":"public","date_created":"2023-09-25T13:42:01Z","publisher":"Springer Nature Switzerland","title":"Neural Class Expression Synthesis in ALCHIQ(D)","year":"2023","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Machine Learning and Knowledge Discovery in Databases: Research Track","file":[{"file_name":"NCES2_public.pdf","access_level":"open_access","file_id":"54417","file_size":432708,"date_created":"2024-05-22T10:45:08Z","creator":"heindorf","date_updated":"2024-05-22T10:46:58Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Class expression learning in description logics has long been regarded as an iterative search problem in an infinite conceptual space. Each iteration of the search process invokes a reasoner and a heuristic function. The reasoner finds the instances of the current expression, and the heuristic function computes the information gain and decides on the next step to be taken. As the size of the background knowledge base grows, search-based approaches for class expression learning become prohibitively slow. Current neural class expression synthesis (NCES) approaches investigate the use of neural networks for class expression learning in the attributive language with complement (ALC). While they show significant improvements over search-based approaches in runtime and quality of the computed solutions, they rely on the availability of pretrained embeddings for the input knowledge base. Moreover, they are not applicable to ontologies in more expressive description logics. In this paper, we propose a novel NCES approach which extends the state of the art to the description logic ALCHIQ(D). Our extension, dubbed NCES2, comes with an improved training data generator and does not require pretrained embeddings for the input knowledge base as both the embedding model and the class expression synthesizer are trained jointly. Empirical results on benchmark datasets suggest that our approach inherits the scalability capability of current NCES instances with the additional advantage that it supports more complex learning problems. NCES2 achieves the highest performance overall when compared to search-based approaches and to its predecessor NCES. We provide our source code, datasets, and pretrained models at https://github.com/dice-group/NCES2.","lang":"eng"}]},{"user_id":"11871","department":[{"_id":"574"},{"_id":"760"}],"_id":"37937","external_id":{"arxiv":["2301.05109"]},"language":[{"iso":"eng"}],"type":"preprint","publication":"arXiv:2301.05109","status":"public","abstract":[{"text":"Knowledge bases are widely used for information management on the web,\r\nenabling high-impact applications such as web search, question answering, and\r\nnatural language processing. They also serve as the backbone for automatic\r\ndecision systems, e.g. for medical diagnostics and credit scoring. As\r\nstakeholders affected by these decisions would like to understand their\r\nsituation and verify fair decisions, a number of explanation approaches have\r\nbeen proposed using concepts in description logics. However, the learned\r\nconcepts can become long and difficult to fathom for non-experts, even when\r\nverbalized. Moreover, long concepts do not immediately provide a clear path of\r\naction to change one's situation. Counterfactuals answering the question \"How\r\nmust feature values be changed to obtain a different classification?\" have been\r\nproposed as short, human-friendly explanations for tabular data. In this paper,\r\nwe transfer the notion of counterfactuals to description logics and propose the\r\nfirst algorithm for generating counterfactual explanations in the description\r\nlogic $\\mathcal{ELH}$. Counterfactual candidates are generated from concepts\r\nand the candidates with fewest feature changes are selected as counterfactuals.\r\nIn case of multiple counterfactuals, we rank them according to the likeliness\r\nof their feature combinations. For evaluation, we conduct a user survey to\r\ninvestigate which of the generated counterfactual candidates are preferred for\r\nexplanation by participants. In a second study, we explore possible use cases\r\nfor counterfactual explanations.","lang":"eng"}],"date_created":"2023-01-22T19:36:01Z","author":[{"last_name":"Sieger","id":"93402","full_name":"Sieger, Leonie Nora","first_name":"Leonie Nora"},{"orcid":"0000-0002-4525-6865","last_name":"Heindorf","id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan"},{"last_name":"Blübaum","full_name":"Blübaum, Lukas","first_name":"Lukas"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"oa":"1","date_updated":"2024-05-26T19:03:44Z","main_file_link":[{"url":"https://arxiv.org/pdf/2301.05109.pdf","open_access":"1"}],"title":"Explaining ELH Concept Descriptions through Counterfactual Reasoning","citation":{"chicago":"Sieger, Leonie Nora, Stefan Heindorf, Lukas Blübaum, and Axel-Cyrille Ngonga Ngomo. “Explaining ELH Concept Descriptions through Counterfactual Reasoning.” <i>ArXiv:2301.05109</i>, 2023.","ieee":"L. N. Sieger, S. Heindorf, L. Blübaum, and A.-C. Ngonga Ngomo, “Explaining ELH Concept Descriptions through Counterfactual Reasoning,” <i>arXiv:2301.05109</i>. 2023.","ama":"Sieger LN, Heindorf S, Blübaum L, Ngonga Ngomo A-C. Explaining ELH Concept Descriptions through Counterfactual Reasoning. <i>arXiv:230105109</i>. Published online 2023.","apa":"Sieger, L. N., Heindorf, S., Blübaum, L., &#38; Ngonga Ngomo, A.-C. (2023). Explaining ELH Concept Descriptions through Counterfactual Reasoning. In <i>arXiv:2301.05109</i>.","short":"L.N. Sieger, S. Heindorf, L. Blübaum, A.-C. Ngonga Ngomo, ArXiv:2301.05109 (2023).","bibtex":"@article{Sieger_Heindorf_Blübaum_Ngonga Ngomo_2023, title={Explaining ELH Concept Descriptions through Counterfactual Reasoning}, journal={arXiv:2301.05109}, author={Sieger, Leonie Nora and Heindorf, Stefan and Blübaum, Lukas and Ngonga Ngomo, Axel-Cyrille}, year={2023} }","mla":"Sieger, Leonie Nora, et al. “Explaining ELH Concept Descriptions through Counterfactual Reasoning.” <i>ArXiv:2301.05109</i>, 2023."},"year":"2023"},{"keyword":["sail dice roeder kuchelev ngonga"],"language":[{"iso":"eng"}],"_id":"50797","department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","editor":[{"last_name":"Ortiz-Rodriguez","full_name":"Ortiz-Rodriguez, Fernando","first_name":"Fernando"},{"first_name":"Boris","last_name":"Villazón-Terrazas","full_name":"Villazón-Terrazas, Boris"},{"first_name":"Sanju","last_name":"Tiwari","full_name":"Tiwari, Sanju"},{"full_name":"Bobed, Carlos","last_name":"Bobed","first_name":"Carlos"}],"status":"public","publication":"Knowledge Graphs and Semantic Web","type":"conference","title":"A Topic Model for the Data Web","doi":"10.1007/978-3-031-47745-4_14","publisher":"Springer Nature Switzerland","date_updated":"2024-06-04T09:59:50Z","date_created":"2024-01-23T11:39:58Z","author":[{"full_name":"Röder, Michael","id":"67199","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","first_name":"Michael"},{"first_name":"Denis","last_name":"Kuchelev","id":"70842","full_name":"Kuchelev, Denis"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"year":"2023","place":"Cham","page":"183–198","citation":{"ama":"Röder M, Kuchelev D, Ngonga Ngomo A-C. A Topic Model for the Data Web. In: Ortiz-Rodriguez F, Villazón-Terrazas B, Tiwari S, Bobed C, eds. <i>Knowledge Graphs and Semantic Web</i>. Springer Nature Switzerland; 2023:183–198. doi:<a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">10.1007/978-3-031-47745-4_14</a>","chicago":"Röder, Michael, Denis Kuchelev, and Axel-Cyrille Ngonga Ngomo. “A Topic Model for the Data Web.” In <i>Knowledge Graphs and Semantic Web</i>, edited by Fernando Ortiz-Rodriguez, Boris Villazón-Terrazas, Sanju Tiwari, and Carlos Bobed, 183–198. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">https://doi.org/10.1007/978-3-031-47745-4_14</a>.","ieee":"M. Röder, D. Kuchelev, and A.-C. Ngonga Ngomo, “A Topic Model for the Data Web,” in <i>Knowledge Graphs and Semantic Web</i>, 2023, pp. 183–198, doi: <a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">10.1007/978-3-031-47745-4_14</a>.","mla":"Röder, Michael, et al. “A Topic Model for the Data Web.” <i>Knowledge Graphs and Semantic Web</i>, edited by Fernando Ortiz-Rodriguez et al., Springer Nature Switzerland, 2023, pp. 183–198, doi:<a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">10.1007/978-3-031-47745-4_14</a>.","short":"M. Röder, D. Kuchelev, A.-C. Ngonga Ngomo, in: F. Ortiz-Rodriguez, B. Villazón-Terrazas, S. Tiwari, C. Bobed (Eds.), Knowledge Graphs and Semantic Web, Springer Nature Switzerland, Cham, 2023, pp. 183–198.","bibtex":"@inproceedings{Röder_Kuchelev_Ngonga Ngomo_2023, place={Cham}, title={A Topic Model for the Data Web}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">10.1007/978-3-031-47745-4_14</a>}, booktitle={Knowledge Graphs and Semantic Web}, publisher={Springer Nature Switzerland}, author={Röder, Michael and Kuchelev, Denis and Ngonga Ngomo, Axel-Cyrille}, editor={Ortiz-Rodriguez, Fernando and Villazón-Terrazas, Boris and Tiwari, Sanju and Bobed, Carlos}, year={2023}, pages={183–198} }","apa":"Röder, M., Kuchelev, D., &#38; Ngonga Ngomo, A.-C. (2023). A Topic Model for the Data Web. In F. Ortiz-Rodriguez, B. Villazón-Terrazas, S. Tiwari, &#38; C. Bobed (Eds.), <i>Knowledge Graphs and Semantic Web</i> (pp. 183–198). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-47745-4_14\">https://doi.org/10.1007/978-3-031-47745-4_14</a>"},"publication_identifier":{"isbn":["978-3-031-47745-4"]}},{"year":"2023","citation":{"ama":"Röder M. <i>Automating the Discovery of Linking Candidates</i>. Paderborn University; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1666\">10.17619/UNIPB/1-1666</a>","ieee":"M. Röder, <i>Automating the Discovery of Linking Candidates</i>. Paderborn University, 2023.","chicago":"Röder, Michael. <i>Automating the Discovery of Linking Candidates</i>. Paderborn University, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1666\">https://doi.org/10.17619/UNIPB/1-1666</a>.","apa":"Röder, M. (2023). <i>Automating the Discovery of Linking Candidates</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1666\">https://doi.org/10.17619/UNIPB/1-1666</a>","bibtex":"@book{Röder_2023, title={Automating the Discovery of Linking Candidates}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1666\">10.17619/UNIPB/1-1666</a>}, publisher={Paderborn University}, author={Röder, Michael}, year={2023} }","mla":"Röder, Michael. <i>Automating the Discovery of Linking Candidates</i>. Paderborn University, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1666\">10.17619/UNIPB/1-1666</a>.","short":"M. Röder, Automating the Discovery of Linking Candidates, Paderborn University, 2023."},"publication_status":"published","title":"Automating the Discovery of Linking Candidates","doi":"10.17619/UNIPB/1-1666","publisher":"Paderborn University","date_updated":"2024-06-04T15:28:09Z","supervisor":[{"last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","first_name":"Axel-Cyrille"}],"author":[{"full_name":"Röder, Michael","id":"67199","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","first_name":"Michael"}],"date_created":"2024-06-04T15:26:43Z","status":"public","type":"dissertation","keyword":["dice roeder"],"language":[{"iso":"eng"}],"_id":"54607","user_id":"67199","department":[{"_id":"574"},{"_id":"923"}]},{"_id":"54612","department":[{"_id":"574"},{"_id":"760"}],"user_id":"67199","keyword":["318 SFB-TRR demir dice enexa heindorf knowgraphs kouagou ngonga sail"],"language":[{"iso":"eng"}],"publication":"NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa di Pontignano, Siena, Italy","type":"conference","status":"public","publisher":"CEUR-WS","date_updated":"2024-06-04T15:40:30Z","author":[{"full_name":"KOUAGOU, N'Dah Jean","id":"87189","last_name":"KOUAGOU","first_name":"N'Dah Jean"},{"last_name":"Heindorf","orcid":"0000-0002-4525-6865","full_name":"Heindorf, Stefan","id":"11871","first_name":"Stefan"},{"first_name":"Caglar","last_name":"Demir","id":"43817","full_name":"Demir, Caglar"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_created":"2024-06-04T15:36:52Z","title":"Neural Class Expression Synthesis (Extended Abstract)","year":"2023","citation":{"apa":"KOUAGOU, N. J., Heindorf, S., Demir, C., &#38; Ngonga Ngomo, A.-C. (2023). Neural Class Expression Synthesis (Extended Abstract). <i>NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa Di Pontignano, Siena, Italy</i>.","bibtex":"@inproceedings{KOUAGOU_Heindorf_Demir_Ngonga Ngomo_2023, title={Neural Class Expression Synthesis (Extended Abstract)}, booktitle={NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa di Pontignano, Siena, Italy}, publisher={CEUR-WS}, author={KOUAGOU, N’Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2023} }","mla":"KOUAGOU, N’Dah Jean, et al. “Neural Class Expression Synthesis (Extended Abstract).” <i>NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa Di Pontignano, Siena, Italy</i>, CEUR-WS, 2023.","short":"N.J. KOUAGOU, S. Heindorf, C. Demir, A.-C. Ngonga Ngomo, in: NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa Di Pontignano, Siena, Italy, CEUR-WS, 2023.","chicago":"KOUAGOU, N’Dah Jean, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Neural Class Expression Synthesis (Extended Abstract).” In <i>NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa Di Pontignano, Siena, Italy</i>. CEUR-WS, 2023.","ieee":"N. J. KOUAGOU, S. Heindorf, C. Demir, and A.-C. Ngonga Ngomo, “Neural Class Expression Synthesis (Extended Abstract),” 2023.","ama":"KOUAGOU NJ, Heindorf S, Demir C, Ngonga Ngomo A-C. Neural Class Expression Synthesis (Extended Abstract). In: <i>NeSy 2023, 17th International Workshop on Neural-Symbolic Learning and Reasoning, Certosa Di Pontignano, Siena, Italy</i>. CEUR-WS; 2023."}}]