SeeCOnt: A New Seeding-Based Clustering Approach for Ontology Matching

Ontology matching plays a crucial role to resolve semantic heterogeneities within knowledge-based systems. However, ontologies contain a massive number of concepts, resulting in performance impediments during the ontology matching process. With the increasing number of ontology concepts, there is a growing need to focus more on large-scale matching problems. To this end, in this paper, we come up with a new partitioning-based matching approach, where a new clustering method for partitioning concepts of ontologies is introduced. The proposed method, called SeeCOnt, is a seeding-based clustering technique aiming to reduce the complexity of comparison by only using clusters’ seed. In particular, SeeCOnt first identifies and determines the seeds of clusters based on the highest ranked concepts using a distribution condition, then the remaining concepts are placed into the proper cluster by defining and utilizing a membership function. The SeeCOnt method can improve the memory consuming problem in the large-scale matching problem, as well as it increases the matching quality. The experimental evaluation shows that SeeCOnt, compared with the top ten participant systems in OAEI, demonstrates acceptable results.

[1]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

[2]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[3]  Steffen Staab,et al.  QOM - Quick Ontology Mapping , 2004, GI Jahrestagung.

[4]  Erhard Rahm,et al.  A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[5]  Yuzhong Qu,et al.  Partition-Based Block Matching of Large Class Hierarchies , 2006, ASWC.

[6]  Erhard Rahm,et al.  Towards Large-Scale Schema and Ontology Matching , 2011, Schema Matching and Mapping.

[7]  James A. Hendler,et al.  Agents and the Semantic Web , 2001, IEEE Intell. Syst..

[8]  Masaki Aono,et al.  An efficient and scalable algorithm for segmented alignment of ontologies of arbitrary size , 2009, J. Web Semant..

[9]  Richi Nayak,et al.  Element similarity measures in XML schema matching , 2010, Inf. Sci..

[10]  James A. Hendler,et al.  A Method to Rank Nodes in an RDF Graph , 2008, International Semantic Web Conference.

[11]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[12]  Shensheng Zhang,et al.  Matching Large Scale Ontology Effectively , 2006, ASWC.

[13]  Anne-Marie Kermarrec,et al.  Second order centrality: Distributed assessment of nodes criticity in complex networks , 2011, Comput. Commun..

[14]  Yuzhong Qu,et al.  Matching large ontologies: A divide-and-conquer approach , 2008, Data Knowl. Eng..

[15]  Juan-Zi Li,et al.  A gauss function based approach for unbalanced ontology matching , 2009, SIGMOD Conference.

[16]  Jérôme Euzenat,et al.  Ontology Matching: State of the Art and Future Challenges , 2013, IEEE Transactions on Knowledge and Data Engineering.

[17]  Alon Y. Halevy,et al.  Semantic Integration Research in the Database Community : A Brief Survey , 2005 .

[18]  Erhard Rahm,et al.  Schema Matching and Mapping , 2013, Schema Matching and Mapping.

[19]  Erhard Rahm,et al.  Matching large schemas: Approaches and evaluation , 2007, Inf. Syst..

[20]  Erhard Rahm,et al.  A Clustering-Based Approach for Large-Scale Ontology Matching , 2011, ADBIS.