Abstract
As a computational tool, ontology has wide applications in information retrieval and other disciplines. Ontology concept similarity calculation is an essential problem in these applications. In this paper, the focus is on the ontology setting such that the ontology function maps every vertex in graph into a real value. And the similarity between vertices is measured by the difference of their corresponding scores. We propose the gradient descent ontology algorithm for this setting, and the learning rates with general convex losses are determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
