<div dir="ltr"><div><span style="font-family:verdana,sans-serif"> The Seventeenth International Workshop on</span><br></div><div><font face="verdana, sans-serif"> ONTOLOGY MATCHING<br> (OM-2022)<br> <a href="http://om2022.ontologymatching.org/" target="_blank">http://om2022.ontologymatching.org/</a><br> October 23rd or 24th, 2022,<br>International Semantic Web Conference (ISWC) Workshop Program,<br> Hybrid conference, Hangzhou, China </font> </div><div>=====================================================================</div><div><font face="verdana, sans-serif">The submission deadline for tech. papers is approaching in 2 weeks on Aug. 9th:</font></div><div><a href="https://www.easychair.org/conferences/?conf=om2022" target="_blank"><font face="verdana, sans-serif">https://www.easychair.org/conferences/?conf=om2022</font></a><br style="font-family:verdana,sans-serif"></div><div><div>=====================================================================</div></div><div><span style="font-family:verdana,sans-serif"> </span><br></div><div><font face="verdana, sans-serif">BRIEF DESCRIPTION AND OBJECTIVES</font><br><font face="verdana, sans-serif">Ontology matching is a key interoperability enabler for the Semantic Web,</font><br><font face="verdana, sans-serif">as well as a useful technique in some classical data integration tasks</font><br><font face="verdana, sans-serif">dealing with the semantic heterogeneity problem. It takes ontologies</font><br><font face="verdana, sans-serif">as input and determines as output an alignment, that is, a set of</font><br><font face="verdana, sans-serif">correspondences between the semantically related entities of those ontologies.</font><br><font face="verdana, sans-serif">These correspondences can be used for various tasks, such as ontology</font><br><font face="verdana, sans-serif">merging, data interlinking, query answering or navigation over knowledge graphs. </font><br><font face="verdana, sans-serif">Thus, matching ontologies enables the knowledge and data expressed</font><br><font face="verdana, sans-serif">with the matched ontologies to interoperate.</font><br><font face="verdana, sans-serif"><br>The workshop has three goals:<br>1.<br>To bring together leaders from academia, industry and user institutions<br>to assess how academic advances are addressing real-world requirements.<br>The workshop will strive to improve academic awareness of industrial<br>and final user needs, and therefore, direct research towards those needs.<br>Simultaneously, the workshop will serve to inform industry and user<br>representatives about existing research efforts that may meet their<br>requirements. The workshop will also investigate how the ontology<br>matching technology is going to evolve, especially with respect to<br>data interlinking, knowledge graph and web table matching tasks.<br><br></font><font face="verdana, sans-serif">2.<br>To conduct an extensive and rigorous evaluation of ontology matching<br>and instance matching (link discovery) approaches through<br>the OAEI (Ontology Alignment Evaluation Initiative) 2022 campaign:<br><a href="http://oaei.ontologymatching.org/2022/" target="_blank">http://oaei.ontologymatching.org/2022/</a><br><br>3. <br>To examine similarities and differences from other, old, new and emerging,<br>techniques and usages, such as web table matching or knowledge embeddings.<br><br></font><font face="verdana, sans-serif"><br></font></div><div><font face="verdana, sans-serif">TOPICS of interest include but are not limited to:<br> Business and use cases for matching (e.g., big, open, closed data);<br> Requirements to matching from specific application scenarios (e.g., public sector);<br> Application of matching techniques in real-world scenarios (e.g., in cloud, with mobile apps);<br> Formal foundations and frameworks for matching; <br> Novel matching methods, including link prediction, ontology-based access;<br> Matching and knowledge graphs;<br> Matching and deep learning;<br> Matching and embeddings;<br> Matching and big data;<br> Matching and linked data;<br> Instance matching, data interlinking and relations between them;<br> Privacy-aware matching;<br> Process model matching;<br> Large-scale and efficient matching techniques;<br> Matcher selection, combination and tuning;<br> User involvement (including both technical and organizational aspects);<br> Explanations in matching;<br> Social and collaborative matching;<br> Uncertainty in matching;<br> Expressive alignments; <br> Reasoning with alignments;<br> Alignment coherence and debugging;<br> Alignment management;<br> Matching for traditional applications (e.g., data science);<br> Matching for emerging applications (e.g., web tables, knowledge graphs).</font></div><div><font face="verdana, sans-serif"><br></font></div><div><font face="verdana, sans-serif"><br></font><font face="verdana, sans-serif">SUBMISSIONS<br>Contributions to the workshop can be made in terms of technical papers and<br>posters/statements of interest addressing different issues of ontology matching<br>as well as participating in the OAEI 2022 campaign. Long technical papers should<br>be of max. 12 pages. Short technical papers should be of max. 5 pages.<br>Posters/statements of interest should not exceed 2 pages.<br>All contributions have to be prepared using the LNCS Style:<br><a href="http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0" target="_blank">http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0</a><br>and should be submitted in PDF format (no later than August 9th, 2022)<br>through the workshop submission site at:<br><br><a href="https://www.easychair.org/conferences/?conf=om2022" target="_blank">https://www.easychair.org/conferences/?conf=om2022</a><br><br>Contributors to the OAEI 2022 campaign have to follow the campaign conditions<br>and schedule at <a href="http://oaei.ontologymatching.org/2022/" target="_blank">http://oaei.ontologymatching.org/2022/</a>.<br><br><br>DATES FOR TECHNICAL PAPERS AND POSTERS:<br> August 9th, 2022: Deadline for the submission of papers.<br> September 6th, 2022: Deadline for the notification of acceptance/rejection.<br> September 20th, 2022: Workshop camera ready copy submission.<br> October 23rd or 24th, 2022: OM-2022, hybrid conference, Hangzhou, China.<br></font><font face="verdana, sans-serif"><br>Contributions will be refereed by the Program Committee.<br>Accepted papers will be published in the workshop proceedings </font></div><div><font face="verdana, sans-serif">as a volume of CEUR-WS as well as indexed on DBLP.<br><br><br>ORGANIZING COMMITTEE<br>1. Pavel Shvaiko (main contact)<br>Trentino Digitale, Italy<br> <br>2. Jérôme Euzenat<br>INRIA & Univ. Grenoble Alpes, France<br> <br>3. Ernesto Jiménez-Ruiz<br>City, University of London, UK & SIRIUS, University of Oslo, Norway<br><br>4. Oktie Hassanzadeh<br>IBM Research, USA<br><br>5. Cássia Trojahn<br>IRIT, France<br><br> <br>PROGRAM COMMITTEE:<br>Alsayed Algergawy, Jena University, Germany<br>Manuel Atencia, Universidad de Málaga, Spain<br>Jiaoyan Chen, University of Oxford, UK<br>Jérôme David, University Grenoble Alpes & INRIA, France<br>Gayo Diallo, University of Bordeaux, France</font></div><div><font face="verdana, sans-serif">Daniel Faria, Instituto Gulbenkian de Ciéncia, Portugal<br>Alfio Ferrara, University of Milan, Italy<br>Marko Gulic, University of Rijeka, Croatia<br>Wei Hu, Nanjing University, China<br>Ryutaro Ichise, National Institute of Informatics, Japan</font></div><div><font face="verdana, sans-serif">Antoine Isaac, Vrije Universiteit Amsterdam & Europeana, Netherlands<br>Naouel Karam, Fraunhofer, Germany<br>Prodromos Kolyvakis, EPFL, Switzerland<br>Patrick Lambrix, Linköpings Universitet, Sweden<br>Oliver Lehmberg, University of Mannheim, Germany<br>Fiona McNeill, University of Edinburgh, UK<br>Majid Mohammadi, Eindhoven University of Technology, </font><span style="font-family:verdana,sans-serif">Netherlands</span></div><div><font face="verdana, sans-serif">Hoa Ngo, CSIRO, Australia <br>George Papadakis, University of Athens, Greece<br>Henry Rosales-Méndez, University of Chile, Chile<br>Booma Sowkarthiga, Microsoft, USA</font></div><div><font face="verdana, sans-serif">Kavitha Srinivas, IBM, USA<br>Ludger van Elst, DFKI, Germany<br>Xingsi Xue, Fujian University of Technology, China<br>Ondrej Zamazal, Prague University of Economics, Czech Republic<br></font><span style="font-family:verdana,sans-serif">Songmao Zhang, Chinese Academy of Science, China</span></div><div><font face="verdana, sans-serif">Lu Zhou, TigerGraph, USA</font><span style="font-family:verdana,sans-serif"><br></span><font face="verdana, sans-serif"><br>-------------------------------------------------------<br>More about ontology matching:<br><a href="http://www.ontologymatching.org/" target="_blank">http://www.ontologymatching.org/</a><br><a href="http://book.ontologymatching.org/" target="_blank">http://book.ontologymatching.org/</a><br>-------------------------------------------------------<br> <br>Best Regards,<br>Pavel<br>-------------------------------------------------------<br>Pavel Shvaiko, PhD<br>Trentino Digitale, Italy<br><a href="http://www.ontologymatching.org/" target="_blank">http://www.ontologymatching.org/</a><br><a href="https://www.trentinodigitale.it/" target="_blank">https://www.trentinodigitale.it/</a><br><a href="http://www.dit.unitn.it/~pavel" target="_blank">http://www.dit.unitn.it/~pavel</a></font></div></div>
<br>
<div><font face="Arial" size="1">Cap. Soc. Euro 6.433.680,00 - REG. IMP. / C.F. / P.IVA 00990320228</font></div><div><font face="Arial" size="1">E-mail: <a href="mailto:tndigit@tndigit.it" target="_blank">tndigit@tndigit.it</a> - <a href="http://www.trentinodigitale.it" target="_blank">www.trentinodigitale.it</a></font></div><div><font face="Arial" size="1">Società soggetta ad attività di direzione e coordinamento da parte della Provincia Autonoma di Trento - C.Fisc. 00337460224.</font></div><div><font face="Arial" size="1">Questo messaggio è indirizzato esclusivamente ai destinatari in intestazione, può contenere informazioni protette e riservate ai sensi della normativa vigente e ne è vietato qualsiasi impiego diverso da quello per cui è stato inviato. Se lo avete ricevuto per errore siete pregati di eliminarlo in ogni sua parte e di avvisare il mittente</font></div><div style="font-family:Arial,Helvetica,sans-serif;font-size:1.3em"><br></div>