Abstract
Semantic similarity computation is of great importance in many applications such as natural language processing, knowledge acquisition and information retrieval. In recent years, many concept similarity measures have been developed for ontology and lexical taxonomy. Generally speaking, ontology concepts semantic similarity computation is tedious and time-consuming. This paper puts forward an optimization algorithm to simplify semantic similarity computation. The optimization algorithm utilizes hierarchical relationship between concepts to simplify similarity computation process. Simulation experiments showed the optimization algorithm could make similarity computation simple and convenient, and similarity computation speed was improved by one time. The more complexity an ontology structure, and the bigger the maximum depth of ontology, the more significantly the performance improved.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Hybrid Information Technology
Disclaimer: 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.
