Faster frequent pattern mining from the semantic web
[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] pracownik
2006
referat
angielski
EN In this paper we propose a method for frequent pattern discovery from the knowledge bases represented in OWL DLP. OWL DLP, known also as Description Logic Programs, is the intersection of the expressivity of OWL DL and Logic Programming. Our method is based on a special form of a trie data structure. A similar structure was used for frequent pattern discovery in classical and relational data mining settings giving significant gain in efficiency. Our approach is illustrated on the example ontology.
121 - 130