Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6941171 | Pattern Recognition Letters | 2015 | 10 Pages |
Abstract
Pairwise generalized association rules mined from raw data can be used to connect the concepts of multiple ontologies. In this case the items of rules are hierarchically organized and one can use the relations between them in order to reduce rule redundancy. Recently proposed hierarchical interestingness measures address this issue, taking hierarchical information on the antecedent side into account. In this paper, we extend them to the case of considering two hierarchies on both the antecedent and the consequent sides of a rule. The extended measures are then compared with their counterparts as well as with conventional ones. Three real world datasets from the text mining domain with predefined ground truth sets of associations are used for comparison within the framework of instance-based ontology mapping.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Fernando Benites, Elena Sapozhnikova,