Abstract
In view of the fact that were multiple paths between two domain ontology concepts and the traditional method for similarity computation only considered its most shortest path, this paper proposes an improved method for similarity computation of concepts in domain ontology, it considers all effective paths between two domain ontology concepts and the depth information of correspondent common father node. The experimental result indicates that this method can manifest the similar degree of two ontology concepts accurately.
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.
