The Fifteenth International Workshop on Ontology Matching

Ontology matching is a key interoperability enabler for the Semantic Web, as well as a useful technique in some classical data integration tasks dealing with the semantic heterogeneity problem. It takes ontologies as input and determines as output an alignment, that is, a set of correspondences between the semantically related entities of those ontologies. These correspondences can be used for various tasks, such as ontology merging, data interlinking, query answering or navigation over knowledge graphs. Thus, matching ontologies enables the knowledge and data expressed with the matched ontologies to interoperate.

Audience:

The workshop encourages participation from academia, industry and user institutions with the emphasis on theoretical and practical aspects of ontology matching. On the one side, we expect representatives from industry and user organizations to present business cases and their requirements for ontology matching. On the other side, we expect academic participants to present their approaches vis-a-vis those requirements. The workshop provides an informal setting for researchers and practitioners from different related initiatives to meet and benefit from each other's work and requirements.

This year, in sync with the main conference, we encourage submissions specifically devoted to: (i) datasets, benchmarks and replication studies, services, software, methodologies, protocols and measures (not necessarily related to OAEI), and (ii) application of the matching technology in real-life scenarios and assessment of its usefulness to the final users.

Topics of interest include but are not limited to:

• Business and use cases for matching (e.g., big, open, closed data);
• Requirements to matching from specific application scenarios (e.g., public sector, homeland security);
• Application of matching techniques in real-world scenarios (e.g., in cloud, with mobile apps);
• Formal foundations and frameworks for matching;
• Novel matching methods, including link prediction, ontology-based data access;
• Matching and knowledge graphs;
• Matching and deep learning;
• Matching and embeddings;
• Matching and big data;
• Matching and linked data;
• Instance matching, data interlinking and relations between them;
• Privacy-aware matching;
• Process model matching;
• Large-scale and efficient matching techniques;
• Matcher selection, combination and tuning;
• User involvement (including both technical and organizational aspects);
• Explanations in matching;
• Social and collaborative matching;
• Uncertainty in matching;
• Expressive alignments;
• Reasoning with alignments;
• Alignment coherence and debugging;
• Alignment management;
• Matching for traditional applications (e.g., data science);
• Matching for emerging applications (e.g., web tables, knowledge graphs).

Contributions to the workshop can be made in terms of technical papers and posters/statements of interest addressing different issues of ontology matching as well as participating in the OAEI 2020 campaign. Long technical papers should be of max. 12 pages. Short technical papers should be of max. 5 pages. Posters/statements of interest should not exceed 2 pages. All contributions have to be prepared using the LNCS Style and should be submitted in PDF format (no later than August 10th, 2020) through the workshop submission site at:

https://www.easychair.org/conferences/?conf=om2020

Contributors to the OAEI 2020 campaign have to follow the campaign conditions and schedule at http://oaei.ontologymatching.org/2020/.

Long Technical Papers:

• Using domain lexicon and grammar for ontology matching
  Francisco José Quesada Real, Gábor Bella, Fiona McNeill, Alan Bundy
• Semantic schema mapping for interoperable data-exchange
  Harshvardhan J. Pandit, Damien Graux, Fabrizio Orlandi, Ademar Crotti Junior, Declan O'Sullivan, Dave Lewis
• A gold standard dataset for large knowledge graphs matching
  Omaima Fallatah, Ziqi Zhang, Frank Hopfgartner
• Applying edge-counting semantic similarities to link discovery: scalability and accuracy
  Kleanthi Georgala, Mohamed Ahmed Sherif, Michael Röder, Axel-Cyrille Ngonga Ngomo
• LIGON - link discovery with noisy oracles
  Mohamed Ahmed Sherif, Kevin Dreßler, Axel-Cyrille Ngonga Ngomo
• Supervised ontology and instance matching with MELT
  Sven Hertling, Jan Portisch, Heiko Paulheim

Organizing Committee:

• Pavel Shvaiko (Main contact)
  Trentino Digitale, Italy
  E-mail: pavel [dot] shvaiko [at] tndigit [dot] it
• Jérôme Euzenat
  INRIA & Univ. Grenoble Alpes, France
  
• Ernesto Jiménez-Ruiz
  City, University of London, UK & SIRIUS, University of Oslo, Norway
• Oktie Hassanzadeh
  IBM Research, USA
• Cássia Trojahn
  IRIT, France

Program Committee:

• Alsayed Algergawy, Jena University, Germany
• Manuel Atencia, INRIA & Univ. Grenoble Alpes, France
• Zohra Bellahsene, LIRMM, France
• Jiaoyan Chen, University of Oxford, UK
• Valerie Cross, Miami University, USA
• Jérôme David, University Grenoble Alpes & INRIA, France
• Gayo Diallo, University of Bordeaux, France
• Daniel Faria, Instituto Gulbenkian de Ciéncia, Portugal
• Alfio Ferrara, University of Milan, Italy
• Marko Gulić, University of Rijeka, Croatia
• Wei Hu, Nanjing University, China
• Ryutaro Ichise, National Institute of Informatics, Japan
• Antoine Isaac, Vrije Universiteit Amsterdam & Europeana, Netherlands
• Naouel Karam, Fraunhofer, Germany
• Prodromos Kolyvakis, EPFL, Switzerland
• Patrick Lambrix, Linköpings Universitet, Sweden
• Oliver Lehmberg, University of Mannheim, Germany
• Majeed Mohammadi, TU Delft, Netherlands
• Peter Mork, MITRE, USA
• Andriy Nikolov, Metaphacts GmbH, Germany
• George Papadakis, University of Athens, Greece
• Catia Pesquita, University of Lisbon, Portugal
• Henry Rosales-Méndez, University of Chile, Chile
• Kavitha Srinivas, IBM, USA
• Giorgos Stoilos, Huawei Technologies, Greece
• Pedro Szekely, University of Southern California, USA
• Ludger van Elst, DFKI, Germany
• Xingsi Xue, Fujian University of Technology, China
• Ondřej Zamazal, Prague University of Economics, Czech Republic
• Songmao Zhang, Chinese Academy of Sciences, China

Acknowledgements: