@inproceedings{khalife-vazirgiannis-2019-scalable,
    title = "Scalable graph-based method for individual named entity identification",
    author = "Khalife, Sammy  and
      Vazirgiannis, Michalis",
    editor = "Ustalov, Dmitry  and
      Somasundaran, Swapna  and
      Jansen, Peter  and
      Glava{\v{s}}, Goran  and
      Riedl, Martin  and
      Surdeanu, Mihai  and
      Vazirgiannis, Michalis",
    booktitle = "Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13)",
    month = nov,
    year = "2019",
    address = "Hong Kong",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/Author-page-Marten-During-lu/D19-5303/",
    doi = "10.18653/v1/D19-5303",
    pages = "17--25",
    abstract = "In this paper, we consider the named entity linking (NEL) problem. We assume a set of queries, named entities, that have to be identified within a knowledge base. This knowledge base is represented by a text database paired with a semantic graph, endowed with a classification of entities (ontology). We present state-of-the-art methods in NEL, and propose a new method for individual identification requiring few annotated data samples. We demonstrate its scalability and performance over standard datasets, for several ontology configurations. Our approach is well-motivated for integration in real systems. Indeed, recent deep learning methods, despite their capacity to improve experimental precision, require lots of parameter tuning along with large volume of annotated data."
}