By Topic

The computation of concept similarity based on PSO algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jia Liu ; Sch. of Inf. Sci. & Eng., Shandong Normal Univ., Ji Nan, China ; HuaYu Wang

Ontology heterogeneity restricts the application of ontology. The key of ontology mapping is to compute concept similarity. At present, the method of similarity computation is imperfect. And the computation quantity is high. In order to decrease computation quantity and completely compute concept similarity, the influences of relations and attributes is considered and use candidate set. In this paper, a computation method of similarity based on PSO algorithm is proposed. At first, the semantic similarity and descriptive similarity of concepts are computed. Then the attribute priority is specified by PSO algorithm. At last, the attribute with high priority is chosen according to the user need. Take two ontologies as example and compute concept similarity. Experiments results show that this calculative method can improve the precision of similarity and reduce the calculated quantity.

Published in:

Information and Financial Engineering (ICIFE), 2010 2nd IEEE International Conference on

Date of Conference:

17-19 Sept. 2010