[OM-2019] 1st CFP: 14th workshop on Ontology Matching collocated with ISWC
Pavel Shvaiko <[email protected]> Thu, 18 Apr 2019 13:53:04 +0200
| Newsgroups | gmane.org.wikimedia.wikidata,gmane.org.w3c.semantic-web,gmane.org.w3c.announce |
|---|---|
| Message-ID | <CAMcFta0SnJ36czCtHtLnx0EaBJjHc5LDL1naQ2q8X7teW_hTag@mail.gmail.com> |
--===============4722720089914749061==
Content-Type: multipart/alternative; boundary="000000000000bdd5fe0586cca558"
--000000000000bdd5fe0586cca558
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
---------------------------------------------------------------------------=
---
CALL FOR CONTRIBUTIONS
THE SUBMISSION DEADLINE IS ON JUNE 28TH, 2019
---------------------------------------------------------------------------=
---
The Fourteenth International Workshop on
ONTOLOGY MATCHING
(OM-2019)
http://om2019.ontologymatching.org/
October 26th or 27th, 2019, ISWC Workshop Program,
Auckland, New Zealand
BRIEF DESCRIPTION AND OBJECTIVES
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 process mapping.
Thus, matching ontologies enables the knowledge and data expressed
with the matched ontologies to interoperate.
The workshop has three goals:
1.
To bring together leaders from academia, industry and user institutions
to assess how academic advances are addressing real-world requirements.
The workshop will strive to improve academic awareness of industrial
and final user needs, and therefore, direct research towards those needs.
Simultaneously, the workshop will serve to inform industry and user
representatives about existing research efforts that may meet their
requirements. The workshop will also investigate how the ontology
matching technology is going to evolve, especially with respect to
data interlinking, process mapping and web table matching tasks.
2.
To conduct an extensive and rigorous evaluation of ontology matching
and instance matching (link discovery) approaches through
the OAEI (Ontology Alignment Evaluation Initiative) 2019 campaign:
http://oaei.ontologymatching.org/2019/
3. To examine new uses, similarities and differences from database
schema matching, which has received decades of attention
but is just beginning to transition to mainstream tools.
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., with
environmental data);
Formal foundations and frameworks for matching;
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;
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)=
.
SUBMISSIONS
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 2019 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:
http://www.springer.com/computer/lncs?SGWID=3D0-164-6-793341-0
and should be submitted in PDF format (no later than June 28th, 2019)
through the workshop submission site at:
https://www.easychair.org/conferences/?conf=3Dom2019
Contributors to the OAEI 2019 campaign have to follow the campaign
conditions
and schedule at http://oaei.ontologymatching.org/2019/.
DATES FOR TECHNICAL PAPERS AND POSTERS:
June 28th, 2019: Deadline for the submission of papers.
July 24th, 2019: Deadline for the notification of acceptance/rejection.
August 26th, 2019: Workshop camera ready copy submission.
October 26th or 27th, 2019: OM-2019, Auckland, New Zealand.
Contributions will be refereed by the Program Committee.
Accepted papers will be published in the workshop proceedings as a volume
of CEUR-WS
as well as indexed on DBLP.
ORGANIZING COMMITTEE
1. Pavel Shvaiko (main contact)
Trentino Digitale, Italy
2. J=C3=A9r=C3=B4me Euzenat
INRIA & Univ. Grenoble Alpes, France
3. Ernesto Jim=C3=A9nez-Ruiz
The Alan Turing Institute, UK & University of Oslo, Norway
4. Oktie Hassanzadeh
IBM Research, USA
5.C=C3=A1ssia 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=C3=A9r=C3=B4me David, University Grenoble Alpes & INRIA, France
Gayo Diallo, University of Bordeaux, France
Warith Eddine Djeddi, LIPAH & LABGED, Tunisia
AnHai Doan, University of Wisconsin, USA
Alfio Ferrara, University of Milan, Italy
Marko Gulic, University of Rijeka, Croatia
Wei Hu, Nanjing University, China
Ryutaro Ichise, National Institute of Informatics, Japan
Antoine Isaac, Vrije Universiteit Amsterdam & Europeana, Netherlands
Simon Kocbek, University of Melbourne, Australia
Prodromos Kolyvakis, EPFL, Switzerland
Patrick Lambrix, Link=C3=B6pings Universitet, Sweden
Oliver Lehmberg, University of Mannheim, Germany
Vincenzo Maltese, University of Trento, Italy
Fiona McNeill, University of Edinburgh, UK
Christian Meilicke, University of Mannheim, Germany
Peter Mork, MITRE, USA
Andriy Nikolov, Metaphacts GmbH, Germany
Axel Ngonga, University of Paderborn, Germany
George Papadakis, University of Athens, Greece
Catia Pesquita, University of Lisbon, Portugal
Henry Rosales-M=C3=A9ndez, University of Chile, Chile
Juan Sequeda, Capsenta, USA
Kavitha Srinivas, IBM, USA
Giorgos Stoilos, National Technical University of Athens, Greece
Pedro Szekely, University of Southern California, USA
Valentina Tamma, University of Liverpool, UK
Ludger van Elst, DFKI, Germany
Xingsi Xue, Fujian University of Technology, China
Ondrej Zamazal, Prague University of Economics, Czech Republic
Songmao Zhang, Chinese Academy of Sciences, China
-------------------------------------------------------
More about ontology matching:
http://www.ontologymatching.org/
http://book.ontologymatching.org/
-------------------------------------------------------
Best Regards,
Pavel
-------------------------------------------------------
Pavel Shvaiko, PhD
Trentino Digitale, Italy
http://www.ontologymatching.org/
https://www.trentinodigitale.it/
http://www.dit.unitn.it/~pavel
--=20
Cap. Soc. Euro=C2=A06.433.680,00 - REG. IMP. / C.F. / P.IVA 00990320228
E-mail:=20
[email protected] <mailto:[email protected]>=C2=A0- www.trentinodigitale.it=
=20
<http://www.infotn.it>
Societ=C3=A0 soggetta ad attivit=C3=A0 di direzione e=20
coordinamento da parte della Provincia Autonoma di Trento - C.Fisc.=20
00337460224.
Questo messaggio =C3=A8 indirizzato esclusivamente ai destinatari=20
in intestazione, pu=C3=B2 contenere informazioni protette e riservate ai se=
nsi=20
della normativa vigente e ne =C3=A8 vietato qualsiasi impiego diverso da qu=
ello=20
per cui =C3=A8 stato inviato. Se lo avete ricevuto per errore siete pregati=
di=20
eliminarlo in ogni sua parte e di avvisare il mittente
--000000000000bdd5fe0586cca558
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr">
<div dir=3D"ltr"><span style=3D"font-family:verdana,sans-serif">-----------=
-------------------------------------------------------------------<br>=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0 CALL FOR CONTRIBUTIONS<br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 THE SUBMISSION DEADLINE IS ON JUNE =
28TH, 2019<br>-------------------------------------------------------------=
-----------------<br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 The Fourteenth International Workshop =
on <br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0 ONTOLOGY MATCHING<br>=C2=A0 =C2=A0=C2=A0 =C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0 (OM-2019)<br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0 <a href=3D"http://om2019.ontologymatching.org/" target=3D"_blank">http:=
//om2019.ontologymatching.org/</a><br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0 October 26th or 27th, 2019, ISWC Workshop Program,=
<br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 =C2=A0=C2=A0 =C2=A0=C2=A0=C2=
=A0=C2=A0 Auckland, New Zealand <br>=C2=A0 <br>BRIEF DESCRIPTION AND OBJECT=
IVES<br>Ontology matching is a key interoperability enabler for the Semanti=
c Web, <br>as well as a useful technique in some classical data integration=
tasks <br>dealing with the semantic heterogeneity problem. It takes ontolo=
gies <br>as input and determines as output an alignment, that is, a set of =
<br>correspondences between the semantically related entities of those onto=
logies. <br>These correspondences can be used for various tasks, such as on=
tology <br>merging, data interlinking, query answering or process mapping. =
<br>Thus, matching ontologies enables the knowledge and data expressed <br>=
with the matched ontologies to interoperate.<br><br><br>The workshop has th=
ree 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 awaren=
ess 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 respe=
ct to <br>data interlinking, process mapping and web table matching tasks.<=
br><br>2. <br>To conduct an extensive and rigorous evaluation of ontology m=
atching <br>and instance matching (link discovery) approaches through <br>t=
he OAEI (Ontology Alignment Evaluation Initiative) 2019 campaign:<br><a hre=
f=3D"http://oaei.ontologymatching.org/2019/" target=3D"_blank">http://oaei.=
ontologymatching.org/2019/</a><br><br>3. To examine new uses, similarities =
and differences from database <br>schema matching, which has received decad=
es of attention <br>but is just beginning to transition to mainstream tools=
.<br><br></span></div><div dir=3D"ltr"><span style=3D"font-family:verdana,s=
ans-serif"><br></span></div><div dir=3D"ltr"><span style=3D"font-family:ver=
dana,sans-serif">This year, in sync with the main conference, we encourage =
submissions <br>specifically devoted to: (i) datasets, benchmarks and repli=
cation studies, <br>services, software, methodologies, protocols and measur=
es <br>(not necessarily related to OAEI), and (ii) application of <br>the m=
atching technology in real-life scenarios and assessment <br>of its usefuln=
ess to the final users.<br><br><br>TOPICS of interest include but are not l=
imited to: <br>=C2=A0=C2=A0=C2=A0 Business and use cases for matching (e.g.=
, big, open, closed data);<br>=C2=A0=C2=A0=C2=A0 Requirements to matching f=
rom specific application scenarios (e.g., public sector, homeland security)=
;<br>=C2=A0=C2=A0=C2=A0 Application of matching techniques in real-world sc=
enarios (e.g., with environmental data);<br>=C2=A0=C2=A0=C2=A0 Formal found=
ations and frameworks for matching;<br>=C2=A0=C2=A0=C2=A0 Matching and know=
ledge graphs;<br>=C2=A0=C2=A0=C2=A0 Matching and deep learning;<br>=C2=A0=
=C2=A0=C2=A0 Matching and embeddings;<br>=C2=A0=C2=A0=C2=A0 Matching and bi=
g data;<br>=C2=A0=C2=A0=C2=A0 Matching and linked data;<br>=C2=A0=C2=A0=C2=
=A0 Instance matching, data interlinking and relations between them;<br>=C2=
=A0=C2=A0=C2=A0 Privacy-aware matching;<br>=C2=A0=C2=A0=C2=A0 Process model=
matching;<br>=C2=A0=C2=A0=C2=A0 Large-scale and efficient matching techniq=
ues;<br>=C2=A0=C2=A0=C2=A0 Matcher selection, combination and tuning;<br>=
=C2=A0=C2=A0=C2=A0 User involvement (including both technical and organizat=
ional aspects);<br>=C2=A0=C2=A0=C2=A0 Explanations in matching;<br>=C2=A0=
=C2=A0=C2=A0 Social and collaborative matching;<br>=C2=A0=C2=A0=C2=A0 Uncer=
tainty in matching;<br>=C2=A0=C2=A0=C2=A0 Reasoning with alignments;<br>=C2=
=A0=C2=A0=C2=A0 Alignment coherence and debugging;<br>=C2=A0=C2=A0=C2=A0 Al=
ignment management;<br>=C2=A0=C2=A0=C2=A0 Matching for traditional applicat=
ions (e.g., data science);<br>=C2=A0=C2=A0=C2=A0 Matching for emerging appl=
ications (e.g., web tables, knowledge graphs).<br><br><br>SUBMISSIONS<br>Co=
ntributions to the workshop can be made in terms of technical papers and <b=
r>posters/statements of interest addressing different issues of ontology ma=
tching <br>as well as participating in the OAEI 2019 campaign. Long technic=
al 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 pag=
es. <br>All contributions have to be prepared using the LNCS Style:<br><a h=
ref=3D"http://www.springer.com/computer/lncs?SGWID=3D0-164-6-793341-0" targ=
et=3D"_blank">http://www.springer.com/computer/lncs?SGWID=3D0-164-6-793341-=
0</a><br>and should be submitted in PDF format (no later than June 28th, 20=
19) <br>through the workshop submission site at: <br><br><a href=3D"https:/=
/www.easychair.org/conferences/?conf=3Dom2019" target=3D"_blank">https://ww=
w.easychair.org/conferences/?conf=3Dom2019</a><br><br>Contributors to the O=
AEI 2019 campaign have to follow the campaign conditions <br>and schedule a=
t <a href=3D"http://oaei.ontologymatching.org/2019/" target=3D"_blank">http=
://oaei.ontologymatching.org/2019/</a>.<br><br><br>DATES FOR TECHNICAL PAPE=
RS AND POSTERS: <br>=C2=A0=C2=A0=C2=A0 June 28th, 2019: Deadline for the su=
bmission of papers.<br>=C2=A0=C2=A0=C2=A0 July 24th, 2019: Deadline for the=
notification of acceptance/rejection.<br>=C2=A0=C2=A0=C2=A0 August 26th, 2=
019: Workshop camera ready copy submission.<br>=C2=A0=C2=A0=C2=A0 October 2=
6th or 27th, 2019: OM-2019,=C2=A0 Auckland, New Zealand.<br><br>Contributio=
ns will be refereed by the Program Committee. <br>Accepted papers will be p=
ublished in the workshop proceedings as a volume of CEUR-WS <br>as well as =
indexed on DBLP.<br><br><br>ORGANIZING COMMITTEE<br>1. Pavel Shvaiko (main =
contact)<br>Trentino Digitale, Italy<br>=C2=A0<br>2. J=C3=A9r=C3=B4me Euzen=
at <br>INRIA & Univ. Grenoble Alpes, France<br>=C2=A0<br>3. Ernesto Jim=
=C3=A9nez-Ruiz <br>The Alan Turing Institute, UK & University of Oslo, =
Norway<br>=C2=A0<br>4. Oktie Hassanzadeh <br>IBM Research, USA<br><br>5.C=
=C3=A1ssia Trojahn<br>IRIT, France<br><br>=C2=A0<br>PROGRAM COMMITTEE:<br>A=
lsayed Algergawy, Jena University, Germany<br>Manuel Atencia, INRIA & U=
niv. Grenoble Alpes, France<br>Zohra Bellahsene, LIRMM, France<br>Jiaoyan C=
hen, University of Oxford, UK<br>Valerie Cross, Miami University, USA<br>J=
=C3=A9r=C3=B4me David, University Grenoble Alpes & INRIA, France<br>Gay=
o Diallo, University of Bordeaux, France<br>Warith Eddine Djeddi, LIPAH &am=
p; LABGED, Tunisia<br>AnHai Doan, University of Wisconsin, USA<br>Alfio Fer=
rara, University of Milan, Italy<br>Marko Gulic, University of Rijeka, Croa=
tia<br>Wei Hu, Nanjing University, China<br>Ryutaro Ichise, National Instit=
ute of Informatics, Japan<br>Antoine Isaac, Vrije Universiteit Amsterdam &a=
mp; Europeana, Netherlands<br>Simon Kocbek, University of Melbourne, Austra=
lia<br>Prodromos Kolyvakis, EPFL, Switzerland<br>Patrick Lambrix, Link=C3=
=B6pings Universitet, Sweden<br>Oliver Lehmberg, University of Mannheim, Ge=
rmany<br>Vincenzo Maltese, University of Trento, Italy<br>Fiona McNeill, Un=
iversity of Edinburgh, UK<br>Christian Meilicke, University of Mannheim, Ge=
rmany<br>Peter Mork, MITRE, USA<br>Andriy Nikolov, Metaphacts GmbH, Germany=
<br>Axel Ngonga, University of Paderborn, Germany<br>George Papadakis, Univ=
ersity of Athens, Greece<br>Catia Pesquita, University of Lisbon, Portugal<=
br>Henry Rosales-M=C3=A9ndez, University of Chile, Chile<br>Juan Sequeda, C=
apsenta, USA<br>Kavitha Srinivas, IBM, USA<br>Giorgos Stoilos, National Tec=
hnical University of Athens, Greece<br>Pedro Szekely, University of Souther=
n California, USA<br>Valentina Tamma, University of Liverpool, UK<br>Ludger=
van Elst, DFKI, Germany<br>Xingsi Xue, Fujian University of Technology, Ch=
ina<br>Ondrej Zamazal, Prague University of Economics, Czech Republic<br>So=
ngmao Zhang, Chinese Academy of Sciences, China<br><br>--------------------=
-----------------------------------<br>More about ontology matching: <br><a=
href=3D"http://www.ontologymatching.org/" target=3D"_blank">http://www.ont=
ologymatching.org/</a><br><a href=3D"http://book.ontologymatching.org/" tar=
get=3D"_blank">http://book.ontologymatching.org/</a><br>-------------------=
------------------------------------<br>=C2=A0<br>Best Regards,<br>Pavel<br=
>=C2=A0<br>-------------------------------------------------------<br>Pavel=
Shvaiko, PhD<br>Trentino Digitale, Italy<br><a href=3D"http://www.ontology=
matching.org/" target=3D"_blank">http://www.ontologymatching.org/</a><br><a=
href=3D"https://www.trentinodigitale.it/" target=3D"_blank">https://www.tr=
entinodigitale.it/</a> <br><a href=3D"http://www.dit.unitn.it/~pavel" targe=
t=3D"_blank">http://www.dit.unitn.it/~pavel</a></span></div>
</div>
<br>
<div><font face=3D"Arial" size=3D"1">Cap. Soc. Euro=C2=A0</font><span style=
=3D"font-family:Arial;font-size:x-small">6.433.680,00 - REG. IMP. / C.F. / =
P.IVA 00990320228</span></div><div><font face=3D"Arial" size=3D"1">E-mail: =
<a href=3D"mailto:[email protected]" target=3D"_blank">[email protected]</a=
>=C2=A0- <a href=3D"http://www.infotn.it" target=3D"_blank">www.trentinodig=
itale.it</a></font></div><div><font face=3D"Arial" size=3D"1">Societ=C3=A0 =
soggetta ad attivit=C3=A0 di direzione e coordinamento da parte della Provi=
ncia Autonoma di Trento - C.Fisc. 00337460224.</font></div><div><font face=
=3D"Arial" size=3D"1">Questo messaggio =C3=A8 indirizzato esclusivamente ai=
destinatari in intestazione, pu=C3=B2 contenere informazioni protette e ri=
servate ai sensi della normativa vigente e ne =C3=A8 vietato qualsiasi impi=
ego diverso da quello per cui =C3=A8 stato inviato. Se lo avete ricevuto pe=
r errore siete pregati di eliminarlo in ogni sua parte e di avvisare il mit=
tente</font></div>
--000000000000bdd5fe0586cca558--
--===============4722720089914749061==
Content-Type: text/plain; charset="utf-8"
MIME-Version: 1.0
Content-Transfer-Encoding: base64
Content-Disposition: inline
X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX18KV2lraWRhdGEg
bWFpbGluZyBsaXN0Cldpa2lkYXRhQGxpc3RzLndpa2ltZWRpYS5vcmcKaHR0cHM6Ly9saXN0cy53
aWtpbWVkaWEub3JnL21haWxtYW4vbGlzdGluZm8vd2lraWRhdGEK
--===============4722720089914749061==--