1 What is AGDISTIS

AGDISTIS combines the HITS algorithm with label expansion strategies and string similarity measures. Based on this combination, it can efficiently detect the correct URIs for a given set of named entities within an input text.

For more information, have a look at our paper from ISWC 2014: AGDISTIS - Graph-Based Disambiguation of Named Entities using Linked Data.

If you want to cite us, please use:

@InProceedings{Moussallem2017,
  author       = {Diego Moussallem and Ricardo Usbeck and Michael R{\"o}der and Axel-Cyrille {Ngonga Ngomo}},
  title        = {{MAG: A Multilingual, Knowledge-base Agnostic and Deterministic Entity Linking Approach}},
  booktitle    = {K-CAP 2017: Knowledge Capture Conference},
  year         = {2017},
  pages        = {8},
  organization = {ACM},
  url          = {https://svn.aksw.org/papers/2017/KCAP_MAG/sigconf-main.pdf},
}

@incollection{AGDISTIS_ISWC,
  author = {Usbeck, Ricardo and {Ngonga Ngomo}, Axel-Cyrille and Auer, S{\"o}ren and Gerber, Daniel and Both, Andreas},
  booktitle = {13th International Semantic Web Conference},
  title = {AGDISTIS - Graph-Based Disambiguation of Named Entities using Linked Data},
  url = {http://svn.aksw.org/papers/2014/ISWC_AGDISTIS/public.pdf},
  year = 2014
}