Premium
An algorithm for modelling key terms
Author(s) -
Cai D.,
van Rijsbergen C. J.
Publication year - 2008
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20251
Subject(s) - discernment , key (lock) , frame (networking) , computer science , representation (politics) , thesaurus , set (abstract data type) , information retrieval , semantics (computer science) , focus (optics) , theoretical computer science , algorithm , artificial intelligence , epistemology , computer security , telecommunications , philosophy , physics , optics , politics , political science , law , programming language
The ability to formally analyse and represent semantic relations of terms is a major challenge for many areas of computing science and an intriguing problem for other sciences. In applications of evidence theory to, for instance, information retrieval, the problem of analysis and representation becomes apparent because evidence theory is based on set theory and individual key terms have to be modelled as subsets of the frame of discernment. How to find the frame and model the key terms is a challenge. The problem leads to other practical problems, as pointed out repeatedly in the literature. In this study, we focus on such a problem, present a method for simplifying and normalizing a thesaurus, and propose an algorithm for establishing the frame of discernment and for modelling individual key terms as a subset of the frame. The key aim of this study is to treat semantic relations of terms by means of a normalized thesaurus. © 2008 Wiley Periodicals, Inc.