Skip to main content

DLFoil: Class Expression Learning Revisited

  • Conference paper
  • First Online:
Knowledge Engineering and Knowledge Management (EKAW 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11313))

Included in the following conference series:

Abstract

The paper presents the ultimate version of a concept learning system which can support typical ontology construction/evolution tasks through the induction of class expressions from groups of individual resources labeled by a domain expert. Stating the target task as a search problem, a Foil-like algorithm was devised based on the employment of refinement operators to traverse the version-space of candidate definitions for the target class. The algorithm has been further enhanced including a more general definition for the scoring function and better refinement operators. An experimental evaluation of the resulting new release of DL-Foil, which implements these improvements was carried out to assess its performance also in comparison with other concept learning systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A space endowed with a quasi-ordering, i.e. a reflexive and transitive relationship.

  2. 2.

    This may be considered a basic upper refinement operator allowed by expressive DL languages (encompassing \(\mathcal {ALC}\)).

  3. 3.

    An acyclic TBox does not contains multiple definitions for a concept name and such a concept is not used to the right-side of an equivalence axiom.

  4. 4.

    The source code and the datasets/ontologies are publicly available at: https://bitbucket.org/grizzo001/dl-foil/src/master/.

  5. 5.

    Assessed by JFact reasoner: http://jfact.sourceforge.net/.

  6. 6.

    The experiments were carried out on a 8-core Ubuntu server with 16 GB RAM.

  7. 7.

    spark.apache.org.

References

  1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, New York (2003)

    MATH  Google Scholar 

  2. Badea, L., Nienhuys-Cheng, S.-H.: A refinement operator for description logics. In: Cussens, J., Frisch, A. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40–59. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44960-4_3

    Chapter  Google Scholar 

  3. Bühmann, L., Lehmann, J., Westphal, P.: DL-Learner - a framework for inductive learning on the Semantic Web. J. Web Sem. 39, 15–24 (2016)

    Article  Google Scholar 

  4. Chapelle, O., Schlkopf, B., Zien, A.: Semi-Supervised Learning. MIT Press, Cambridge (2010)

    Google Scholar 

  5. Cimiano, P., Mädche, A., Staab, S., Völker, J.: Ontology learning. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies, pp. 245–267. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-24750-0_9

    Chapter  Google Scholar 

  6. De Raedt, L.: Logical and Relational Learning. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68856-3

    Book  MATH  Google Scholar 

  7. Fanizzi, N., d’Amato, C., Esposito, F.: DL-FOIL concept learning in description logics. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 107–121. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85928-4_12

    Chapter  Google Scholar 

  8. Fanizzi, N., d’Amato, C., Esposito, F.: Induction of concepts in web ontologies through terminological decision trees. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010, part I. LNCS (LNAI), vol. 6321, pp. 442–457. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15880-3_34

    Chapter  Google Scholar 

  9. Fanizzi, N.: Concept induction in Description Logics using information-theoretic heuristics. Int. J. Semantic Web Inf. Syst. 7(2), 23–44 (2011)

    Article  Google Scholar 

  10. Heath, T., Bizer, C.: Linked Data: Evolving the Web into a Global Data Space. Morgan & Claypool, Palo Alto (2011)

    Google Scholar 

  11. Iannone, L., Palmisano, I., Fanizzi, N.: An algorithm based on counterfactuals for concept learning in the Semantic Web. Appl. Intell. 26(2), 139–159 (2007)

    Article  Google Scholar 

  12. Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 161–174. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78469-2_18

    Chapter  Google Scholar 

  13. Lehmann, J., Hitzler, P.: A refinement operator based learning algorithm for the \(\cal{ALC}\) description logic. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS, vol. 4894, pp. 147–160. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78469-2_17

    Chapter  MATH  Google Scholar 

  14. Lehmann, J., Hitzler, P.: Concept learning in description logics using refinement operators. Mach. Learn. 78(1–2), 203–250 (2010)

    Article  MathSciNet  Google Scholar 

  15. Lehmann, J., Auer, S., Bühmann, L., Tramp, S.: Class expression learning for ontology engineering. J. Web Semant. 9, 71–81 (2011)

    Article  Google Scholar 

  16. Nguyen, L.A., Szalas, A.: Logic-based roughification. In: Skowron, A., Suraj, Z. (eds.) Rough Sets and Intelligent Systems (1). Intelligent Systems Reference Library, vol. 42, pp. 517–543. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-30344-9_19. Chap. 19

    Chapter  Google Scholar 

  17. Rizzo, G., Fanizzi, N., Lehmann, J., Bühmann, L.: Integrating new refinement operators in terminological decision trees learning. In: Blomqvist, E., Ciancarini, P., Poggi, F., Vitali, F. (eds.) EKAW 2016. LNCS, vol. 10024, pp. 511–526. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49004-5_33

    Chapter  Google Scholar 

  18. Tran, A.C., Dietrich, J., Guesgen, H.W., Marsland, S.: An approach to parallel class expression learning. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 302–316. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32689-9_25

    Chapter  Google Scholar 

  19. Tran, A.C., Dietrich, J., Guesgen, H.W., Marsland, S.: Parallel symmetric class expression learning. J. Mach. Learn. Res. 18, 64:1–64:34 (2017)

    Google Scholar 

  20. Tran, T., Ha, Q., Hoang, T., Nguyen, L.A., Nguyen, H.S.: Bisimulation-based concept learning in description logics. Fundam. Inform. 133(2–3), 287–303 (2014)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giuseppe Rizzo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fanizzi, N., Rizzo, G., d’Amato, C., Esposito, F. (2018). DLFoil: Class Expression Learning Revisited. In: Faron Zucker, C., Ghidini, C., Napoli, A., Toussaint, Y. (eds) Knowledge Engineering and Knowledge Management. EKAW 2018. Lecture Notes in Computer Science(), vol 11313. Springer, Cham. https://doi.org/10.1007/978-3-030-03667-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03667-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03666-9

  • Online ISBN: 978-3-030-03667-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics