Association rule ontology matching approach

被引：29

作者：

David, Jerome ^{[1
]}

Guillet, Fabrice ^{[1
]}

Briand, Henri ^{[1
]}

机构：

[1] Univ Nantes, Polytech Grad Sch, F-44035 Nantes, France

来源：

INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS | 2007年 / 3卷 / 02期

关键词：

data mining; hierarchical model; knowledge discovery; ontologies; semantic matching;

D O I：

10.4018/jswis.2007040102

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This article presents, a hybrid, extensional and asymmetric matching approach designed to find out relations (equivalence and subsumption) between two textual hierarchies. By using the association rule paradigm and a statistical measure, this method relies on the following idea: "An entity A will be more specific than or equivalent to an entity B if the vocabulary used to describe A and its instances tends to be included in that of B and its instances". This approach is divided into two parts: (1) The representation of each entity by a set of relevant terms and data; (2) The discovery of binary association rules between entities. The selection of rules uses two criteria for assessing the implication quality and reducing redundancy. The method is evaluated on two benchmarks. The first contains two hierarchies indexing textual documents and the second one is composed of OWL ontologies.

引用

页码：27 / 49

页数：23