A set theoretic view of the ISA hierarchy

The ISA (is-a) hierarchies are widely used in the classification and the representation of related objects. In terms of assessing similarity between two nodes, current distance approaches suffer from its nature that only parent-child relationships among nodes are captured in the hierarchy. This pape...

Full description

Saved in:
Bibliographic Details
Main Authors: Yee Chung Cheung, Paul Chung, Ana Salagean
Format: Default Text
Published: 2006
Subjects:
Other information and computing sciences not elsewhere classified
Fuzzy matching
Information retrieval
Knowledge representation
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2332
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The ISA (is-a) hierarchies are widely used in the classification and the representation of related objects. In terms of assessing similarity between two nodes, current distance approaches suffer from its nature that only parent-child relationships among nodes are captured in the hierarchy. This paper presents an idea of treating a hierarchy as a set rather than as a tree in the traditional view. The established set theory is applied to provide the foundation where the relations between nodes can be mathematically specified and results in a more powerful and logical assessment of similarity between nodes.

Similar Items