Efficient Ranking on Entity Graphs with Personalized Relationships

Hristidis, Vagelis; Wu, Yao; Raschid, Louiqa

doi:10.1109/tkde.2013.52

Cited by 7 publications

(3 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For Equation A.4, this means replacing vector E with a non-uniform vector (the personalization vector), which can be a single-page E, where all personalized weights except one are zero, or a root-level E which only allows teleportation to web site main pages. While personalization in PageRank is frequently achieved through the manipulation of node weights in the teleportation term, there have also been applications based on the manipulation of edge weights in the navigation term [377,378].…”

Section: Personalized Pagerankmentioning

confidence: 99%

Graph-based entity-oriented search

Devezas

2021

SIGIR Forum

View full text Add to dashboard Cite

Entity-oriented search has revolutionized search engines. In the era of Google Knowledge Graph and Microsoft Satori, users demand an effortless process of search. Whether they express an information need through a keyword query, expecting documents and entities, or through a clicked entity, expecting related entities, there is an inherent need for the combination of corpora and knowledge bases to obtain an answer. Such integration frequently relies on independent signals extracted from inverted indexes, and from quad indexes indirectly accessed through queries to a triplestore. However, relying on two separate representation models inhibits the effective cross-referencing of information, discarding otherwise available relations that could lead to a better ranking. Moreover, different retrieval tasks often demand separate implementations, although the problem is, at its core, the same. With the goal of harnessing all available information to optimize retrieval, we explore joint representation models of documents and entities, while taking a step towards the definition of a more general retrieval approach. Specifically, we propose that graphs should be used to incorporate explicit and implicit information derived from the relations between text found in corpora and entities found in knowledge bases. We also take advantage of this framework to elaborate a general model for entity-oriented search, proposing a universal ranking function for the tasks of ad hoc document retrieval (leveraging entities), ad hoc entity retrieval, and entity list completion. At a conceptual stage, we begin by proposing the graph-of-entity, based on the relations between combinations of term and entity nodes. We introduce the entity weight as the corresponding ranking function, relying on the idea of seed nodes for representing the query, either directly through term nodes, or based on the expansion to adjacent entity nodes. The score is computed based on a series of geodesic distances to the remaining nodes, providing a ranking for the documents (or entities) in the graph. In order to improve on the low scalability of the graph-of-entity, we then redesigned this model in a way that reduced the number of edges in relation to the number of nodes, by relying on the hypergraph data structure. The resulting model, which we called hypergraph-of-entity, is the main contribution of this thesis. The obtained reduction was achieved by replacing binary edges with n -ary relations based on sets of nodes and entities (undirected document hyperedges), sets of entities (undirected hyperedges, either based on cooccurrence or a grouping by semantic subject), and pairs of a set of terms and a set of one entity (directed hyperedges, mapping text to an object). We introduce the random walk score as the corresponding ranking function, relying on the same idea of seed nodes, similar to the entity weight in the graph-of-entity. Scoring based on this function is highly reliant on the structure of the hypergraph, which we call representation-driven retrieval. As such, we explore several extensions of the hypergraph-of-entity, including relations of synonymy, or contextual similarity, as well as different weighting functions per node and hyperedge type. We also propose TF-bins as a discretization for representing term frequency in the hypergraph-of-entity. For the random walk score, we propose and explore several parameters, including length and repeats, with or without seed node expansion, direction, or weights, and with or without a certain degree of node and/or hyperedge fatigue, a concept that we also propose. For evaluation, we took advantage of TREC 2017 OpenSearch track, which relied on an online evaluation process based on the Living Labs API, and we also participated in TREC 2018 Common Core track, which was based on the newly introduced TREC Washington Post Corpus. Our main experiments were supported on the INEX 2009 Wikipedia collection, which proved to be a fundamental test collection for assessing retrieval effectiveness across multiple tasks. At first, our experiments solely focused on ad hoc document retrieval, ensuring that the model performed adequately for a classical task. We then expanded the work to cover all three entity-oriented search tasks. Results supported the viability of a general retrieval model, opening novel challenges in information retrieval, and proposing a new path towards generality in this area.

show abstract

Section: Personalized Pagerankmentioning

confidence: 99%

Graph-based entity-oriented search

Devezas

2021

SIGIR Forum

View full text Add to dashboard Cite

show abstract

“…Vagelis Hristidis et al [22] proposed an efficient ranking for personalize authority flow ranking for both ObjectRanking and ScaleRanking. They developed two ranking algorithms.…”

Section: Literature Surveymentioning

confidence: 99%

“…It did not warrant its effectiveness in ranking papers from domains. PickOne algorithm was a greedy heuristic and this was reflected in its rapidly degraded performance and also was providing inaccurate ranking of the top 100 results [22]. CoDiffusion did not show superior performance with Global ranking scheme, compared with LM and RW rankings because each query keyword was treated independently by the algorithm [23].…”

Section: Technical Studymentioning

confidence: 99%

A technical study on Information Retrieval using web mining techniques

Sathiaseelan¹

2015

2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)

View full text Add to dashboard Cite

Information Retrieval (IR) is a significant area in web mining where the users procure their needed information from the web. The documents in the web are in the form of web pages. As there is a high usage of data in the web, researchers are intended to do research in the field of IR. Web query classification and web page classification are leading major role to classify the web documents in IR using classification algorithms, based on the user query. The classified documents are indexed using ranking algorithm. This research paper aims to study about various methods of IR to classify and index the relevant web pages respectively.

show abstract