论文信息 - Alignment Results of Anchor-Flood Algorithm for OAEI-2008

Alignment Results of Anchor-Flood Algorithm for OAEI-2008

Our proposed algorithm called Anchor-Flood algorithm, starts off with anchors. It gradually explores concepts by collecting neighbors in concept taxonomy, thereby taking advantage of locality of reference in the graph data structure. Then local alignment process runs over the collected small blocks of concepts. The process is repeated for the newly found aligned pairs. In this way, we can significantly reduce the computational time for the alignment as our algorithm concentrates on the aligned pairs and it resolves the scalability problem in ontology alignment over large ontologies. Through several experiments against OAEI- 2008 datasets, we will demonstrate the results and the features of our Anchor-Food algorithm.

Masaki Aono | Md. Seddiqui Hanif

[1] Alan L. Rector,et al. Web ontology segmentation: analysis, classification and use , 2006, WWW '06.

[2] William E. Winkler,et al. The State of Record Linkage and Current Research Problems , 1999 .

[3] Jérôme Euzenat,et al. Similarity-Based Ontology Alignment in OWL-Lite , 2004, ECAI.

[4] John Fox,et al. The Knowledge Engineering Review , 1984, The Knowledge Engineering Review.

[5] Luciano Serafini,et al. Semantic Coordination: A New Approach and an Application , 2003, SEMWEB.

[6] Stefanos D. Kollias,et al. A String Metric for Ontology Alignment , 2005, SEMWEB.

[7] Fausto Giunchiglia,et al. Semantic Matching: Algorithms and Implementation , 2007, J. Data Semant..

[8] Fausto Giunchiglia,et al. S-Match: an Algorithm and an Implementation of Semantic Matching , 2004, ESWS.

[9] Erhard Rahm,et al. Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.