Kullback-Leibler distance based concepts mapping between web ontologies

A Kullback-Leibler（KL）distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.

Ontology mapping based on hidden Markov model

The existing ontology mapping methods mainly consider the structure of the ontology and the mapping precision is lower to some extent. According to statistical theory, a method which is based on the hidden Markov model is presented to establish ontology mapping. This method considers concepts as models, and attributes, relations, hierarchies, siblings and rules of the concepts as the states of the HMM, respectively. The models corresponding to the concepts are built by virtue of learning many training instances. On the basis of the best state sequence that is decided by the Viterbi algorithm and corresponding to the instance, mapping between the concepts can be established by maximum likelihood estimation. Experimental results show that this method can improve the precision of heterogeneous ontology mapping effectively.

New automated ontology mapping algorithm

A new algorithm for automated ontology mapping based on linguistic similarity and structure similarity is presented. First, the concept of WordNet is turned into a vector, then the similarity of two entities is calculated according to the cosine of the angle between the corresponding vectors. Secondly, based on the linguistic similarity, a weighted function and a sigmoid function can be used to combine the linguistic similarity and structure similarity to compute the similarity of an ontology. Experimental results show that the matching ratio can reach 63% to 70% and it can effectively accomplish the mapping between ontologies.

Ontology mapping approach using web search engine

A new mapping approach for automated ontology mapping using web search engines （such as Google） is presented. Based on lexico-syntactic patterns, the hyponymy relationships between ontology concepts can be obtained from the web by search engines and an initial candidate mapping set consisting of ontology concept pairs is generated. According to the concept hierarchies of ontologies, a set of production rules is proposed to delete the concept pairs inconsistent with the ontology semantics from the initial candidate mapping set and add the concept pairs consistent with the ontology semantics to it. Finally, ontology mappings are chosen from the candidate mapping set automatically with a mapping select rule which is based on mutual information. Experimental results show that the F-measure can reach 75% to 100% and it can effectively accomplish the mapping between ontologies.

Design of ontology mapping framework and improvement of similarity computation

Ontology heterogeneity is the primary obstacle for interoperation of ontologies. Ontology mapping is the best way to solve this problem. The key of ontology mapping is the similarity computation. At present, the method of similarity computation is imperfect. And the computation quantity is high. To solve these problems, an ontology-mapping framework with a kind of hybrid architecture is put forward, with an improvement in the method of similarity computation. Different areas have different local ontologies. Two ontologies are taken as examples, to explain the specific mapping framework and improved method of similarity computation. These two ontologies are about classes and teachers in a university. The experimental results show that using this framework and improved method can increase the accuracy of computation to a certain extent. Otherwise, the quantity of computation can be decreased.

Chinese Fuzzy Ontology Mapping Based on Support Vector Machine

Taking into account that fuzzy ontology mapping has wide application and cannot be dealt with in many fields at present,a Chinese fuzzy ontology model and a method for Chinese fuzzy ontology mapping are proposed.The mapping discovery between two ontologies is achieved by computing the similarity between the concepts of two ontologies.Every concept consists of four features of concept name,property,instance and structure.First,the algorithms of calculating four individual similarities corresponding to the four features are given.Secondly,the similarity vectors consisting of four weighted individual similarities are built,and the weights are the linear function of harmony and reliability.The similarity vector is used to represent the similarity relation between two concepts which belong to different fuzzy ontolgoies.Lastly,Support Vector Machine(SVM) is used to get the mapping concept pairs by the similarity vectors.Experiment results are satisfactory.

Ontology Mapping Based on Bayesian Network

Ontology mapping is a key interoperability enabler for the semantic web. In this paper,a new ontology mapping approach called ontology mapping based on Bayesian network( OM-BN) is proposed. OM-BN combines the models of ontology and Bayesian Network,and applies the method of Multi-strategy to computing similarity. In OM-BN,the characteristics of ontology,such as tree structure and semantic inclusion relations among concepts,are used during the process of translation from ontology to ontology Bayesian network( OBN). Then the method of Multi-strategy is used to create similarity table( ST) for each concept-node in OBN. Finally,the iterative process of mapping reasoning is used to deduce new mappings from STs,repeatedly.

Configurable ontology mapping based on multi-feature

A configurable ontology mapping approach based on different kinds of concept feature information is introduced in this paper. In this approach, ontology concept feature information is classified as five kinds, which respectively corresponds to five kinds of concept similarity computation methods. Many existing ontology mapping approaches have adopted the multi-feature reasoning, whereas not all feature information can be com- puted in the real ontology mapping and only fractional feature information needs to be selected in the mapping computation. Consequently a eonfigurable ontology mapping model is introduced, which is composed of CMT model, SMT model and related transformation model. Through the configurable model, users can conveniently select the most suitable features and configure the suitable weights. Simultaneously, a related 3-step ontology mapping approach is also introduced. Associated with the traditional name and instance learner-based ontology mapping approach, this approach is evaluated by an ontology mapping application example.

Combining rough set theory and instance selection in ontology mapping

This paper presents a novel ontology mapping approach based on rough set theory and instance selection.In this appoach the construction approach of a rough set-based inference instance base in which the instance selection(involving similarity distance,clustering set and redundancy degree)and discernibility matrix-based feature reduction are introduced respectively;and an ontology mapping approach based on multi-dimensional attribute value joint distribution is proposed.The core of this mapping aI overlapping of the inference instance space.Only valuable instances and important attributes can be selected into the ontology mapping based on the multi-dimensional attribute value joint distribution,so the sequently mapping efficiency is improved.The time complexity of the discernibility matrix-based method and the accuracy of the mapping approach are evaluated by an application example and a series of analyses and comparisons.

