Ulugbek Ergashev

dblp:344/8692 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-1912-9993ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 74% Knowledge graphs · 22% Graph data management · 3%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
1.422024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Learning To Rank Resources with GNN · WWW 2023
Information retrieval › distributed information retrieval
resource selection
1.422024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Learning To Rank Resources with GNN · WWW 2023
Knowledge graphs › knowledge graph embedding
box embedding
0.812024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Information retrieval › distributed information retrieval
distributed search
0.812024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Knowledge graphs
knowledge graph embedding
0.812024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Information retrieval
ranking
0.812024
Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding · ICDM 2024
Information retrieval
distributed information retrieval
0.712023
Learning To Rank Resources with GNN · WWW 2023
Graph data management
heterogeneous graph
0.212023
Learning To Rank Resources with GNN · WWW 2023

Methods — techniques the papers use, named apart from their topics

box-vector distance · 0.8attentive pooling · 0.8pre-trained language model · 0.7graph neural network · 0.7
YearPublicationVenuePosition
2024 Resource2Box: Learning To Rank Resources in Distributed Search Using Box Embedding
abstract
The rapid and continuous growth of internet content poses significant challenges to conventional web search engines. Distributed Search (DS) offers a solution by integrating multiple information sources into a unified search system. When a user submits a query, the DS system selects relevant resources and ranks the documents within these selected resources. Recently, representation learning of queries and resources has been employed to enhance DS performance. However, existing methods that represent resources as vector embeddings may not sufficiently capture the semantic diversity within each resource. To address this limitation, we propose Resource2Box, a novel representation learning method for DS that models resources as boxes (i.e., hypercubes) in the latent space. Resource2Box more effectively captures the diverse and intricate information of documents within resources compared to single-point vector embeddings. It learns a box embedding for each resource, characterized by a center and offset, through two key processes: (1) aggregating document information within each resource using attentive pooling and (2) propagating information across resources. These box embeddings are learned to reflect the semantic relationships with training queries, utilizing a unique box-vector distance metric. Comprehensive experimentation on benchmark datasets demonstrates that Resource2Box significantly enhances resource selection, improving ranking performance by up to 24.7% across various metrics.
Ulugbek Ergashev, Kijung Shin, Eduard C. Dragut, Weiyi Meng
ICDM1
2023 Learning To Rank Resources with GNN
abstract
As the content on the Internet continues to grow, many new dynamically changing and heterogeneous sources of data constantly emerge. A conventional search engine cannot crawl and index at the same pace as the expansion of the Internet. Moreover, a large portion of the data on the Internet is not accessible to traditional search engines. Distributed Information Retrieval (DIR) is a viable solution to this as it integrates multiple shards (resources) and provides a unified access to them. Resource selection is a key component of DIR systems. There is a rich body of literature on resource selection approaches for DIR. A key limitation of the existing approaches is that they primarily use term-based statistical features and do not generally model resource-query and resource-resource relationships. In this paper, we propose a graph neural network (GNN) based approach to learning-to-rank that is capable of modeling resource-query and resource-resource relationships. Specifically, we utilize a pre-trained language model (PTLM) to obtain semantic information from queries and resources. Then, we explicitly build a heterogeneous graph to preserve structural information of query-resource relationships and employ GNN to extract structural information. In addition, the heterogeneous graph is enriched with resource-resource type of edges to further enhance the ranking accuracy. Extensive experiments on benchmark datasets show that our proposed approach is highly effective in resource selection. Our method outperforms the state-of-the-art by 6.4% to 42% on various performance metrics.
Ulugbek Ergashev, Eduard C. Dragut, Weiyi Meng
WWW1