Abstract
In the work of Baader and Distel, a method has been proposed to axiomatize all general concept inclusions (GCIs) expressible in the description logic \(\mathcal{EL}^\bot\) and valid in a given interpretation \(\mathcal{I}\). This provides us with an effective method to learn \(\mathcal{EL}^\bot\)-ontologies from interpretations. In this work, we want to extend this approach in the direction of handling errors, which might be present in the data-set. We shall do so by not only considering valid GCIs but also those whose confidence is above a given threshold c. We shall give the necessary definitions and show some first results on the axiomatization of all GCIs with confidence at least c. Finally, we shall provide some experimental evidence based on real-world data that supports our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)
Baader, F., Distel, F.: A Finite Basis for the Set of \(\mathcal{EL}\)-Implications Holding in a Finite Model. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 46–61. Springer, Heidelberg (2008)
Bizer, C., Heath, T., Berners-Lee, T.: Linked Data - The Story So Far. International Journal on Semantic Web and Information Systems (IJSWIS) 5(3), 1–22 (2009)
Bizer, C., Lehmann, J., Kobilarov, G., Auer, S., Becker, C., Cyganiak, R., Hellmann, S.: DBpedia - A Crystallization Point of the Web of Data. Web Semantics: Science, Services and Agents on the World Wide Web 7(3), 154–165 (2009)
Borchmann, D.: Axiomatizing Confident \(\mathcal{EL}_\text{gfp}^\bot\)-GCIs of Finite Interpretations. Report MATH-AL-08-2012, Chair of Algebraic Structure Theory, Institute of Algebra, Technische Universität Dresden, Germany (September 2012)
Borchmann, D.: On Confident GCIs of Finite Interpretations. LTCS-Report 12-06, Institute for Theoretical Computer Science, TU Dresden (2012), http://lat.inf.tu-dresden.de/research/reports.html
Borchmann, D., Distel, F.: Mining of \(\mathcal{EL}\)-GCIs. In: Spiliopoulou, M., Wang, H., Cook, D.J., Pei, J., Wang, W., Zaïane, O.R., Wu, X. (eds.) ICDM Workshops, pp. 1083–1090. IEEE (2011)
Distel, F.: Learning Description Logic Knowledge Bases from Data Using Methods from Formal Concept Analysis. PhD thesis, TU Dresden (2011)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Luxenburger, M.: Partial implications. FB4-Preprint, TH Darmstadt (1994)
Luxenburger, M.: Implikationen, Abhängigkeiten und Galois-Abbildungen. PhD thesis, TH Darmstadt (1993)
Nebel, B.: Terminological Cycles: Semantics and Computational Properties. In: Principles of Semantic Networks, pp. 331–362. Morgan Kaufmann (1991)
Price, C., Spackman, K.: SNOMED Clinical Terms. British Journal of Healtcare Computing and Information Management 17, 27–31 (2000)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335–350. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borchmann, D. (2013). Towards an Error-Tolerant Construction of \(\mathcal{EL}^\bot\)-Ontologies from Data Using Formal Concept Analysis. In: Cellier, P., Distel, F., Ganter, B. (eds) Formal Concept Analysis. ICFCA 2013. Lecture Notes in Computer Science(), vol 7880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38317-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-38317-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38316-8
Online ISBN: 978-3-642-38317-5
eBook Packages: Computer ScienceComputer Science (R0)