Skip to main content

Knowledge-Intensive Induction of Terminologies from Metadata

  • Conference paper
The Semantic Web – ISWC 2004 (ISWC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3298))

Included in the following conference series:

Abstract

We focus on the induction and revision of terminologies from metadata. Following a Machine Learning approach, this setting can be cast as a search problem to be solved employing operators that traverse the search space expressed in a structural representation, aiming at correct concept definitions. The progressive refinement of such definitions in a terminology is driven by the available extensional knowledge (metadata). A knowledge-intensive inductive approach to this task is presented, that can deal with on the expressive Semantic Web representations based on Description Logics, which are endowed with well-founded reasoning capabilities. The core inferential mechanism, based on multilevel counterfactuals, can be used for either inducing new concept descriptions or refining existing (incorrect) ones. The soundness of the approach and its applicability are also proved and discussed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. Haussler, D.: Learning conjuntive concepts in structural domains. Machine Learning 4, 7–40 (1989)

    Google Scholar 

  3. Nienhuys-Cheng, S., Laer, W.V., Ramon, J., Raedt, L.D.: Generalizing refinement operators to learn prenex conjunctive normal forms. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 245–256. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Rouveirol, C., Ventos, V.: Towards learning in CARIN-ALN. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 191–208. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Kietz, J.U.: Learnability of description logic programs. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 117–132. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Cohen, W., Hirsh, H.: Learning the CLASSIC description logic. In: Torasso, P., Doyle, J., Sandewall, E. (eds.) Proceedings of the 4th International Conference on the Principles of Knowledge Representation and Reasoning, pp. 121–133. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  7. Baader, F., Turhan, A.Y.: TBoxes do not yield a compact representation of least common subsumers. In: Working Notes of the International Description Logics Workshop, Stanford, USA. CEUR Workshop Proceedings, vol. 49 (2001)

    Google Scholar 

  8. Kietz, J.U., Morik, K.: A polynomial approach to the constructive induction of structural knowledge. Machine Learning 14, 193–218 (1994)

    Article  MATH  Google Scholar 

  9. Badea, L., Nienhuys-Cheng, S.H.: A refinement operator for description logics. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40–59. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Vere, S.: Multilevel counterfactuals for generalizations of relational concepts and productions. Artificial Intelligence 14, 139–164 (1980)

    Article  MATH  Google Scholar 

  11. Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48, 1–26 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  12. Brandt, S., Küsters, R., Turhan, A.Y.: Approximation and difference in description logics. In: Fensel, D., Giunchiglia, F., McGuinness, D., Williams, M.A. (eds.) Proceedings of the International Conference on Knowledge Representation, pp. 203–214. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  13. Nebel, B.: Reasoning and Revision in Hybrid Representation Systems. In: Nebel, B. (ed.) Reasoning and Revision in Hybrid Representation Systems. LNCS, vol. 422, Springer, Heidelberg (1990)

    Google Scholar 

  14. Teege, G.: A subtraction operation for description logics. In: Torasso, P., Doyle, J., Sandewall, E. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, pp. 540–550. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  15. Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Induction and revision of terminologies. In: de Mataras, R.L., Saitta, L. (eds.) Proceedings of the 16th European Conference on Artificial Intelligence, pp. 1007–1008. IOS Press, Amsterdam (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G. (2004). Knowledge-Intensive Induction of Terminologies from Metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds) The Semantic Web – ISWC 2004. ISWC 2004. Lecture Notes in Computer Science, vol 3298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30475-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30475-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23798-3

  • Online ISBN: 978-3-540-30475-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics