Search Results

Documents authored by Le, Linh

Artifact
Software
DOI: 10.4230/artifacts.22529
MELArt Dataset Generation

Authors: Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, and Ralf Krestel

Abstract
Cite as

Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, Ralf Krestel. MELArt Dataset Generation (Software, Dataset generation code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-22529,
   title = {{MELArt Dataset Generation}}, 
   author = {Sierra-M\'{u}nera, Alejandro and Le, Linh and Demartini, Gianluca and Krestel, Ralf},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:ec4380448f4087c011040d0e3dca7832baa11182;origin=https://github.com/HPI-Information-Systems/MELArt;visit=swh:1:snp:9b0a0c452561dcdc103f9ed0a9f04c47b9d44e9d;anchor=swh:1:rev:87d105610ce56b43f713e71996aab2d4870cdbc3}{\texttt{swh:1:dir:ec4380448f4087c011040d0e3dca7832baa11182}} (visited on 2024-12-18)},
   url = {https://github.com/HPI-Information-Systems/MELArt},
   doi = {10.4230/artifacts.22529},
}
Artifact
Software
DOI: 10.4230/artifacts.22616
MELArt Experiments

Authors: Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, and Ralf Krestel

Abstract
Cite as

Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, Ralf Krestel. MELArt Experiments (Software, Experiments code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@misc{dagpub-supp--paper-21824-urlgithub.com-HPI-Information-Systems-MELArt_experiments,
   title = {{MELArt Experiments}}, 
   author = {Sierra-M\'{u}nera, Alejandro and Le, Linh and Demartini, Gianluca and Krestel, Ralf},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:203f2a69c5bc9064db3873a0160ca52f62095c25;origin=https://github.com/HPI-Information-Systems/MELArt_experiments;visit=swh:1:snp:18220ea00d0e05c5cc15921eb46ad2ec7b7cadaa;anchor=swh:1:rev:2a727327612af583acb11103aa1291bec66a6749}{\texttt{swh:1:dir:203f2a69c5bc9064db3873a0160ca52f62095c25}} (visited on 2024-12-18)},
   url = {https://github.com/HPI-Information-Systems/MELArt_experiments},
   doi = {10.4230/artifacts.22616},
}
Document
Resource Paper
DOI: 10.4230/TGDK.2.2.8
MELArt: A Multimodal Entity Linking Dataset for Art

Authors: Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, and Ralf Krestel

Published in: TGDK, Volume 2, Issue 2 (2024): Special Issue on Resources for Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 2, Issue 2

Abstract
Traditional named entity linking (NEL) tools have largely employed a general-domain approach, spanning across various entity types such as persons, organizations, locations, and events in a multitude of contexts. While multimodal entity linking datasets exist (e.g., disambiguation of person names with the help of photographs), there is a need to develop domain-specific resources that represent the unique challenges present in domains like cultural heritage (e.g., stylistic changes through time, diversity of social and political context). To address this gap, our work presents a novel multimodal entity linking benchmark dataset for the art domain together with a comprehensive experimental evaluation of existing NEL methods on this new dataset. The dataset encapsulates various entities unique to the art domain. During the dataset creation process, we also adopt manual human evaluation, providing high-quality labels for our dataset. We introduce an automated process that facilitates the generation of this art dataset, harnessing data from multiple sources (Artpedia, Wikidata and Wikimedia Commons) to ensure its reliability and comprehensiveness. Furthermore, our paper delineates best practices for the integration of art datasets, and presents a detailed performance analysis of general-domain entity linking systems, when applied to domain-specific datasets. Through our research, we aim to address the lack of datasets for NEL in the art domain, providing resources for the development of new, more nuanced, and contextually rich entity linking methods in the realm of art and cultural heritage.
Cite as

Alejandro Sierra-Múnera, Linh Le, Gianluca Demartini, and Ralf Krestel. MELArt: A Multimodal Entity Linking Dataset for Art. In Special Issue on Resources for Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 2, Issue 2, pp. 8:1-8:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{sierramunera_et_al:TGDK.2.2.8,
  author =	{Sierra-M\'{u}nera, Alejandro and Le, Linh and Demartini, Gianluca and Krestel, Ralf},
  title =	{{MELArt: A Multimodal Entity Linking Dataset for Art}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{8:1--8:22},
  ISSN =	{2942-7517},
  year =	{2024},
  volume =	{2},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.2.2.8},
  URN =		{urn:nbn:de:0030-drops-225921},
  doi =		{10.4230/TGDK.2.2.8},
  annote =	{Keywords: A Multimodal Entity Linking Dataset, Named Entity Linking, Art Domain, Wikidata, Wikimedia, Artpedia}
}
Document
DOI: 10.4230/LIPIcs.FSTTCS.2019.21
The Complexity of Finding S-Factors in Regular Graphs

Authors: Sanjana Kolisetty, Linh Le, Ilya Volkovich, and Mihalis Yannakakis

Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)

Abstract
A graph G has an S-factor if there exists a spanning subgraph F of G such that for all v in V: deg_F(v) in S. The simplest example of such factor is a 1-factor, which corresponds to a perfect matching in a graph. In this paper we study the computational complexity of finding S-factors in regular graphs. Our techniques combine some classical as well as recent tools from graph theory.
Cite as

Sanjana Kolisetty, Linh Le, Ilya Volkovich, and Mihalis Yannakakis. The Complexity of Finding S-Factors in Regular Graphs. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 21:1-21:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{kolisetty_et_al:LIPIcs.FSTTCS.2019.21,
  author =	{Kolisetty, Sanjana and Le, Linh and Volkovich, Ilya and Yannakakis, Mihalis},
  title =	{{The Complexity of Finding S-Factors in Regular Graphs}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{21:1--21:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Chattopadhyay, Arkadev and Gastin, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.21},
  URN =		{urn:nbn:de:0030-drops-115834},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.21},
  annote =	{Keywords: constraint satisfaction problem, Dichotomy theorem, Graph Factors, Regular Graphs}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact