Pith. sign in

REVIEW 3 major objections 6 minor 60 references

Graph-Embedding Empowered Entity Retrieval

T0 review · 3 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Entity retrieval effectiveness depends critically on the choice of graph embedding and entity linker; the best results come from Wikipedia2Vec embeddings with concept-aware linkers and near-complete entity coverage.

desk verdict Useful systematic comparison, but an undisclosed interpolation weight λ undercuts the headline empirical claim. read the letter →

arxiv 2506.03895 v1 pith:KK6ZJ4DS submitted 2025-06-04 cs.IR

Emma J. Gerritse , Faegheh Hasibi , Arjen P. de Vries This is my paper
classification cs.IR MSC 68P20
keywords entityretrievalgraphembeddingsknowledgelinkingWikipedia2VecrerankingDBpedia-Entityconceptannotation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks a practical question: when using graph embeddings to re-rank entity retrieval results, which embedding method and which entity linker should you pick? Across three embedding families (skip-gram, random-walk, transition-based) and five linkers, the authors find that both choices significantly change effectiveness. The best system combines Wikipedia2Vec embeddings—which encode both Wikipedia's link graph and entity text—with linkers that annotate general concepts as well as named entities, and it pays to cover as many entities as possible in the embedding graph. On the DBpedia-Entity V2 collection this configuration raises NDCG@10 from 0.461 to 0.498 over the BM25F-CA baseline. A reader should care because most prior work fixed one embedding and one linker, leaving the real drivers of performance unexamined.

What carries the argument

The core mechanism is a two-stage reranking pipeline: an initial lexical model (BM25F-CA) produces candidate entities, and the candidates are rescored by the embedding-based similarity $F(e,E_q)=\sum_{e_q\in E_q} s(e_q)\,\cos(\vec{e},\vec{e_q})$, where $E_q$ is the set of entities a linker detects in the query, $s(e_q)$ the linker's confidence, and $\vec{e}$ an entity embedding. This score is interpolated with the baseline score through $\lambda \in [0,1]$, and for linkers that emit multiple query interpretations the maximum over interpretations is taken. The comparison is made meaningful by Wikipedia2Vec's joint objective $L = L_w + L_e + L_a$, which learns word vectors, entity vectors from link structure, and entity vectors from anchor-text context in one shared space; ablating the link term $L_e$ removes most of the retrieval gain, while coherence scores computed under the cluster hypothesis explain why the combined embeddings rank relevant entities closer.

What would settle it

Create a second, independently produced concept-inclusive annotation set for DBpedia-Entity V2 with at least two annotators and high inter-annotator agreement; if concept-aware linkers (TagMe, SMAPH, ELQ) no longer show a consistent NDCG advantage over named-entity-only linkers on this new ground truth, the claim that concepts are essential is an artifact of the first annotations.

Watch

Extended reading notes

Core claim

The central claim is that the choice of graph embedding and the choice of entity linker each materially change entity retrieval effectiveness, and that the best results come from a specific combination: an embedding method that jointly models link structure and textual descriptions (Wikipedia2Vec), an entity linker that recognizes both concepts and named entities, and an embedding graph that contains almost all entities of the target collection. The authors support this with a systematic comparison on DBpedia-Entity V2: re-ranking BM25F-CA with Wikipedia2Vec embeddings yields NDCG@10 0.484 with TagMe, and the union of all five linkers reaches 0.498, while structure-only or walk-based embeddings (ComplEx, RDF2Vec) lag unless large page-link files are added. They further show that a version of Wikipedia2Vec trained without the link graph produces worse clusters and lower retrieval effectiveness, supporting the conclusion that graph structure itself is a source of the gain.

Load-bearing premise

