P
Pavel Shvaiko
Researcher at University of Trento
Publications - 83
Citations - 10489
Pavel Shvaiko is an academic researcher from University of Trento. The author has contributed to research in topics: Ontology alignment & Ontology (information science). The author has an hindex of 33, co-authored 83 publications receiving 10288 citations. Previous affiliations of Pavel Shvaiko include Stanford University.
Papers
More filters
Journal Article
Community-Driven Ontology Matching
Anna V. Zhdanova,Pavel Shvaiko +1 more
TL;DR: In this paper, the notion of ontology matching is extended to community-driven ontology mapping, and the idea is to enable Web communities to establish and reuse ontology mappings in order to achieve, within those communities, an adequate and timely domain representation, facilitated knowledge exchange, etc.
Proceedings Article
Results of the ontology alignment evaluation initiative 2007
Jérôme Euzenat,Antoine Isaac,Christian Meilicke,Pavel Shvaiko,Heiner Stuckenschmidt,Ondřej Šváb,Vojtech Svátek,Willem Robert van Hage,Mikalai Yatskevich +8 more
TL;DR: The OAEI-2007 ontology matching campaign as mentioned in this paper had 4 tracks with 7 test sets followed by 18 participants, which is a major increase in the number of participants compared to the previous years.
Proceedings Article
Results of the ontology alignment evaluation initiative 2008
Caterina Caracciolo,Jérôme Euzenat,Laura Hollink,Ryutaro Ichise,Antoine Isaac,Véronique Malaisé,Christian Meilicke,Juan Pane,Pavel Shvaiko,Heiner Stuckenschmidt,Ondřej Šváb-Zamazal,Vojtech Svátek +11 more
TL;DR: The OAEI-2008 ontology matching campaign as mentioned in this paper has four tracks with 8 test sets followed by 13 participants, and the official results of the campaign are those published on the ODEI web site.
A Large Scale Dataset for the Evaluation of Ontology Matching Systems
TL;DR: An ontology matching evaluation dataset composed of thousands of matching tasks, called TaxME2, which is built semi-automatically out of the Google, Yahoo and Looksmart web directories and evaluated by exploiting the results of almost two dozen of state of the art ontological matching systems.
Proceedings Article
Approximate structure preserving semantic matching
TL;DR: In this article, a new matching operation, called structure-preserving matching, is proposed, which takes two graph-like structures and produces a set of correspondences between those nodes of the graphs that correspond semantically to one another.