本体已经在很多的领域中得到了广泛的应用,网络上的本体也越来越多,为了节约本体构建的成本避免从头构建本体,人们经常首先从网络上获取候选者,然后再以此为基础构建自己的本体.而随之而来的本体排序问题则成为一个研究热点.通过对现有本体排序算法的总结与分析,将现有本体排序算法划分为两大类,分别阐述了其基本思想以及存在的问题.然后,提出了一种经过改进的本体排序方法,该方法结合了原有方法的优点并提高了本体搜索的质量.最后讨论了未来研究的方向和注意事项.
Using domain ontologies to represent knowledge has shown to be a useful mechanism and the format for managing and exchanging information.Ontologies are the backbone of knowledge representation for the semantic Web.Now,there are so many ontologies on the Internet.Due to the cost and the difficulty of building ontologies,a number of ontology libraries and search engines are emerging to facilitate reusing such knowledge structures.For reducing the cost of building ontology,people always search some candidates from the Internet firstly,and then integrate and refine these candidates to establish their own ontology.But,there are so many candidates that could be found,so the ontology ranking technique is becoming a hot research topic.This paper categorizes the existing ontology ranking methods into two types,and analyzes their characteristics.Then a new ontology ranking method is introduced,which combines the merits of existing algorithms together to improve the experience of ontology searching.It improves the AKTiveRank by selecting a new factor CIM to replace the factor CEM of AKTiveRank.The CIM is a measure to evaluate the importance of one concept in ontology.Finally,two experiments are designed to prove the efficiency of MIDSRank algorithm.The results show that the new method is more efficient.