Statistical characteristics for multi-dividing ontology algorithm in AUC criterion setting Online publication date: Tue, 21-Jun-2016
by Yun Gao; Linli Zhu; Wei Gao
International Journal of Collaborative Intelligence (IJCI), Vol. 1, No. 3, 2016
Abstract: The architecture model of ontology has been extensively applied in many fields including computer science and information technology. The key purpose of using ontology is to compute the similarity among the vertices in the ontology graph. The scientific method of multi-dividing technology can accurately draw the ontology graph into real line and measure the similarity among different vertices on the basis of the difference of equivalent real numbers. This paper explores the theoretical problem of multi-dividing ontology algorithm in AUC criterion setting. The approximation characters and the generalised error of best ontology score function among piece constant ontology score functions are presented. Also, the rate bound for the best ontology function under penalised empirical AUC criterion is given. The results we got in the paper illustrate the promising application prospects for multi-dividing ontology algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Collaborative Intelligence (IJCI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook