A set theoretic view of the ISA hierarchy

Authors:
Yee Chung Cheung;Paul Wai Hing Chung;Ana Sălăgean
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, UK;Department of Computer Science, Loughborough University, Loughborough, UK;Department of Computer Science, Loughborough University, Loughborough, UK
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 3
Cited 0

Word sense disambiguation for free-text indexing using a massive semantic network

CIKM '93 Proceedings of the second international conference on Information and knowledge management
A Fuzzy Approach to Accessing Accident Databases

Applied Intelligence
Word sense disambiguation using Conceptual Density

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.