Semiautomatic ontology matching poses a new challenge of how to implement an efficient user interactions. To address this challenge, we answer three questions in this paper: (1) when should we activate the interacting process; (2) which correspondences should be presented for user validation; and (3) how to make use of the validating results. In particular, we present an interactive compact memetic algorithm (ICMA) based semiautomatic ontology matching technique to: (1) determine the timing of getting a user involved; (2) determine the problematic correspondences; and (3) propagate the user validating results. The experimental results show that three proposed strategies can effectively reduce the user’s workload and the algorithm’s runtime, increase the alignment’s quality, and the performance of ICMA outperforms the state-of-the-art semiautomatic ontology matching techniques.

Semantic Sensor Web (SSW) links the semantic web technique with the sensor network, which utilizes sensor ontology to describe sensor information. Annotating sensor data with different sensor ontologies can be of help to implement different sensor systems’ inter-operability, which requires that the sensor ontologies themselves are inter-operable. Therefore, it is necessary to match the sensor ontologies by establishing the meaningful links between semantically related sensor information. Since the Swarm Intelligent Algorithm (SIA) represents a good methodology for addressing the ontology matching problem, we investigate a popular SIA, that is, the Firefly Algorithm (FA), to optimize the ontology alignment. To save the memory consumption and better trade off the algorithm’s exploitation and exploration, in this work, we propose a general-purpose ontology matching technique based on Compact co-Firefly Algorithm (CcFA), which combines the compact encoding mechanism with the co-Evolutionary mechanism. Our proposal utilizes the Gray code to encode the solutions, two compact operators to respectively implement the exploiting strategy and exploring strategy, and two Probability Vectors (PVs) to represent the swarms that respectively focuses on the exploitation and exploration. Through the communications between two swarms in each generation, CcFA is able to efficiently improve the searching efficiency when addressing the sensor ontology matching problem. The experiment utilizes the Conference track and three pairs of real sensor ontologies to test our proposal’s performance. The statistical results show that CcFA based ontology matching technique can effectively match the sensor ontologies and other general ontologies in the domain of organizing conferences.