Identifying potentially user-interested concepts in an ontology

Author

Chen, Yixi ; Yang, Xiaohu ; Yin, Keting

Author_Institution

Coll. of Comput. Sci. & Technol., Zhejiang Univ., Hangzhou, China

Volume

1

fYear

2009

fDate

28-29 Nov. 2009

Firstpage

198

Lastpage

201

Abstract

Finding the user-interested concepts of a large ontology is an important problem in Ontology analysis and reusing. A set of ranked concepts of an Ontology, which are ordered by the potential degree-of-interest, can help person find out the expected concepts, especially when the target Ontology is complex and large. In this paper we present a concept ranking algorithm for OWL (Web Ontology Language) Ontologies. This algorithm is based on the ontological structure and degree-of-interest calculation. Different from the other ranking methods, it let user participate into the ranking process. Such an approach considers both the preference of a person and the graphical structure of the Ontology. The experimental results show that it can give comfortable ranking based on users´ tasks and needs.

Keywords

knowledge representation languages; ontologies (artificial intelligence); Web ontology language; degree-of-interest calculation; ontological structure; ontology analysis; ontology graphical structure; ontology reusing; ontology user interested concepts; Application software; Computational intelligence; Computer industry; Iterative algorithms; Large-scale systems; OWL; Ontologies; Semantic Web; Tree graphs; Visualization; concepts ranking; degree-of-interest; ontology; ontology graph;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4606-3

Type

conf

DOI

10.1109/PACIIA.2009.5406457

Filename

5406457