Concept learning in description logics using refinement operators
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Foundations of Inductive Logic Programming
Nienhuys-Cheng, S.-H., & Wolf, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62927-0 · Cited by 471
Cited by
Knowledge graph refinement: A survey of approaches and evaluation methods
Paulheim, H. (2016) · Semantic Web · doi:10.3233/sw-160218 · Cited by 849
A historical perspective of explainable Artificial Intelligence
Confalonieri, R., Coba, L., Wagner, B., & Besold, T. R. (2021) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1391 · Cited by 383
Neural-symbolic integration and the Semantic Web
Hitzler, P., Bianchi, F., Ebrahimi, M., & Sarker, M. K. (2020) · Semantic Web · doi:10.3233/sw-190368 · Cited by 70
“[57] provides a feasibility study on how domain ontologies together with description logic based concept induction [37,56] can be used to explain input output behaviour of trained deep neural networks.”
BackgroundSelf-citationWidmer, C. L., Sarker, M. K., Nadella, S., Fiechter, J., Juvina, I., Minnery, B., Hitzler, P., Schwartz, J., & Raymer, M. (2023) · Journal of Web Semantics · doi:10.1016/j.websem.2023.100807 · Cited by 10
Self-citation
Metadata
- Authors
- Lehmann, J., & Hitzler, P.
- Venue
- Machine Learning
- Published
- 2009-09-16
- Volume
- 78
- Issue
- 1-2
- Pages
- 203-250
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2163866595
- Cited by
- 194
- References
- 2
- FWCI
- 11.57
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.