Loading…
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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Default Text |
Published: |
2006
|
Subjects: | |
Online Access: | https://hdl.handle.net/2134/2332 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1818175296034045952 |
---|---|
author | Yee Chung Cheung Paul Chung Ana Salagean |
author_facet | Yee Chung Cheung Paul Chung Ana Salagean |
author_sort | Yee Chung Cheung (7169237) |
collection | Figshare |
description | 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. |
format | Default Text |
id | rr-article-9403580 |
institution | Loughborough University |
publishDate | 2006 |
record_format | Figshare |
spelling | rr-article-94035802006-01-01T00:00:00Z A set theoretic view of the ISA hierarchy Yee Chung Cheung (7169237) Paul Chung (1250973) Ana Salagean (1257498) Other information and computing sciences not elsewhere classified Fuzzy matching Information retrieval Knowledge representation Information and Computing Sciences not elsewhere classified 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. 2006-01-01T00:00:00Z Text Online resource 2134/2332 https://figshare.com/articles/online_resource/A_set_theoretic_view_of_the_ISA_hierarchy/9403580 CC BY-NC-ND 4.0 |
spellingShingle | Other information and computing sciences not elsewhere classified Fuzzy matching Information retrieval Knowledge representation Information and Computing Sciences not elsewhere classified Yee Chung Cheung Paul Chung Ana Salagean A set theoretic view of the ISA hierarchy |
title | A set theoretic view of the ISA hierarchy |
title_full | A set theoretic view of the ISA hierarchy |
title_fullStr | A set theoretic view of the ISA hierarchy |
title_full_unstemmed | A set theoretic view of the ISA hierarchy |
title_short | A set theoretic view of the ISA hierarchy |
title_sort | set theoretic view of the isa hierarchy |
topic | Other information and computing sciences not elsewhere classified Fuzzy matching Information retrieval Knowledge representation Information and Computing Sciences not elsewhere classified |
url | https://hdl.handle.net/2134/2332 |