Abstract
With the proliferation of sensors, semantic web technologies are becoming closely related to sensor network. The linking of elements from semantic web technologies with sensor networks is called semantic sensor web whose main feature is the use of sensor ontologies. However, due to the subjectivity of different sensor ontology designer, different sensor ontologies may define the same entities with different names or in different ways, raising so-called sensor ontology heterogeneity problem. There are many application scenarios where solving the problem of semantic heterogeneity may have a big impact, and it is urgent to provide techniques to enable the processing, interpretation and sharing of data from sensor web whose information is organized into different ontological schemes. Although sensor ontology heterogeneity problem can be effectively solved by Evolutionary Algorithm (EA)-based ontology meta-matching technologies, the drawbacks of traditional EA, such as premature convergence and long runtime, seriously hamper them from being applied in the practical dynamic applications. To solve this problem, we propose a novel Compact Co-Evolutionary Algorithm (CCEA) to improve the ontology alignment’s quality and reduce the runtime consumption. In particular, CCEA works with one better probability vector (PV) \(PV_{better}\) and one worse PV \(PV_{worse}\), where \(PV_{better}\) mainly focuses on the exploitation which dedicates to increase the speed of the convergence and \(PV_{worse}\) pays more attention to the exploration which aims at preventing the premature convergence. In the experiment, we use Ontology Alignment Evaluation Initiative (OAEI) test cases and two pairs of real sensor ontologies to test the performance of our approach. The experimental results show that CCEA-based ontology matching approach is both effective and efficient when matching ontologies with various scales and under different heterogeneous situations, and compared with the state-of-the-art sensor ontology matching systems, CCEA-based ontology matching approach can significantly improve the ontology alignment’s quality.
Similar content being viewed by others
References
Acampora G, Loia V, Vitiello A (2013) Enhancing ontology alignment through a memetic aggregation of similarity measures. Inf Sci 250:1–20
Ahn CW, Ramakrishna RS (2003) Elitism based compact genetic algorithms. IEEE Trans Evolut Comput 7(4):367–385
Baraglia R, Hidalgo JI, Perego R (2001) A hybrid heuristic for the traveling salesman problem. IEEE Trans Evolut Comput 5(6):613–622
Bock J, Hettenhausen J (2012) Discrete particle swarm optimisation for ontology alignment. Inf Sci 192:152–173
Mu CH, Jiao LC, Liu Y (2009) M-elite coevolutionary algorithm for numerical optimization. J Softw 20(11):2925–2938
Dragisic Z, Eckert K, Euzenat J et al (2014) Results of the ontology alignment evaluation initiative 2014. In: Proceedings of the 9th international conference on ontology matching, vol 1317, Trentino, Italy, pp 61–104
Ehrlich PR, Raven PH (1964) Butterflies and plants: a study in coevolution. Evolution 18(4):586–608
Fernandez S, Marsa-Maestre I, Velasco JR, Alarcos B (2013) Ontology alignment architecture for semantic sensor web integration. Sensors 13(9):12581–12604
Stoilos G, Stamou G, Kollias S (2005) A string metric for ontology alignment. In: Proceedings of 4th international semantic web conference (ISWC 2005), Galway, Ireland, pp 623–637
Ginsca A-L, Iftene A (2010) Using a genetic algorithm for optimizing the similarity aggregation step in the process of ontology alignment. In: 9th Roedunet international conference, Sibiu, Romania, pp 118–122
Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evolut Comput 3(4):287–297
Jean-Mary YR, Shironoshita EP, Kabuka MR (2009) Ontology matching with semantic verification. Web Semant Sci Serv Agents World Wide Web 7(3):235–251
Tan KC, Yang YJ, Goh CK (2006) A distributed cooperative coevolutionary algorithm for multiobjective optimization. IEEE Trans Evolut Comput 10(5):527–549
Martinez-Gil J, Alba E, Montes J (2008) Optimizing ontology alignments by using genetic algorithms. In: Proceedings of the workshop on nature based reasoning for the semantic web, vol 419. Karlsruhe, Germany, pp 31–45
Martinez-Gil J, Montes JFA (2011) Evaluation of two heuristic approaches to solve the ontology meta-matching problem. Knowl Inf Syst 26(2):225–247
Miller GA (1995) Wordnet: a lexical database for english. Commun ACM 38(11):39–41
Naya JMV, Romero MM, Loureiro JP (2010) Improving ontology alignment through genetic algorithms, Information science reference. Hershey, New York, pp 240–259
Neri F, Iacca G, Mininno E (2013) Compact optimization, vol 38. Springer, Berlin, pp 337–364
Neri F, Mininno E, Karkkainen T (2010) Noise analysis compact genetic algorithm, vol 6024. Springer, Berlin, pp 602–611
Noessner J, Niepert M, Meilicke C, Stuckenschmidt H (2010) Leveraging terminological structure for object reconciliation. In: Extended semantic web conference. Springer, pp 334–348
Rijsberge CJV (1975) Information retrieval. University of Glasgow, Butterworth, London
Melnik S, Garcia-Molina H, Rahm E (2002) Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: 18th International conference on data engineering, Shanghai, China, pp 117–182
Wang X, Liu Q, Fu Q, Zhang L (2012) Double elite coevolutionary genetic algorithm. J Softw 23(4):765–775
Xu P, Wang Y, Cheng L, Zang T (2010) Alignment results of sobom for oaei 2010. In: Proceedings of the 5th international conference on ontology matching, vol 689, CEUR-WS.org, pp 203–211
Xue X, Wang Y (2015) Optimizing ontology alignments through a memetic algorithm using both matchfmeasure and unanimous improvement ratio. Artif Intell 223:65–81
Xue X, Wang Y (2016) Using memetic algorithm for instance coreference resolution. IEEE Trans Knowl Data Eng 28(2):580–591
Xue X, Wang Y, Ren A (2014) Optimizing ontology alignments through memetic algorithm based on partial reference alignment. Expert Syst Appl 41(7):3213–3222
Zhou Q, Luo WJ (2010) A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problem. In: Proceedings of the 5th international symposium on advances in computation and intelligence. Springer, Berlin, pp 148–157
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No. 61503082), Natural Science Foundation of Fujian Province (No. 2016J05145), Scientific Research Startup Foundation of Fujian University of Technology (No. GY-Z15007), Fujian Province Outstanding Young Scientific Researcher Training Project (No. GY-Z160149) and China Scholarship Council.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xue, X., Pan, JS. A Compact Co-Evolutionary Algorithm for sensor ontology meta-matching. Knowl Inf Syst 56, 335–353 (2018). https://doi.org/10.1007/s10115-017-1101-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-017-1101-x