Mining ℰℒ⊥ Bases with Adaptable Role Depth

DOI10.1613/JAIR.1.13777arXiv2102.10689MaRDI QIDQ6135964FDOQ6135964

Author name not available (Why is that?), Barış Sertkaya, Ana Ozaki, Ricardo Guimarães

Publication date: 28 August 2023

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Abstract: In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base consists of a set of concept inclusions instead of implications. In this setting, concept expressions can be arbitrarily large. Thus, it is not clear whether a finite base exists and, if so, how large concept expressions may need to be. We first revisit results in the literature for mining EL bases from finite interpretations. Those mainly focus on finding a finite base or on fixing the role depth but potentially losing some of the valid concept inclusions with higher role depth. We then present a new strategy for mining EL bases which is adaptable in the sense that it can bound the role depth of concepts depending on the local structure of the interpretation. Our strategy guarantees to capture all EL concept inclusions holding in the interpretation, not only the ones up to a fixed role depth.

Full work available at URL: https://arxiv.org/abs/2102.10689

Recommendations

• Modeling role mining using integer linear programming
• Toward edge minability for role mining in bipartite networks
• Recursive data mining for role identification in electronic communications

zbMATH Keywords

description logicsknowledge representationrule learningknowledge graphs

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• On generating all maximal independent sets
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Title not available (Why is that?)
• Computing premises of a minimal cover of functional dependencies is intractable
• Title not available (Why is that?)
• Concept learning in description logics using refinement operators
• Conceptual Structures at Work
• DL-learner: learning concepts in description logics
• DL-FOIL Concept Learning in Description Logics
• Title not available (Why is that?)
• Two Basic Algorithms in Concept Analysis
• Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis
• Horn approximations of empirical data
• Some Computational Problems Related to Pseudo-intents
• On the intractability of computing the Duquenne-Guigues base
• On the complexity of enumerating pseudo-intents
• Attribute-incremental construction of the canonical implication basis
• An Introduction to Description Logic
• Finding a minimum equivalent graph of a digraph
• Title not available (Why is that?)
• Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \)
• Title not available (Why is that?)
• Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$
• Axiomatisation of general concept inclusions from finite interpretations
• A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
• Learning description logic axioms from discrete probability distributions over description graphs
• Ontology Learning from Interpretations in Lightweight Description Logics
• Title not available (Why is that?)

This page was built for publication: Mining ℰℒ⊥ Bases with Adaptable Role Depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135964)