Neural Class Expression Synthesis
N'Dah Jean Kouagou, Stefan Heindorf, Caglar Demir, Axel-Cyrille Ngonga, Ngomo

TL;DR
This paper introduces neural class expression synthesizers that translate positive and negative node sets into class expressions, enabling faster and more accurate explainable node classification in knowledge graphs.
Contribution
It proposes a novel translation-based approach to class expression learning, replacing traditional search methods with neural models like LSTMs, GRUs, and set transformers.
Findings
Synthesizes high-quality class expressions in about one second.
Achieves better F-measures than state-of-the-art on large datasets.
Effective on four benchmark datasets.
Abstract
Many applications require explainable node classification in knowledge graphs. Towards this end, a popular ``white-box'' approach is class expression learning: Given sets of positive and negative nodes, class expressions in description logics are learned that separate positive from negative nodes. Most existing approaches are search-based approaches generating many candidate class expressions and selecting the best one. However, they often take a long time to find suitable class expressions. In this paper, we cast class expression learning as a translation problem and propose a new family of class expression learning approaches which we dub neural class expression synthesizers. Training examples are ``translated'' into class expressions in a fashion akin to machine translation. Consequently, our synthesizers are not subject to the runtime limitations of search-based approaches. We study…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Adversarial Robustness in Machine Learning · Software Engineering Research
