Abstract
An ontology is a state-of-the-art knowledge modeling technique in the natural language domain, which has been widely used to overcome the linguistic barriers in Asian and European countries’ intelligent applications. However, due to the different knowledge backgrounds of ontology developers, the entities in the ontologies could be defined in different ways, which hamper the communications among the intelligent applications built on them. How to find the semantic relationships among the entities that are lexicalized in different languages is called the Cross-lingual Ontology Matching problem (COM), which is a challenge problem in the ontology matching domain. To face this challenge, being inspired by the success of the Genetic Algorithm (GA) in the ontology matching domain, this work proposes a Compact GA with Annealing Re-sample Inheritance mechanism (CGA-ARI) to efficiently address the COM problem. In particular, a Cross-lingual Similarity Metric (CSM) is presented to distinguish two cross-lingual entities, a discrete optimal model is built to define the COM problem, and the compact encoding mechanism and the Annealing Re-sample Inheritance mechanism (ARI) are introduced to improve CGA’s searching performance. The experiment uses Multifarm track to test CGA-ARI’s performance, which includes 45 ontology pairs in different languages. The experimental results show that CGA-ARI is able to significantly improve the performance of GA and CGA and determine better alignments than state-of-the-art ontology matching systems.
- [1] . 2013. Enhancing ontology alignment through a memetic aggregation of similarity measures. Information Sciences 250 (2013), 1–20.Google Scholar
Cross Ref
- [2] . 2012. Ontology alignment based on instances using hybrid genetic algorithm. In Proceedings of the 7th International Conference on Ontology Matching-Volume 946. CEUR-WS.org, 242–243.Google Scholar
Digital Library
- [3] . 1994. Population-based Incremental Learning. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning.
Technical Report . Carnegie-Mellon Univ. Pittsburgh Pa Dept of Computer Science.Google ScholarDigital Library
- [4] . 2013. Re-sampled inheritance search: High performance despite the simplicity. Soft Computing 17, 12 (2013), 2235–2256.Google Scholar
Digital Library
- [5] . 2019. Interactive cross-lingual ontology matching. IEEE Access 7 (2019), 79095–79102.Google Scholar
Cross Ref
- [6] . 2020. Optimizing ontology alignment in vector space. Journal of Internet Technology 21, 1 (2020), 15–22.Google Scholar
- [7] . 2008. On fixing semantic alignment evaluation measures. In Proceedings of the 3rd ISWC Workshop on Ontology Matching (OM’08). 25–36.Google Scholar
- [8] . 2018. LogMap family participation in the OAEI 2018. In Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication. ACM, 187–191.Google Scholar
- [9] . 2018. Results of AML participation in OAEI 2018. In Proceedings of the ISWC Workshop on Ontology Matching (OM’18). 125–131.Google Scholar
- [10] . 1953. Pulse Code Communication.
US Patent 2632058A. Google Scholar - [11] . 1937. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32, 200 (1937), 675–701.Google Scholar
Cross Ref
- [12] . 2009. A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: A case study on the CEC’2005 special session on real parameter optimization. Journal of Heuristics 15, 6 (2009), 617–644.Google Scholar
Digital Library
- [13] . 2010. Using a genetic algorithm for optimizing the similarity aggregation step in the process of ontology alignment. In 9th Roedunet International Conference. 118–122.Google Scholar
- [14] . 1999. The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3, 4 (1999), 287–297.Google Scholar
Digital Library
- [15] . 1979. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6, 2 (1979), 65–70.Google Scholar
- [16] . 2019. Compact optimization algorithms with re-sampled inheritance. In International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer, 523–534.Google Scholar
Cross Ref
- [17] . 2019. From monolingual to multilingual ontologies: The role of cross-lingual ontology enrichment. In International Conference on Semantic Systems. Springer, Cham, 215–230.Google Scholar
Cross Ref
- [18] . 2018. Cross-lingual and multilingual ontology mapping-survey. In Proceedings of the 19th International Conference on Computer Systems and Technologies. ACM, 50–57.Google Scholar
Digital Library
- [19] . 2018. KEPLER at OAEI 2018. In Proceedings of the ISWC Workshop on Ontology Matching (OM’18). 173–178.Google Scholar
- [20] . 2021. ASRNN: A recurrent neural network with an attention model for sequence labeling. Knowledge-Based Systems 212 (2021), 106548.Google Scholar
Cross Ref
- [21] . 2020. Enhanced sequence labeling based on latent variable conditional random fields. Neurocomputing 403 (2020), 431–440.Google Scholar
Cross Ref
- [22] . 2019. A Bi-LSTM mention hypergraph model with encoding schema for mention extraction. Engineering Applications of Artificial Intelligence 85 (2019), 175–181.Google Scholar
Cross Ref
- [23] . 2008. Optimizing ontology alignments by using genetic algorithms. In Proceedings of the 1st International Conference on Nature Inspired Reasoning for the Semantic Web-Volume 419. CEUR-WS.org, 1–15.Google Scholar
Digital Library
- [24] . 2011. Evaluation of two heuristic approaches to solve the ontology meta-matching problem. Knowledge and Information Systems 26, 2 (2011), 225–247.Google Scholar
Cross Ref
- [25] . 2020. Evaluating and comparing ontology alignment systems: An MCDM approach. Journal of Web Semantics 64 (2020), 100592.Google Scholar
Cross Ref
- [26] . 2013. Compact optimization. In Handbook of Optimization. Springer, Berlin, Heidelberg, 337–364.Google Scholar
Cross Ref
- [27] . 2020. Assessing ontology mappings on a level of concepts and instances. IEEE Access 8 (2020), 174845–174859.Google Scholar
Cross Ref
- [28] . 2020. Results of the ontology alignment evaluation initiative 2020. In Proceedings of the 15th International Workshop on Ontology Matching (OM’20), Vol. 2788. CEUR-WS, 92–138.Google Scholar
- [29] . 2021. Self-attention-based conditional random fields latent variables model for sequence labeling. Pattern Recognition Letters 145 (2021), 157–164.Google Scholar
Digital Library
- [30] . 2003. Handbook of Parametric and Nonparametric Statistical Procedures. CRC Press.Google Scholar
Cross Ref
- [31] . 2005. A string metric for ontology alignment. In International Semantic Web Conference. Springer, 624–637.Google Scholar
Digital Library
- [32] . 2018. Ontology-based Tamil–English cross-lingual information retrieval system. Sādhanā 43, 10 (2018), 1–14.Google Scholar
Cross Ref
- [33] . 2015. Light-weight cross-lingual ontology matching with LYAM++. In OTM Confederated International Conferences “On the Move to Meaningful Internet Systems.” Springer, 527–544.Google Scholar
Digital Library
- [34] . 1986. A non-classical logic for information retrieval. Computer Journal 29, 6 (1986), 481–485.Google Scholar
Cross Ref
- [35] . 2006. GAOM: Genetic algorithm based ontology matching. In Proceedings of IEEE Asia-Pacific Conference on Services Computing. 617–620.Google Scholar
Digital Library
- [36] . 2018. XMap: Results for OAEI 2018. In 13th ISWC Workshop on Ontology Matching (OM’18). 210–227.Google Scholar
- [37] . 1994. A genetic algorithm tutorial. Statistics and Computing 4, 2 (1994), 65–85.Google Scholar
Cross Ref
- [38] . 1995. Matching and record linkage. Business Survey Methods 1 (1995), 355–384.Google Scholar
- [39] . 2021. Matching biomedical ontologies through adaptive multi-modal multi-objective evolutionary algorithm. Biology 10, 12 (2021), 1–16.Google Scholar
- [40] . 2021. Matching biomedical ontologies through Compact Differential Evolution algorithm with compact adaption schemes on control parameters. Neurocomputing 458 (2021), 526–534.Google Scholar
Digital Library
- [41] . 2021. Efficient user involvement in semiautomatic ontology matching. IEEE Transactions on Emerging Topics in Computational Intelligence 5, 2 (2021), 214–224.Google Scholar
Cross Ref
- [42] . 2021. Matching sensor ontologies with multi-context similarity measure and parallel compact differential evolution algorithm. IEEE Sensors Journal 21, 21 (2021), 24570–24578.Google Scholar
Cross Ref
- [43] . 2017. Collaborative ontology matching based on compact interactive evolutionary algorithm. Knowledge-Based Systems 137 (2017), 94–103.Google Scholar
Digital Library
- [44] . 2019. Using NSGA-III for optimizing biomedical ontology alignment. CAAI Transactions on Intelligence Technology 4, 3 (2019), 135–141.Google Scholar
Cross Ref
- [45] . 2015. Using memetic algorithm for instance coreference resolution. IEEE Transactions on Knowledge and Data Engineering 28, 2 (2015), 580–591.Google Scholar
Digital Library
- [46] . 2021. Integrating sensor ontologies with global and local alignment extractions. Wireless Communications & Mobile Computing 2021 (2021), 1–10.Google Scholar
Digital Library
- [47] . 2021. Matching large-scale biomedical ontologies with central concept based partitioning algorithm and adaptive compact evolutionary algorithm. Applied Soft Computing 106 (2021), 1–11.Google Scholar
Digital Library
Index Terms
Integrating Heterogeneous Ontologies in Asian Languages Through Compact Genetic Algorithm with Annealing Re-sample Inheritance Mechanism
Recommendations
A weight based compact genetic algorithm
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationIn order to improve the performance of the compact Genetic Algorithm (cGA) to solve difficult optimization problems, an improved cGA which named as the weight based compact Genetic Algorithm (wcGA) is proposed. In the wcGA, S individuals are generated ...
The compact genetic algorithm struggles on Cliff functions
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceThe compact genetic algorithm (cGA) is a non-elitist estimation of distribution algorithm which has shown to be able to deal with difficult multimodal fitness landscapes that are hard to solve by elitist algorithms. In this paper, we investigate the cGA ...
A step forward in studying the compact genetic algorithm
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent population instead of using traditional recombination and mutation operators. ...






Comments