Applications of Semantic Mobile Computing in the Internet of Things and Web of ThingsView this Special Issue
Research Article | Open Access
Xingsi Xue, Jiawei Lu, Chengcai Jiang, Yikun Huang, "Sensor Ontology Metamatching with Heterogeneity Measures", Wireless Communications and Mobile Computing, vol. 2020, Article ID 6666228, 10 pages, 2020. https://doi.org/10.1155/2020/6666228
Sensor Ontology Metamatching with Heterogeneity Measures
The heterogeneity problem among different sensor ontologies hinders the interaction of information. Ontology matching is an effective method to address this problem by determining the heterogeneous concept pairs. In the matching process, the similarity measure serves as the kernel technique, which calculates the similarity value of two concepts. Since none of the similarity measures can ensure its effectiveness in any context, usually, several measures are combined together to enhance the result’s confidence. How to find suitable aggregating weights for various similarity measures, i.e., ontology metamatching problem, is an open challenge. This paper proposes a novel ontology metamatching approach to improve the sensor ontology alignment’s quality, which utilizes the heterogeneity features on two ontologies to tune the aggregating weight set. In particular, three ontology heterogeneity measures are firstly proposed to, respectively, evaluate the heterogeneity values in terms of syntax, linguistics, and structure, and then, a semiautomatically learning approach is presented to construct the conversion functions that map any two ontologies’ heterogeneity values to the weights for aggregating the similarity measures. To the best of our knowledge, this is the first time that heterogeneity features are proposed and used to solve the sensor ontology metamatching problem. The effectiveness of the proposal is verified by comparing with using state-of-the-art ontology matching techniques on Ontology Alignment Evaluation Initiative (OAEI)’s testing cases and two pairs of real sensor ontologies.
A sensor network is composed of various sensors. In order to realize the information integration and communication between multiple sensor networks, a semantic sensor web is born, which is composed of the semantic web and the sensor network. In the semantic sensor web, sensor data is marked as metadata characterized by sensor ontology to increase interoperability [1–3]. Sensor ontology can reach a consensus on the meaning of concepts in sensor certain field and provide rich domain knowledge and semantic vocabulary for the interaction between application systems in the semantic sensor web. In recent years, there have been many sensor ontologies, such as SensorOntology2009 (https://www.w3.org/2005/Incubator/ssn/wiki/SensorOntology2009), IoT-Lite (https://www.w3.org/Submission/2015/SUBM-iot-lite-20151126/), original SSN (Semantic Sensor Network) (https://www.w3.org/2005/Incubator/ssn/wiki/SSN#Sensor), new SSN (https://www.w3.org/ns/ssn/), and SOSA (Sensor, Observation, Sample, and Actuator) (https://www.w3.org/ns/sosa/). These ontologies can represent the function, performance, and usage conditions of sensors, which can provide different data for different purposes and contexts [4, 5]. However, in the distributed and open environment, since the people who construct sensor ontologies might have diverse preferences, knowledge backgrounds, and styles of understanding knowledge, one concept could be defined with different names or granularities, and the context of a concept could also be different as well. These lead to the problem of ontology heterogeneity [6, 7]. For example, the existence of the concept “personal computer” in one ontology is defined as “PC” in another ontology, which results in syntax heterogeneity. To support the semantic interaction between intelligent systems based on sensor ontology, we need to determine the correspondence between their heterogeneous concepts in sensor ontologies, which is the so-called sensor ontology matching . During the matching process, it is important to distinguish identical concepts by calculating their similarity value, and thus, similarity measure becomes the kernel technique that directly affects the alignment’s quality. At present, similarity measures can be mainly divided into three categories, i.e., syntax-based measure, linguistics-based measure, and structure-based measure . Although these methods have been extensively studied and used, it is still a challenge to find an effective similarity measure for a specific matching task. With the emergence of various similarity measures, it is a feasible way of using multiple similarity measures to overcome the limitations of a single one [10–12]. However, how to find suitable aggregating weights to combine them becomes another problem, i.e., ontology metamatching problem . Traditional metamatching methods include Max, Min, and average approaches [14–16], which, respectively, take into account the maximum value, minimum value, and average value of the concepts measured by various similarity measures but ignore the heterogeneity features of concepts. This paper proposes a novel ontology metamatching approach to face this challenge, which uses the heterogeneity features of two ontologies to semiautomatically tune the weights for aggregating different similarity measures.
In particular, three ontology heterogeneity measures are firstly proposed to, respectively, evaluate the heterogeneity values in terms of syntax, linguistics, and structure heterogeneity features, and then, along with the aggregating weights of corresponding similarity measures which are given by experts, conversion functions that convert any two ontologies’ heterogeneity values to the weights for aggregating the similarity measures are trained. The training process of conversion function is shown in Figure 1, where and represent the th pair of ontologies for training ( is the reference ontology and is a target ontology), and , , and are the th set of weights for aggregating the syntax-based, linguistics-based, and structure-based similarity measures, respectively, which are given by experts and have the best effectiveness to measure the th pair of ontologies. The conversion function aims at converting the heterogeneity value into corresponding aggregating weight, such as converting the syntax heterogeneity to the aggregating weight for syntax-based similarity measure.
In the rest of the paper, Section 2 defines the related concepts about sensor ontology and the evaluation function; Section 3 describes in detail the ontology heterogeneity measure and semiautomatically learning method; Section 4 shows the experimental results; Section 5 summarizes the work and presents future work.
2.1. Sensor Ontology and Entity Correspondence
Sensor ontology is a 3-tuple  , where is a nonempty set of classes, is a nonempty set of properties, is a set of instances (can be empty). In general, class, property (datatype property and object property), and instance are called entities.
The sensor ontology matching measure utilizes the information inside the sensor ontology and other knowledge bases outside the sensor ontology to determine the similar entities in two sensor ontologies . The entity mapping set is called sensor ontology alignment, and each entity correspondence inside is defined as follows:
An entity correspondence is a 4-tuple  , where and are two entities from the sensor ontologies, respectively; represents the similarity value obtained by calculating and through mathematical functions; and is the semantic relationship between and , which is the equivalence relationship in this work .
2.2. Similarity Measure
A similarity measure is a function that takes as input two entities’ information and and returns their similarity value of . Next, we introduce three types of similarity measures in detail, i.e., syntax-based, linguistic-based, and structure-based.
2.2.1. Syntax-Based Similarity Measure
Syntax-based similarity measure utilizes the syntax information of two strings to calculate their similarity value. There are many similarity measures based on syntax, such as Jaro-Winkler distance , SMOA distance , and N-gram . According to , N-gram similarity measure shows superior performance when concepts match, and especially when , the best effect is achieved. Therefore, this paper uses the N-gram as the representative of the syntax-based similarity measure. N-gram is defined as follows: where and are the strings to be matched, and , respectively, represent the number of substring in the two strings when , and represents the number of common substring in the two strings.
2.2.2. Linguistics-Based Similarity Measure
Linguistics-based similarity measure calculates two words’ similarity value by using a background knowledge base, such as WordNet . WordNet is an electronic language database which includes the set of synonyms of various vocabularies and defines the subordinate relation between different vocabularies. It is usually used to measure the similarity between concepts. The Wu and Palmer similarity measure used in this paper uses the depth of the two concepts in WordNet and the depth of their nearest common parent concept to calculate the similarity . It considers the change of connection strength between concepts, and the result of measurement is more accurate. Given two words and , the Wu and Palmer similarity measure is defined as follows: where is the closest common parent concept about the concept and in the WordNet hierarchy. , , and represent the depth of the common parent concept, and in the hierarchy, respectively.
2.2.3. Structure-Based Similarity Measure
Structure-based similarity measure utilizes two concepts’ parent-child concepts defined in their ontologies to calculate the similarity value. As a classic structure-based similarity measure, SimRank  works based on the assumption that if two concepts are related to similar concepts, then the two concepts are similar. The relationship graph between concepts is expressed as , as a node represents an object, and as an edge connecting nodes represents the relationship between objects. The SimRank similarity measure is defined as follows:
where and are two concepts from two ontologies, respectively, represents the th concept that points to in the relationship graph, and represents the cardinality of the concepts pointing to in the relationship graph. When , the similarity value between concepts is 1; otherwise, the similarity value of and is the average value of the similarity value of all combinations of the concepts pointing to and the concepts pointing to . The constant as the damping coefficient is generally assigned to 0.8. When the number of concepts pointing to or is 0, the similarity value between and is 0.
As a recursive algorithm, SimRank algorithm has an iterative process as follows. Let be the similarity of in the th iteration process and initialized as
When , the initial similarity value between concepts is 1; otherwise, the initial similarity value between concepts is 0, using the initialization result to start iteration:
When , . The similarity of each generation will be updated according to the value of the previous generation. converges with the increase of . When , it can be considered that . Usually, it has the best effect when .
2.3. Evaluation Metrics on Alignment’s Quality
Traditionally, the quality of a sensor ontology alignment can be evaluated by recall, precision, and -measure [27, 28]. The recall indicates the correct matching pairs among the total found matching pairs accounting for the reference matching pairs. When the recall is 1, it means that all correct matching pairs have been found. However, this does not mean that there are no wrong matching pairs among the found matching pairs, so the accuracy needs to be evaluated. The precision indicates the correct matching pairs among the total found matching pairs accounting for the found matching pairs. In order to comprehensively evaluate the matching quality, the weighted harmonic mean (i.e., -measure) of the precision and recall is used. The precision, recall, and -measure are defined as follows: where is a reference alignment and is an alignment.
3. Ontology Heterogeneity Measure and Conversion Function
In this work, we dedicate to semiautomatically tuning the aggregating weights for various similarity measures by taking into consideration two ontologies’ heterogeneity features. Firstly, we construct an ontology hierarchy graph for each ontology, whose nodes are the ontology’s concepts and the edge between two nodes is the relationship between the corresponding concepts . Secondly, the concepts in each ontology are ranked in descending order according to their corresponding nodes’ out-in-degrees  in the ontology hierarchy graph. After that, the first third concepts with the best ranked are selected as the representative concepts, which are further used to measure the heterogeneity value of two ontologies. On this basis, the representative datatype properties and object properties can also be determined. Then, given the similarity measures of their aggregating weights, we try to learn conversion functions that map any two ontologies’ heterogeneity values to the weights for aggregating the corresponding similarity measures.
3.1. Ontology Heterogeneity Measure
To the best of our knowledge, this is the first time to quantify the degree of ontology heterogeneity features. To reduce the computational complexity, it is necessary to select the representative concepts from the ontology for the heterogeneity calculation. In this work, we first calculate the sum of each node’s out-in-degrees, which reflects the close connection between this node and its surrounding nodes, as well as the importance of the nodes. Then, the first third concepts with the best ranked are selected as the representative concepts (i.e., classes). The datatype properties and object properties related to representative classes can be chosen as the representative ones.
Being inspired by traditional metrics such as recall and precision, the heterogeneity value in this work is calculated through the ratio of the heterogeneous part to the overall part. Supposing cardinality of the alignment in this paper is one-to-one mapping, and are two entity sets to be matched; the heterogeneity value is calculated as follows: where and are, respectively, and ’s cardinalities, is the cardinality of the identical entities in the two entity sets. At present, there are three kinds of ontology heterogeneity, and the quantification of the heterogeneity of each of them should be carried out on the entities related to the heterogeneity. In different heterogeneity measures, the choice of entity sets and is different: (1)Syntax Heterogeneity Measure. It is inspired by the syntax similarity measure N-gram, which directly measures the entities in the ontology. Then, the quantification of syntax heterogeneity feature will also focus on the entities in the ontology. and , respectively, represent the representative entity sets in the two ontologies to be matched(2)Linguistics Heterogeneity Measure. It is inspired by linguistics similarity measure Wu and Palmer, measuring the synonyms of the entities to be matched in WordNet, that the quantification of linguistic heterogeneity will also focus on the synonyms of the entities in the ontology in WordNet. and , respectively, represent the set of representative entities in the two ontologies to be matched and their synonyms in WordNet(3)Structure Heterogeneity Measure. The parent-child concepts of the entities to be matched in the ontology will be considered into the quantification of structural heterogeneity, and it is enlightened by the structural similarity measure SimRank, which measures the parent-child concepts of the entities to be matched in the ontology hierarchy graph. and , respectively, represent the set of representative entities in the two ontologies to be matched and their parent-child concepts in the ontology hierarchy
According to different heterogeneity features, different entities are selected as the input of the heterogeneity method (formula (7)), which can quantify the degree of different heterogeneity features more targeted.
3.2. Conversion Function Learning
The construction of the “heterogeneity value-weight” conversion function is aimed at exploring the functional relationship between the aggregating weights of various similarity measures and the heterogeneity features that cause the heterogeneity between ontologies, aiming to give more effective aggregating weights to various similarity measures. After determining three kinds of heterogeneity values between two ontologies, we need to further convert them to the aggregating weights for different similarity measures. So the conversion function is needed to construct. As shown in Figure 1, the learning data of the conversion function includes heterogeneity value and the corresponding aggregating weight (about N-gram, Wu and Palmer, or SimRank) given by experts.
This work uses the data analysis software Origin2020 (https://www.originlab.com) to construct the conversion function. The fitting algorithm behind the tool is least-squares. Compared to language interpolating polynomials and cubic spline interpolation, the least-squares algorithm is more suitable for forecasting. Furthermore, by observing that “heterogeneity value-weight” fitting data is an exponential function, and the least-squares algorithm is capable of fitting the exponential function.
Due to the different heterogeneity features of various entities in ontology, not all the three types of similarity measures are needed for each kind of entity. (1)For class. The learning data for fitting can be defined as , where represents a certain kind of heterogeneity value of the three, and is the aggregating weight of the similarity measure which belongs to the same kind, such as is the syntax heterogeneity value and is the aggregating weight of the syntax-based similarity measure N-gram. represents the serial number of the data for fitting(2)For properties (datatype property and object property). Due to the lack of structural features, SimRank is not suitable for them. So in ,
Finally, seven conversion functions are obtained. The quality of the conversion functions will be evaluated with coefficient of determination (-square) .
4. Ontology Metamatching
In this section, we describe the proposed ontology metamatching technique in detail. The entities in an ontology can be divided into three types, i.e., class, datatype property, and object property, and they all have such information as ID, label, and comment. Next, we take class as an example to illustrate the matching process: given a pair of ontologies to be matched, (1) select the representative classes from the two ontologies, calculate three kinds of heterogeneity values, and, respectively, substitute them into the corresponding “heterogeneity value-weight” functions to obtain the aggregating weights. In particular, the th aggregating weights are denoted as ; (2) construct the similarity matrices on ID and label using different similarity measures, which are, respectively, denoted as and . Since comment has no structural relationship and it is usually a sentence that SimRank and Wu and Palmer could not measure it effectively, we utilize N-gram to measure their similarity; (3) multiply the similarity matrix of ID and label with their corresponding aggregating weights and, respectively, add these weighted matrices to a comprehensive similarity matrix, i.e., and ; (4) use a threshold to filter the comprehensive similarity matrix: first, filter the ID matching pairs; second, for those entities that do not match, filter them by their labels; third, for those entities that still do not match, filter by their comments; finally, put the mappings whose similarity values are above the threshold into the final alignment in each step. For the sake of clarity, we show the flowchart of the process of determining the final ontology alignment in Figure 2.
5.1. Dataset and Experimental Configuration
In the experiment, we use the testing cases provided by the Ontology Alignment Evaluation Initiative (OAEI) (http://oaei.ontologymatching.org). A brief description on OAEI’s testing cases is shown in Table 1. In particular, each case contains two ontologies to be matched and one reference alignment for evaluating the quality of the alignment. The testing cases include another part of the benchmark above and two pairs of real sensor ontologies, i.e., new SSN vs. original SSN and new SSN vs. SOSA. Where the original SSN describes sensors and observations and related concepts, the new SSN improves the original SSN as follows: addressing changes in scope and audience, addressing shortcomings of the original SSN, and addressing technical developments; SOSA provides a lightweight core for SSN and aims at broadening the target audience and application areas that can make use of Semantic Web ontologies (https://www.w3.org/TR/vocab-ssn/). As classic sensor ontologies, SSN series sensor ontology is widely used in satellite imagery, large-scale scientific monitoring, industrial and household infrastructures, social sensing, citizen science, observation-driven ontology engineering, and the Web of Things. They greatly promote information exchange in various fields.
The relevant configuration of the experiment is as follows: the threshold of the similarity matrix is 0.68; the model of the conversion function is the exponential function . In this experiment, through the benchmark, we compare our approach with OAEI’s participants and three classic metamatching methods, i.e., maximum-based metamatching approach, minimum-based metamatching approach, and average-based metamatching approach. Finally, we apply the method of this paper to two pairs of real sensor ontologies to verify the robustness.
5.2. Experimental Results and Analysis
As shown in Figures 3–5, seven conversion functions are achieved, among which class has three kinds of conversion functions, while due to the lack of structural features, datatype property and object property have two kinds of conversion functions, respectively. According to -square, we can see that each conversion function is able to effectively reflect the mapping relation between heterogeneity value and aggregating weight. From the conversion functions, we can find that the aggregating weight of syntax-based similarity measure N-gram takes the largest percentage among the similarity measures for all three kinds of entities, while the others account for a small part. In addition, the aggregating weight of the syntax-based N-gram decreases exponentially as its heterogeneity value increases for all three kinds of entities; on the contrary, the aggregating weight of the linguistics-based similarity measure Wu and Palmer and the structure-based similarity measure SimRank increases exponentially as their heterogeneity value increases.
In Table 2, edna  is the baseline method, and AML , LogMap series , and XMap  are OAEI’s participants. In terms of the comprehensive evaluation index -measure, our method score is 0.82, which is much higher than other state-of-the-art methods. Since AML uses more than ten similarity measures, its precision is slightly higher than our method, but there will be suppression between multiple similarity measures, which yields low recall and high computational complexity on tuning these similarity measures and debugging the results. Our approach’s recall is 0.74, which is higher than other state-of-the-art methods.
As shown in Tables 3–5 that in all 45 testing cases, our method achieves better results than other competitors in terms of 41 testing cases and has equal results with other competitors in terms of another 4 testing cases, which further shows the effectiveness of our method. For a more intuitive comparison, a bar graph of -measure for the four methods is drawn in Figure 6.
Both in comparisons with the state-of-the-art methods in OAEI and three classic metamatching methods, our method achieves ideal results. This is because other methods ignore the effect of heterogeneity features, which makes them unable to identify more matching pairs effectively. The heterogeneity features into the process of obtaining aggregating weights are first time taken into account in our method and find more matching pairs and realize effective matching.
When matching real sensor ontologies, new SSN is treated as the source ontology, and the other two real sensor ontologies are treated as the target ontologies. It can be seen from Table 6 that our approach is able to obtain results that are very close to the golden alignment. When matching the new SSN and the original SSN, the recall obtained by our approach is 0.97, which is due to that we suppose the alignment’s cardinality is one to one, i.e., one concept in the ontology can only be mapped with one concept of another ontology and vice versa. However, the cardinality could be one to many in some practical tasks, e.g., the concept “Stimulus” in the new SSN is mapped with the concept “Stimulus” in the original SSN which is asserted the same as another class “Sensor Input.” In our approach, according to the filtering sequence of step 4 in Figure 2, if “Stimulus” in the new SSN first is mapped with “Stimulus” in the original SSN by ID, it will no longer participate in the filtering process (although the comment of “Stimulus” in the new SSN is the same as the comment of “Sensor Input” in the original SSN), which decreases our approach’s recall value.
6. Conclusion and Future Work
Addressing ontology metamatching problem requires the determination of suitable aggregating weights of several similarity measures for matching ontologies. Considering that the heterogeneity features of ontology have an important influence on the aggregating weight of similarity measures, this paper first proposes three heterogeneity measures to quantify the heterogeneity values of ontology heterogeneity features and then constructs the functional relationship between the heterogeneity feature and the aggregating weights of various similarity measures. The effectiveness of the proposal is verified by comparing with the state-of-the-art matching techniques in OAEI and other classic metamatching methods. The robustness of the method is proved by matching two pairs of real sensor ontologies.
In the future, we are interested in further improving this approach to deal with the matching task with the alignment’s cardinality being many to many. We are also interested in addressing large-scale matching problem, where two sensor ontologies might own tens of thousands of concepts and instances. In addition, when the number of similarity measures is large, e.g., more than 50, the selection of suitable ones is the critical issue that we need to address. Finally, an efficient user interacting strategy should be used to further reduce the interacting time and the user’s error rate.
The data used to support this study can be found in http://oaei.ontologymatching.org.
Conflicts of Interest
The authors declare that they have no conflicts of interest in the work.
This work is supported by the Natural Science Foundation of Fujian Province (No. 2020J01875), the Guangxi Key Laboratory of Automatic Detecting Technology and Instruments (No. YQ20206), the Scientific Research Foundation of Fujian University of Technology (No. GY-Z17162), the 2018 Program for Outstanding Young Scientific Researcher in Fujian Province University, the Fujian Province Undergraduate Universities Teaching Reform Research Project (No. FBJG20190156), the Science and Technology Planning Project of Fuzhou City (No. 2019-G-40), and the Foreign Cooperation Project in Fujian Province (No. 2019I0019).
- X. Xue and J. Chen, “Optimizing sensor ontology alignment through compact co-firefly algorithm,” Sensors, vol. 20, no. 7, article 2056, 2020.
- X. Xue and J. Liu, “Collaborative ontology matching based on compact interactive evolutionary algorithm,” Knowledge-Based Systems, vol. 137, pp. 94–103, 2017.
- X. Xue and J. Chen, “Using Compact Evolutionary Tabu Search algorithm for matching sensor ontologies,” Swarm and Evolutionary Computation, vol. 48, pp. 25–30, 2019.
- X. Xue, J. Chen, and J. S. Pan, in Evolutionary Algorithm based Ontology Matching Technique, Beijing: Science Press, 2018.
- X. Xue, J. Chen, and X. Yao, “Efficient user involvement in semiautomatic ontology matching,” IEEE Transactions on Emerging Topics in Computational Intelligence, pp. 1–11, 2018.
- X. Xue, H. Yang, J. Zhang, J. Zhang, and D. Chen, “An automatic biomedical ontology meta-matching technique,” Journal of Network Intelligence, vol. 4, no. 3, pp. 109–113, 2019.
- X. Xue and A. Ren, “An evolutionary algorithm based ontology alignment extracting technology,” Journal of Network Intelligence, vol. 2, no. 2, pp. 205–212, 2017.
- X. Xue and J. Chen, “A preference-based multi-objective evolutionary algorithm for semiautomatic sensor ontology matching,” International Journal of Swarm Intelligence Research, vol. 9, no. 2, pp. 1–14, 2018.
- J. Euzenat and P. Shvaiko, “Classifications of ontology matching techniques,” in Ontology Matching, pp. 73–84, Springer, Berlin, Heidelberg, 2013.
- J.-B. Gao, B.-W. Zhang, and X.-H. Chen, “A WordNet-based semantic similarity measurement combining edge-counting and information content theory,” Engineering Applications of Artificial Intelligence, vol. 39, pp. 80–88, 2015.
- G. Pirró and N. Seco, “Design, implementation and evaluation of a new semantic similarity metric combining features and intrinsic information content,” in On the Move to Meaningful Internet Systems: OTM 2008, pp. 1271–1288, Springer, Berlin, Heidelberg, 2008.
- L. Meng, R. Huang, and J. Gu, “An effective algorithm for semantic similarity metric of word pairs,” International Journal of Multimedia and Ubiquitous Engineering, vol. 8, no. 2, pp. 1–12, 2013.
- X. Xue and J.-S. Pan, “A compact co-evolutionary algorithm for sensor ontology meta-matching,” Knowledge and Information Systems, vol. 56, no. 2, pp. 335–353, 2018.
- H.-H. Do and E. Rahm, “COMA — a system for flexible combination of schema matching approaches,” pp. 610–621.
- J. Wang, Z. Ding, and C. Jiang, “GAOM: genetic algorithm based ontology matching,” in 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06), pp. 617–620, Guangzhou, Guangdong, China, December 2006.
- A. Doan, P. Domingos, and A. Halevy, “Learning to match the schemas of data sources: a multistrategy approach,” Machine Learning, vol. 50, no. 3, pp. 279–301, 2003.
- X. Xue and Y. Wang, “Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio,” Artificial Intelligence, vol. 223, pp. 65–81, 2015.
- X. Xue, “A compact firefly algorithm for matching biomedical ontologies,” Knowledge and Information Systems, vol. 62, no. 7, pp. 2855–2871, 2020.
- X. Xue, J. Chen, and D. Chen, “Matching Biomedical Ontologies Through Compact Hybrid Evolutionary Algorithm,” Journal of Information Hiding and Multimedia Signal Processing, vol. 10, no. 1, pp. 110–117, 2019.
- X. Xue and J. Lu, “A compact brain storm algorithm for matching ontologies,” IEEE Access, vol. 8, pp. 43898–43907, 2020.
- W. E. Winkler, The State of Record Linkage and Current Research Problems, Statistical Research Division, U.S. Bureau of the Census, 1999.
- X. Xue and Y. Wang, “Using memetic algorithm for instance coreference resolution,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 2, pp. 580–591, 2016.
- V. Mascardi, A. Locoro, and P. Rosso, “Automatic ontology matching via upper ontologies: a systematic evaluation,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 5, pp. 609–623, 2010.
- G. A. Miller, “WordNet,” Communications of the ACM, vol. 38, no. 11, pp. 39–41, 1995.
- Z. Wu and M. Palmer, “Verbs semantics and lexical selection,” in Proceedings of the 32nd annual meeting on Association for Computational Linguistics, pp. 133–138, Las Cruces, New Mexico, 1994.
- J. Glen and J. Widom, “Sim Rank: a measure of structural-context similarity,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02, pp. 538–543, Montreal, Canada, 2002.
- S.-C. Chuan, X. Xue, J.-S. Pan, and X. Wu, “Optimizing ontology alignment in vector space,” Journal of Internet Technology, vol. 21, no. 1, pp. 15–22, 2020.
- C. J. V. Rijsberge, Information Retrieval, University of Glasgow, 1975.
- X. Xue and X. Yao, “Interactive ontology matching based on partial reference alignment,” Applied Soft Computing, vol. 72, pp. 355–370, 2018.
- M. Barthelemy, “Betweenness centrality in large complex networks,” The European Physical Journal B - Condensed Matter, vol. 38, no. 2, pp. 163–168, 2004.
- M. Awawdeh, T. Faisal, A. Bashir, and A. Sheikh, “Application of outlier detection using re-weighted least squares and R-squared for IoT extracted data,” in 2019 Advances in Science and Engineering Technology International Conferences (ASET), pp. 1–6, Dubai, United Arab Emirates, March 2019.
- M. Achichi, M. Cheatham, Z. Dragisic et al., Results of the Ontology Alignment Evaluation Initiative, 2016.
- D. Faria, C. Pesquita, B. S. Balasubramani et al., “OAEI 2016 results of AML,” in 11th International Workshop on Ontology Matching co-located with the 15th International Semantic Web Conference, CEUR Workshop Proceedings, vol. 1766, Kobe, Japan, 2016.
- E. Jimenez-Ruiz, B. C. Grau, and V. V. Cross, “Logmap family participation in the OAEI 2016,” in Proceedings of the 11th International Workshop on Ontology Matching co-located with the 15th International Semantic Web Conference, pp. 185–189, Kobe, Japan, 2016.
- D. E. Warith, M. T. Khadir, and S. B. Yahia, “XMap: results for OAEI 2016,” in 11th International Workshop on Ontology Matching co-located with the 15th International Semantic Web Conference, pp. 222–226, Kobe, Japan, 2016.
Copyright © 2020 Xingsi Xue et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.