Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Frequent pattern discovery from OWL DLP knowledge bases

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

EN The Semantic Web technology should enable publishing of numerous resources of scientific and other, highly formalized data on the Web. The application of mining these huge, networked Web repositories seems interesting and challenging. In this paper we present and discuss an inductive reasoning procedure for mining frequent patterns from the knowledge bases represented in OWL DLP. OWL DLP, also known as Description Logic Programs, lies at the intersection of the expressivity of OWL DL and Logic Programming. Our method is based on a special trie data structure inspired by similar, efficient structures used in classical and relational data mining settings. Conjunctive queries to OWL DLP knowledge bases are the language of frequent patterns.

Pages (from - to)

287 - 302

DOI

10.1007/11891451_26

URL

https://link.springer.com/chapter/10.1007/11891451_26

Book

Managing Knowledge in a World of Networks : 15th International Conference, EKAW 2006, Poděbrady, Czech Republic, October 2-6, 2006. Proceedings

Presented on

15th International Conference on Knowledge Engineering and Knowledge Management : Managing Knowledge in a World of Networks, EKAW 2006, 2-6.10.2006, Podebrady, Czech Republic

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.