Piecewise function approximation and vertex partitioning schemes for multi-dividing ontology algorithm in AUC criterion setting (I) Online publication date: Sat, 07-Feb-2015
by Wei Gao; Li Yan; Li Liang
International Journal of Computer Applications in Technology (IJCAT), Vol. 50, No. 3/4, 2014
Abstract: Ontology is a useful tool with wide applications in various fields and attracts widespread attention of scholars, and ontology concept similarity calculation is an essential problem in these application algorithms. An effective method to get similarity between vertices on ontology is based on a function, which maps ontology graph into a line and maps each vertex in graph into a real-value, and the similarity is measured by the difference of their corresponding scores. The area under the receiver operating characteristics curve (AUC) criterion multi-dividing method is suitable for ontology problem. In this paper, we present piecewise constant function approximation approach for AUC criterion multi-dividing ontology algorithm and focus on vertex partitioning schemes. Using the techniques of statistical learning theory, theoretical characteristics of the approximation algorithm are provided with partitioning schemes, and a splitting rule is designed for vertex partitioning.
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 Computer Applications in Technology (IJCAT):
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