The conclusion that concept annotations are key rests on a new set of query annotations produced for this study by a single expert, with only moderate agreement (Cohen's kappa 0.54–0.59) on a 50-query subset.

Editorial extensions

If this is right

  • Entity retrieval systems should prefer graph embeddings that combine link structure with entity text, such as Wikipedia2Vec, over structure-only or walk-based embeddings.
  • Entity linkers that annotate both named entities and general concepts should be used, since concept annotations are what separate the best linkers (TagMe, SMAPH, ELQ) from the rest.
  • Maximizing entity coverage in the embedding graph is worth the extra training cost; the paper raises coverage from 75% to 97.6% and ties missing embeddings directly to retrieval losses.
  • Using the union of several linkers beats any single linker, suggesting that ensemble linking is a practical way to improve reranking without new training.
  • For transition- and walk-based embeddings such as ComplEx and RDF2Vec, including page-link triples is required to reach competitive coverage and effectiveness.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The coverage result suggests a cheap, general recipe for retrieval pipelines: train or select embeddings on recent knowledge-graph dumps with minimal entity-frequency filtering, and measure coverage against the target collection before doing any tuning.
  • The link-graph ablation implies that cluster-coherence diagnostics could substitute for expensive retrieval evaluations when choosing among candidate embeddings.
  • The union-of-linkers result indicates that combining outputs from several independent linkers is a low-effort way to push retrieval quality further, especially when linkers have complementary strengths.
  • If concept annotations are what drive the gains here, transformer-based entity rankers that already encode entity descriptions may show similar sensitivity; testing concept-aware versus named-entity-only annotations on those models is a natural next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper studies entity retrieval by re-ranking BM25F-CA results with graph-embedding-based similarity scores. It compares three embedding families (Wikipedia2Vec, RDF2Vec, ComplEx) and five entity linkers, introduces new concept-focused annotations for the DBpedia-Entity V2 collection, and evaluates combinations using NDCG@10/@100 with t-test significance. The central claim is that both the choice of graph embedding and the choice of entity linker significantly affect retrieval effectiveness, with Wikipedia2Vec and concept-aware linkers performing best, and that maximizing entity coverage is important.

Significance. The paper contributes a systematic empirical comparison with public code and annotations, and the finding that linker and embedding choices matter is plausible and practically relevant. However, the validity of the main comparisons rests on the unreported interpolation weight λ in Eq. (6) and on a single-annotator ground truth with moderate agreement; these issues must be resolved before the headline claims can be accepted.

major comments (3)
  1. [Section 3.4, Eq. (6), Section 5.5, Tables 4 and 5] The interpolation weight λ in Eq. (6) is never reported, and §5.5 refers to 'the lower value of λ' for the no-graph variant, implying that λ was adjusted per configuration. Since all headline numbers are computed from Eq. (6) as a convex combination of BM25F-CA and the embedding score F, an unreported and potentially configuration-specific λ makes the NDCG differences and the paired t-test significances in Tables 4 and 5 unverifiable and, if λ was tuned on the test queries, invalid. Please report the exact λ value(s) used for every configuration, state how they were chosen, and provide a sensitivity analysis of the main rankings to λ.
  2. [Section 4.2 and Table 4] The new Radboud annotations, created by a single expert annotator with Cohen's kappa 0.54–0.59 on a 50-query subset, are the sole basis for the conclusion that concept annotations are important and that TagMe, SMAPH, and ELQ are the best linkers (RQ1, Section 5.2). The moderate agreement and the fact that only one annotator labeled the full set leave open the possibility that the observed advantage of Radboud over Webis annotations in Table 4 is an artifact of idiosyncratic annotation decisions. Please provide the annotation guidelines, analyze the disagreement cases, and test whether the retrieval conclusions change when using only the 50 queries with multiple annotations or when using a more conservative evaluation that downweights uncertain annotations.
  3. [Section 5.3, Eq. (8)-(9), Figure 2] The coherence threshold τ is set to 'the highest value at which none of the box plots had a first quartile equal to 0' on the same 295 queries whose coherence scores are then compared in Figure 2. This data-dependent choice on the evaluation set makes the reported coherence differences (e.g., Wikipedia2Vec versus RDF2Vec and ComplEx) partly circular, and the paper should either pre-specify τ or demonstrate that the conclusions are stable across a range of τ values.
minor comments (6)
  1. [Section 3.3] In the description of the TransE scoring function, the vector expression is written as ||− →eh + − →r − − →eh||, which equals ||− →r ||; it should presumably be ||− →eh + − →r − − →et||.
  2. [Table 1] The column header 'T otal' contains a stray space.
  3. [Section 5.5 and Table 6] The query is referred to as 'spring shoe canada' in the text but 'spring shoes canada' in Table 6; please make these consistent.
  4. [Appendix A, Table 8] The third block of Table 8 is labeled 'Concepts' while the main text calls the same condition 'Radboud annotations'; this inconsistency should be fixed.
  5. [Section 4.4] The capitalization of RDF2Vec varies between 'RDF2vec' and 'RDF2Vec'; please standardize.
  6. [Section 4.4] The sentence 'we obtained them from the Nordlys package Hasibi et al. (2017a)' is missing a comma before the citation.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity; the central claims rest on an external test collection, but the unreported interpolation weight λ and the author-created annotations warrant a low-level caution.

full rationale

The paper's claimed derivation chain is the two-stage re-ranking defined by Eq. (5) (embedding similarity aggregated with linker confidences) and Eq. (6)/(7) (interpolation with BM25F-CA), evaluated on the external DBpedia-Entity V2 collection with standard NDCG@10/@100 and two-sided t-tests. No parameter of Eq. (5) is fitted to the retrieval qrels, and the comparison across linkers and embeddings is an empirical benchmark rather than a definitional identity. The main self-referential elements are the reuse of the authors' GEEER/Wikipedia2Vec setup from Gerritse et al. (2020) and the new Radboud annotations, but the former is replicated externally (Oza and Dietz, 2023) and the latter is a new data resource with acknowledged moderate inter-annotator agreement (Cohen's κ = 0.54–0.59, §4.2); neither makes the retrieval scores equivalent by construction. The most significant caveat is that the interpolation weight λ in Eq. (6) is never reported and §5.5 states 'probably due to the lower value of λ' when comparing graph vs no-graph variants, which means configuration-level NDCG differences cannot be fully reproduced and could in principle be confounded if λ varies per configuration. That is a reproducibility/validity risk, not a circular step, so it does not raise the circularity score beyond a minor self-citation level.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical or formal entities. Its additional assumptions are domain-level commitments about the validity of the test collection, the cluster hypothesis, linker confidence scores, and the newly created Radboud annotations. The free parameters reflect the undisclosed lambda, the data-dependent coherence threshold, and hand-chosen coverage settings for Wikipedia2Vec.

free parameters (3)
  • lambda (interpolation weight)
    Eq. 6 interpolates between the baseline score and the embedding similarity score. The paper never reports the value or a tuning procedure, yet all re-ranking results depend on it. It is presumably carried over from Gerritse et al. (2020), making it a hand-set or prior-fitted parameter.
  • tau (coherence threshold) = 0.7
    Section 5.3 selects tau via grid search as the highest value at which none of the box plots had a first quartile of zero, using the same 295 evaluation queries. This is a data-dependent choice that affects the coherence comparison and thus the interpretation of embedding quality.
  • Wikipedia2Vec coverage settings (min-entity-count, disambiguation) = min-entity-count=0, disambiguation=True
    Section 4.4 reports these settings as the ones that maximize entity coverage (97.6%). They were chosen by hand to reduce missing entities rather than to optimize retrieval effectiveness, and they influence which entities receive embeddings.
assumptions (4)
  • domain assumption DBpedia-Entity V2 relevance judgments are a valid ground truth for entity retrieval effectiveness.
    The paper's metrics, significance tests, and all comparative conclusions rely on this test collection (Section 4.1).
  • domain assumption Cluster hypothesis: relevant entities to a query should cluster together in the embedding space.
    Invoked in Section 5.3 as the basis for using query coherence scores as evidence of embedding suitability for retrieval.
  • domain assumption Entity linker outputs (confidence scores and interpretation sets) can be used directly as inputs to Eq. 5 without recalibration.
    The paper takes linker-provided confidence scores s(eq) at face value (Section 3.4), and does not analyze how linker calibration might affect re-ranking.
  • domain assumption The new Radboud annotations are accurate enough to serve as ground truth for the concept-versus-NE comparison.
    Section 4.2 reports one expert annotator for the full set and moderate inter-annotator agreement (kappa 0.54-0.59) on 50 queries. The RQ1 conclusions depend on this ground truth being reliable.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Graph-Embedding Empowered Entity Retrieval." pith.science (2026). https://pith.science/paper/KK6ZJ4DS

@misc{pith2026250603895,
  author       = {Pith},
  title        = {Pith review of: Graph-Embedding Empowered Entity Retrieval},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KK6ZJ4DS}},
  note         = {Machine review of arXiv:2506.03895}
}
read the original abstract