A Parsing Graph-based Algorithm for Ontology Mapping

Ontology mapping is a critical problem for integrating the heterogeneous information sources. It can identify the elements corresponding to each other. At present, there are many ontology mapping algorithms, but most of them are based on database schema. After analyzing the similarity and difference of ontology and schema, we propose a parsing graph-based algorithm for ontology mapping. The ontology parsing graph （OP-graph） extends the general concept of graph, encodes logic relationship, and semantic information which the ontology contains into vertices and edges of the graph. Thus, the problem of ontology mapping is translated into a problem of finding the optimal match between the two OP-graphs. With the definition of a universal measure for comparing the entities of two ontoiogies, we calculate the whole similarity between the two OP-graphs iteratively, until the optimal match is found. The results of experiments show that our algorithm is promising.

Ontology based approach of semantic information integration

In order to solve the problem of semantic heterogeneity in information integration, an ontology based semantic information integration （OSII） model and its logical framework are proposed. The OSII adopts the hybrid ontology approach and uses OWL （web ontology language） as the ontology language. It obtains unified views from multiple sources by building mappings between local ontologies and the global ontology. A tree- based multi-strategy ontology mapping algorithm is proposed. The algorithm is achieved by the following four steps： pre-processing, name mapping, subtree mapping and remedy mapping. The advantages of this algorithm are： mapping in the compatible datatype categories and using heuristic rules can improve mapping efficiency; both linguistic and structural similarity are used to improve the accuracy of the similarity calculation; an iterative remedy is adopted to obtain correct and complete mappings. A challenging example is used to illustrate the validity of the algorithm. The OSII is realized to effectively solve the problem of semantic heterogeneity in information integration and to implement interoperability of multiple information sources.

Implementation of Enterprises Interoperation Based on Ontology

The interoperation among enterprises in e-business could block the ambient semantic collaboration and cause a big problem since varying information descriptions and different data models may be used in different enterprises＇ information systems. Ontology is an important tool to overcome the above mentioned syntax and semantic misunderstanding problem. Our goal is to provide a user-friendly environment supporting syntax and neutral format data model for business information. In this paper, two scenarios are discussed and a unified description of data model is developed to solve the gap in interoperation through mapping from logical data of enterprise＇s information system. It provides the methods to realize the mapping among different types of data or information. First, database and other types of information are transformed into neutral format that are described by web ontology language （OWL）. Second, the neutral format can be mapped into the semantic entities and semantic linking through the process of extraction and annotation and added into ontology and then described in a standard format that makes the collaboration be understood easily.

Utilizing Statistical Semantic Similarity Techniques for Ontology Mapping——with Applications to AEC Standard Models

The objective of this paper is to introduce three semi-automated approaches for ontology mapping using relatedness analysis techniques. In the architecture, engineering, and construction (AEC) industry, there exist a number of ontological standards to describe the semantics of building models. Although the standards share similar scopes of interest, the task of comparing and mapping concepts among standards is challenging due to their differences in terminologies and perspectives. Ontology mapping is therefore necessary to achieve information interoperability, which allows two or more information sources to exchange data and to re-use the data for further purposes. The attribute-based approach, corpus-based approach, and name-based approach presented in this paper adopt the statistical relatedness analysis techniques to discover related concepts from heterogeneous ontologies. A pilot study is conducted on IFC and CIS/2 ontologies to evaluate the approaches. Preliminary results show that the attribute-based approach outperforms the other two approaches in terms of precision and F-measure.

Recognizing Hierarchically Related Biomedical Entities Using MeSH-Based Mapping

Identifying hierarchically related entities is a critical step towards constructing bio-networks in the field of biomedical text mining. To this end, we adopt a mapping-based approach by first mapping bio-entities to terms in an established ontology Medical Subject Headings （MESH）. We then utilize the hierarchical relationships available in MeSH to recognize hierarchically related entities. Specifically, we present two approaches to map biomedical entities identified using the Unified Medical Language System （UMLS） Metathesaurus to MeSH terms. The first approach utilizes a special feature provided by the MetaMap algorithm, whereas the other employs approximate phrase-based match to directly map entities to MeSH terms. These two approaches deliver comparable results with an accuracy of 72% and 75%, respectively, based on two evaluation datasets. A thorough error analysis demonstrates that these two approaches result in only around 10% mutual errors, indicating the complementary nature of these two approaches.

SVM-based Ontology Matching Approach

There are a lot of heterogeneous ontologies in semantic web, and the task of ontology mapping is to find their semantic relationship. There are integrated methods that only simply combine the similarity values which are used in current multi-strategy ontology mapping. The semantic information is not included in them and a lot of manual intervention is also needed, so it leads to that some factual mapping relations are missed. Addressing this issue, the work presented in this paper puts forward an ontology matching approach, which uses multi-strategy mapping technique to carry on similarity iterative computation and explores both linguistic and structural similarity. Our approach takes different similarities into one whole, as a similarity cube. By cutting operation, similarity vectors are obtained, which form the similarity space, and by this way, mapping discovery can be converted into binary classification. Support vector machine (SVM) has good generalization ability and can obtain best compromise between complexity of model and learning capability when solving small samples and the nonlinear problem. Because of the said reason, we employ SVM in our approach. For making full use of the information of ontology, our implementation and experimental results used a common dataset to demonstrate the effectiveness of the mapping approach. It ensures the recall ration while improving the quality of mapping results.