Discovering Concept Mappings by Similarity Propagation among Substructures
MetadataShow full item record
Concept matching is important when heterogeneous data sources are to be merged for the purpose of knowledge sharing. It has many useful applications in areas such as schema matching, ontology matching, scientific knowledge management, e-commerce, enterprise application integration, etc. With the desire of knowledge sharing and reuse in these fields, merging commonly occurs among different organizations where the knowledge describing the same domain is to be matched. Due to the different naming conventions, granularity and the use of concepts in different contexts, a semantic approach to this problem is preferred in comparison to syntactic approach that performs matches based upon the labels only. We propose a concept matching method that initially does not consider labels when forming candidate matches, but rather utilizes structural information to take the context into account and detect complex matches. Real world knowledge representations (schemas) are used to evaluate the method.
Showing items related by title, author, creator and subject.
Pan, Qi Hua; Hadzic, Fedja; Dillon, Tharam (2011)Knowledge matching is an important problem for many emerging applications in many areas including scientific knowledge management, ontology matching, e-commerce, and enterprise application integration. Matching the concepts ...
A service concept recommendation system for enhancing the dependability of semantic service matchmakers in the service ecosystem environmentDong, Hai; Hussain, Farookh Khadeer; Chang, Elizabeth (2010)A Service Ecosystem is a biological view of the business and software environment, which is comprised of a Service Use Ecosystem and a Service Supply Ecosystem. Service matchmakers play an important role in ensuring the ...
Tan, H.; Dillon, Tharam S.; Hadzic, Fedja; Chang, Elizabeth (2006)Our work is focused on the task of mining frequent subtrees from a database of rooted ordered labelled subtrees. Previously we have developed an efficient algorithm, MB3 , for mining frequent embedded subtrees from a ...