In this research, we investigate methods for entity retrieval using graph embeddings. While various methods have been proposed over the years, most utilize a single graph embedding and entity linking approach. This hinders our understanding of how different graph embedding and entity linking methods impact entity retrieval. To address this gap, we investigate the effects of three different categories of graph embedding techniques and five different entity linking methods. We perform a reranking of entities using the distance between the embeddings of annotated entities and the entities we wish to rerank. We conclude that the selection of both graph embeddings and entity linkers significantly impacts the effectiveness of entity retrieval. For graph embeddings, methods that incorporate both graph structure and textual descriptions of entities are the most effective. For entity linking, both precision and recall concerning concepts are important for optimal retrieval performance. Additionally, it is essential for the graph to encompass as many entities as possible.

Figures

Figures reproduced from arXiv: 2506.03895 by the authors.

Figure 1
Figure 1. A diagram illustrating our re-ranking approach for an example query with multi￾ple entity linking interpretations. The re-ranking method computes the similarity score (Eq. 5) between target entity (Programming Language) and linked entities in each query interpretation. These scores will then be combined with the score of the initial retriever (BM25 in this example). The maximum of these scores is considered as the f… view at source ↗
Figure 2
Figure 2. Query coherence score of three different graph embedding algorithms. Higher coherence score is better. Wikipedia2Vec has higher coherence scores compared to RDF2Vec and ComplEx . the same query and returns the percentage of items with a similarity score higher than a threshold. Formally, given a document set D, the coherence score is computed as: Co(D) = P i̸=j∈1,...,M δ(di , dj ) 1 2M(M − 1) , (8) where M is total … view at source ↗
Figure 3
Figure 3. Coherence score of all relevant entities per query, computed for the Wikipedia2Vec embeddings without and with link graph. The queries are ordered by the number of their relevant entities in the x-axis. invest in solving the missing entities for optimal performance. For ComplEx and RDF2Vec, including a sufficiently large number of entities in the graph is considerably important. 5.4 Wikipedia2Vec Embedding Analysis … view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: UMAP visualization of entity embeddings for a subset of queries. Color codes correspond to the relevant entities per query. Queries per code are listed in [PITH_FULL_IMAGE:figures/full_fig_p020_4.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

60 extracted references · 58 canonical work pages

  1. [1]

    Laque: Enabling entity search at scale

    Negar Arabzadeh, Amin Bigdeli, and Ebrahim Bagheri. Laque: Enabling entity search at scale. In Advances in Information Retrieval, pages 270--285, 2024

    work page 2024

  2. [2]

    Entity-oriented search, 2018

    Krisztian Balog. Entity-oriented search, 2018

    work page 2018

  3. [3]

    Translating embeddings for modeling multi-relational data

    Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. Translating embeddings for modeling multi-relational data. In Proc. of the 26th International Conference on Neural Information Processing Systems, pages 2787--2795. ACM, 2013

    work page 2013

  4. [4]

    L ib KGE - A knowledge graph embedding library for reproducible research

    Samuel Broscheit, Daniel Ruffinelli, Adrian Kochsiek, Patrick Betz, and Rainer Gemulla. L ib KGE - A knowledge graph embedding library for reproducible research. In Proc. of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 165--174, 2020

    work page 2020

  5. [5]

    BERT - ER : Query-specific BERT entity representations for entity ranking

    Shubham Chatterjee and Laura Dietz. BERT - ER : Query-specific BERT entity representations for entity ranking. In Proc. of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '22, page 1466–1477. Association for Computing Machinery, 2022

    work page 2022

  6. [6]

    MEKER : Memory efficient knowledge embedding representation for link prediction and question answering

    Viktoriia Chekalina, Anton Razzhigaev, Albert Sayapin, Evgeny Frolov, and Alexander Panchenko. MEKER : Memory efficient knowledge embedding representation for link prediction and question answering. In Proc. of the 60th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop, pages 355--365. Association for Computational...

    work page 2022

  7. [7]

    A coefficient of agreement for nominal scales

    Jacob Cohen. A coefficient of agreement for nominal scales. Educational and psychological measurement, 20 0 (1): 0 37--46, 1960

    1960

  8. [8]

    u d, and Hinrich Sch\

    Marco Cornolti, Paolo Ferragina, Massimiliano Ciaramita, Stefan R\" u d, and Hinrich Sch\" u tze. Smaph: A piggyback approach for entity-linking in web queries. ACM Trans. Inf. Syst., 37 0 (1), 2018. ISSN 1046-8188

    work page 2018

Show all 60 references
  1. [9]

    Openel: An annotated corpus for entity linking and discourse in open domain dialogue

    Wen Cui, Leanne Rolston, Marilyn Walker, and Beth Ann Hockey. Openel: An annotated corpus for entity linking and discourse in open domain dialogue. In Proc. of the Thirteenth Language Resources and Evaluation Conference, pages 2245--2256, 2022

    2022

  2. [10]

    Inductive entity representations from text via link prediction

    Daniel Daza, Michael Cochez, and Paul Groth. Inductive entity representations from text via link prediction. In Proc. of the Web Conference 2021, WWW '21, page 798–808, 2021

    2021

  3. [11]

    Neural ranking models with weak supervision

    Mostafa Dehghani, Hamed Zamani, Aliaksei Severyn, Jaap Kamps, and W Bruce Croft. Neural ranking models with weak supervision. Proc. of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 65--74, 2017

    2017

  4. [12]

    Building gold standard corpora for medical natural language processing tasks

    Louise Deleger, Qi Li, Todd Lingren, Megan Kaiser, Katalin Molnar, Laura Stoutenborough, Michal Kouril, Keith Marsolo, Imre Solti, et al. Building gold standard corpora for medical natural language processing tasks. In AMIA Annual Symposium Proceedings, volume 2012, page 144. ...

    2012

  5. [13]

    Query expansion with locally-trained word embeddings

    Fernando Diaz, Bhaskar Mitra, and Nick Craswell. Query expansion with locally-trained word embeddings. Proc. of the 54th Annual Meeting of the Association for Computational Linguistics, pages 367--377, 2016

    2016

  6. [14]

    Ent rank: Retrieving entities for topical information needs through entity-neighbor-text relations

    Laura Dietz. Ent rank: Retrieving entities for topical information needs through entity-neighbor-text relations. In Proc. of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'19, page 215–224, 2019

    2019

  7. [15]

    Trec car y3: Complex answer retrieval overview

    Laura Dietz and John Foley. Trec car y3: Complex answer retrieval overview. In Proc. of Text REtrieval Conference (TREC) , 2019

    2019

  8. [16]

    Tagme: on-the-fly annotation of short text fragments (by Wikipedia entities)

    Paolo Ferragina and Ugo Scaiella. Tagme: on-the-fly annotation of short text fragments (by Wikipedia entities). In Proc. of the 19th ACM international IW3C2 on Information and Knowledge Management, pages 1625--1628. ACM, 2010

    2010

  9. [17]

    Identifying and exploiting target entity type information for ad hoc entity retrieval

    Dar \' o Garigliotti, Faegheh Hasibi, and Krisztian Balog. Identifying and exploiting target entity type information for ad hoc entity retrieval. Information Retrieval Journal, 22 0 (3): 0 285--323, 2019

    2019

  10. [18]

    Graph-embedding empowered entity retrieval

    Emma Gerritse, Faegheh Hasibi, and Arjen De Vries. Graph-embedding empowered entity retrieval. In Proc. of the European Conference on Information Retrieval, ECIR '20, pages 97--110, 2020

    2020

  11. [19]

    Entity-aware Transformers for Entity Search

    Emma Gerritse, Faegheh Hasibi, and Arjen De Vries. Entity-aware Transformers for Entity Search . In Proc. of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '22, 2022

    2022

  12. [20]

    Entity linking in queries: Tasks and evaluation

    Faegheh Hasibi, Krisztian Balog, and Svein Erik Bratsberg. Entity linking in queries: Tasks and evaluation. In Proc. of ACM SIGIR International Conference on the Theory of Information Retrieval, ICTIR '15, pages 171--180, 2015

    2015

  13. [21]

    Exploiting entity linking in queries for entity retrieval

    Faegheh Hasibi, Krisztian Balog, and Svein Erik Bratsberg. Exploiting entity linking in queries for entity retrieval. In Proc. of the 2016 ACM International Conference on the Theory of Information Retrieval, pages 209--218. ACM, 2016

    2016

  14. [22]

    Nordlys: A toolkit for entity-oriented and semantic search

    Faegheh Hasibi, Krisztian Balog, Dar \' o Garigliotti, and Shuo Zhang. Nordlys: A toolkit for entity-oriented and semantic search. In Proc. of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 1289--1292. ACM, 2017 a

    2017

  15. [23]

    DBpedia-Entity V2 : A test collection for entity search

    Faegheh Hasibi, Fedor Nikolaev, Chenyan Xiong, Krisztian Balog, Svein Erik Bratsberg, Alexander Kotov, and Jamie Callan. DBpedia-Entity V2 : A test collection for entity search. In Proc. of the 40th International ACM SIGIR Conference on Research and Development in Information ...

    2017

  16. [24]

    Exploring topic structure: Coherence, diversity and relatedness

    Jiyin He. Exploring topic structure: Coherence, diversity and relatedness. PhD thesis, University of Amsterdam, 2011

    2011

  17. [25]

    Learning to rank knowledge subgraph nodes for entity retrieval

    Parastoo Jafarzadeh, Zahra Amirmahani, and Faezeh Ensan. Learning to rank knowledge subgraph nodes for entity retrieval. In Proc. of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '22, page 2519–2523, 2022

    2022

  18. [26]

    Personal entity, concept, and named entity linking in conversations

    Hideaki Joko and Faegheh Hasibi. Personal entity, concept, and named entity linking in conversations. In Proc. of the 31st ACM International Conference on Information & Knowledge Management, CIKM '22, page 4099–4103. Association for Computing Machinery, 2022

    2022

  19. [27]

    Resources for brewing beir: Reproducible reference models and statistical analyses

    Ehsan Kamalloo, Nandan Thakur, Carlos Lassance, Xueguang Ma, Jheng-Hong Yang, and Jimmy Lin. Resources for brewing beir: Reproducible reference models and statistical analyses. In Proc. of the 47th International ACM SIGIR Conference on Research and Development in Information R...

    2024

  20. [28]

    de Vries

    Chris Kamphuis, Faegheh Hasibi, Jimmy Lin, and Arjen P. de Vries. REBL: entity linking at scale (prototype). In Omar Alonso, Ricardo Baeza - Yates, Tracy Holloway King, and Gianmaria Silvello, editors, Proc. of the Third International Conference on Design of Experimental Searc...

    2022

  21. [29]

    Query Interpretations from Entity-Linked Segmentations

    Vaibhav Kasturia, Marcel Gohsen, and Matthias Hagen. Query Interpretations from Entity-Linked Segmentations . In 15th ACM International Conference on Web Search and Data Mining (WSDM 2022), pages 449--457, 2022

    2022

  22. [30]

    Simple embedding for link prediction in knowledge graphs

    Seyed Mehran Kazemi and David Poole. Simple embedding for link prediction in knowledge graphs. In Proc. of the 32nd International Conference on Neural Information Processing Systems, NIPS'18, page 4289–4300, 2018

    2018

  23. [31]

    The INCE p TION platform: Machine-assisted and knowledge-oriented interactive annotation

    Jan-Christoph Klie, Michael Bugert, Beto Boullosa, Richard Eckart de Castilho, and Iryna Gurevych. The INCE p TION platform: Machine-assisted and knowledge-oriented interactive annotation. In Proc. of the 27th International Conference on Computational Linguistics: System Demon...

    2018

  24. [32]

    Friendly neighbors: Contextualized sequence-to-sequence link prediction

    Adrian Kochsiek, Apoorv Saxena, Inderjeet Nair, and Rainer Gemulla. Friendly neighbors: Contextualized sequence-to-sequence link prediction. In Proc. of the 8th Workshop on Representation Learning for NLP (RepL4NLP 2023), pages 131--138. Association for Computational Linguistics, 2023

    2023

  25. [33]

    Li, Sewon Min, Srinivasan Iyer, Yashar Mehdad, and Wen-tau Yih

    Belinda Z. Li, Sewon Min, Srinivasan Iyer, Yashar Mehdad, and Wen-tau Yih. Efficient one-pass end-to-end entity linking for questions. In Proc. of the 2020 Conference on Empirical Methods in Natural Language Processing, pages 6433--6441. Association for Computational Linguistics, 2020

    2020

  26. [34]

    M o C o KGC : Momentum contrast entity encoding for knowledge graph completion

    Qingyang Li, Yanru Zhong, and Yuchu Qin. M o C o KGC : Momentum contrast entity encoding for knowledge graph completion. In Proc. of the 2024 Conference on Empirical Methods in Natural Language Processing, pages 14940--14952. Association for Computational Linguistics, 2024

    2024

  27. [35]

    Explore entity embedding effectiveness in entity retrieval

    Zhenghao Liu, Chenyan Xiong, Maosong Sun, and Zhiyuan Liu. Explore entity embedding effectiveness in entity retrieval. arXiv preprint arXiv:1908.10554, 2019

    1908 arXiv

  28. [36]

    When not to trust language models: Investigating effectiveness of parametric and non-parametric memories

    Alex Mallen, Akari Asai, Victor Zhong, Rajarshi Das, Daniel Khashabi, and Hannaneh Hajishirzi. When not to trust language models: Investigating effectiveness of parametric and non-parametric memories. In Proc. of the 61st Annual Meeting of the Association for Computational Lin...

    2023

  29. [37]

    Umap: Uniform manifold approximation and projection

    Leland McInnes, John Healy, Nathaniel Saul, and Lukas Grossberger. Umap: Uniform manifold approximation and projection. The Journal of Open Source Software, 3 0 (29): 0 861, 2018

    2018

  30. [38]

    Entity linking and retrieval for semantic search

    Edgar Meij, Krisztian Balog, and Daan Odijk. Entity linking and retrieval for semantic search. In Proc. of the 7th ACM International Conference on Web Search and Data Mining, WSDM '14, page 683–684. Association for Computing Machinery, 2014

    2014

  31. [39]

    Efficient estimation of word representations in vector space

    Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. Efficient estimation of word representations in vector space. In 1st International Conference on Learning Representations, ICLR , pages 1--12, 2013 a

    2013

  32. [40]

    Corrado, and Jeffrey Dean

    Tomas Mikolov, Ilya Sutskever, Kai Chen, Gregory S. Corrado, and Jeffrey Dean. Distributed representations of words and phrases and their compositionality. In Advances in Neural Information Processing Systems (NIPS), pages 3111--3119, 2013 b

    2013

  33. [41]

    Joint word and entity embeddings for entity retrieval from a knowledge graph

    Fedor Nikolaev and Alexander Kotov. Joint word and entity embeddings for entity retrieval from a knowledge graph. In Proc. of the European Conference on Information Retrieval, ECIR '20, pages 141--155, 2020

    2020

  34. [42]

    Entity embeddings for entity ranking: A replicability study

    Pooja Oza and Laura Dietz. Entity embeddings for entity ranking: A replicability study. In Proc. of the 45th European Conference on Information Retrieval, ECIR '23, pages 117--131, 2023

    2023

  35. [43]

    Glove: Global vectors for word representation

    Jeffrey Pennington, Richard Socher, and Christopher Manning. Glove: Global vectors for word representation. In Proc. of the 2014 Conference on Empirical Methods in Natural Language Processing, pages 1532--1543. ACL, 2014

    2014

  36. [44]

    Deepwalk: Online learning of social representations

    Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. Deepwalk: Online learning of social representations. In Proc. of the 20th ACM SIGKDD international Conference on Knowledge discovery and data mining, pages 701--710. ACM, 2014

    2014

  37. [45]

    E - BERT : Efficient-yet-effective entity embeddings for BERT

    Nina Poerner, Ulli Waltinger, and Hinrich Sch \"u tze. E - BERT : Efficient-yet-effective entity embeddings for BERT . In Findings of the Association for Computational Linguistics, ELMNLP '20, pages 803--818, 2020

    2020

  38. [46]

    C. J. van Rijsbergen. Information Retrieval, 2nd edition. Butterworths, 1979

    1979

  39. [47]

    RDF2Vec: RDF graph embeddings for data mining

    Petar Ristoski and Heiko Paulheim. RDF2Vec: RDF graph embeddings for data mining. In International Semantic Web Conference, pages 498--514. Springer, 2016

    2016

  40. [48]

    The probabilistic relevance framework: BM25 and beyond

    Stephen Robertson, Hugo Zaragoza, et al. The probabilistic relevance framework: BM25 and beyond. Foundations and Trends in Information Retrieval , 3 0 (4): 0 333--389, 2009

    2009

  41. [49]

    You CAN teach an old dog new tricks! on training knowledge graph embeddings

    Daniel Ruffinelli, Samuel Broscheit, and Rainer Gemulla. You CAN teach an old dog new tricks! on training knowledge graph embeddings. In International Conference on Learning Representations, 2020

    2020

  42. [50]

    Sequence-to-sequence knowledge graph completion and question answering

    Apoorv Saxena, Adrian Kochsiek, and Rainer Gemulla. Sequence-to-sequence knowledge graph completion and question answering. In Proc. of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 2814--2828. Association for Computati...

    2022

  43. [51]

    Fine tuning vs

    Heydar Soudani, Evangelos Kanoulas, and Faegheh Hasibi. Fine tuning vs. retrieval augmented generation for less popular knowledge. In Proc. of the 2024 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region, SI...

    2024

  44. [52]

    Dense retrieval with entity views

    Hai Dang Tran and Andrew Yates. Dense retrieval with entity views. In Proc. of the 31st ACM International Conference on Information & Knowledge Management, CIKM '22, page 1955–1964. Association for Computing Machinery, 2022

    1955

  45. [53]

    Complex embeddings for simple link prediction

    Th\' e o Trouillon, Johannes Welbl, Sebastian Riedel, \' E ric Gaussier, and Guillaume Bouchard. Complex embeddings for simple link prediction. In Proc. of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16, page 2071–2080, 2016

    2016

  46. [54]

    van Hulst, Faegheh Hasibi, Koen Dercksen, Krisztian Balog, and Arjen P

    Johannes M. van Hulst, Faegheh Hasibi, Koen Dercksen, Krisztian Balog, and Arjen P. de Vries. Rel: An entity linker standing on the shoulders of giants. In Proc. of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '20, 2020

    2020

  47. [55]

    KEPLER : A unified model for knowledge embedding and pre-trained language representation

    Xiaozhi Wang, Tianyu Gao, Zhaocheng Zhu, Zhengyan Zhang, Zhiyuan Liu, Juanzi Li, and Jian Tang. KEPLER : A unified model for knowledge embedding and pre-trained language representation. Transactions of the Association for Computational Linguistics, 9: 0 176--194, 2021

    2021

  48. [56]

    Neural attentive bag-of-entities model for text classification

    Ikuya Yamada and Hiroyuki Shindo. Neural attentive bag-of-entities model for text classification. In Proc.of the 23rd Conference on Computational Natural Language Learning (CoNLL), pages 563--573. ACL, 2019

    2019

  49. [57]

    Joint learning of the embedding of words and entities for named entity disambiguation

    Ikuya Yamada, Hiroyuki Shindo, Hideaki Takeda, and Yoshiyasu Takefuji. Joint learning of the embedding of words and entities for named entity disambiguation. The SIGNLL Conference on Computational Natural Language Learning, 2016

    2016

  50. [58]

    W ikipedia2 V ec: An efficient toolkit for learning and visualizing the embeddings of words and entities from W ikipedia

    Ikuya Yamada, Akari Asai, Jin Sakuma, Hiroyuki Shindo, Hideaki Takeda, Yoshiyasu Takefuji, and Yuji Matsumoto. W ikipedia2 V ec: An efficient toolkit for learning and visualizing the embeddings of words and entities from W ikipedia. In Proc. of the 2020 Conference on Empirical...

    2020

  51. [59]

    Embedding entities and relations for learning and inference in knowledge bases

    Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. Embedding entities and relations for learning and inference in knowledge bases. In Proc. of the 3rd International Conference on Learning Representations (ICLR), 2015

    2015

  52. [60]

    Fielded sequential dependence model for ad-hoc entity retrieval in the web of data

    Nikita Zhiltsov, Alexander Kotov, and Fedor Nikolaev. Fielded sequential dependence model for ad-hoc entity retrieval in the web of data. In Proc. of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 253--262. ACM, 2015

    2015

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.