no code implementations • 3 Jun 2015 • Xinhua Zhu, Fei Li, Hongchao Chen, Qi Peng
Therefore, in order to solve the problem of non-uniformity of concept density in a large taxonomic ontology, we propose a new path computing model based on the compensation of local area density of concepts, which is equal to the number of direct hyponyms of the subsumers of concepts in their shortest path.