| ¡¡ | Chinese Journal of Computers Full Text |
| Title | Ranking by Mutually Reinforcing Concepts and Relations in Ontology |
| Authors | WU Gang ZHANG Kuo LI Juan-Zi WANG Ke-Hong |
| Address | (Knowledge Engineering Group, Department of Computer Science and Technology, Tsinghua University, Beijing 100084) |
| Year | 2007 |
| Issue | No.9(1490¡ª1499) |
| Abstract & Background | Abstract Ranking the importance of concepts and the weights of relations is an effective method for evaluating an ontology, which can improve the design of ontology for domain expert, and be used as a component of semantic Web search engine. Current link analysis ranking algorithms cannot be directly applied to rank concepts, or efficiently to assign weights to relations. According to the characteristic of ontology graph structure, an algorithm is proposed with Hub rating instead of Authority rating as importance of concepts. The algorithm mutually reinforces importance of concepts and weights of relations in the iteration process which is proved to converge to the fixpoint of equations. The experimental results show the algorithm has the similar convergence speed to PageRank but more reasonable ranking of concepts importance and relations weights. keywords ontology; semantic Web; ranking; link analysis; convergence background This paper disscusses the importance of concepts and relations ranking in the field of the ontology evaluation. To the best of our knowledge, there is no specialized evaluation approach proposed for ranking the importance of concepts and relations. This paper attributes to the project SWARMS (Semantic Web Aiding Rich Mining System), which is supported by the National Natural Science Foundation of China (NSFC) under grant No.90604025. The project mainly aims to study the information extraction, ontology annotation, ontology matching, data management of semantic Web, and data mining on semantic Web. The website of the project is http://keg.cs.tsinghua.edu.cn/project/pswmp.htm. There are several publications in this project published on AAAI 2005 Workshop, WWW 2005 Poster track, APWEB 2006 and ASWC 2006 Demo Track. |