Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 

Repository files navigation

Introduction

참조

Task

Tasks Source Target 비고
Ad-hoc Information Retrieval : Text Text query Text document (title/content) 발빠르게 SOTA논문을 구현하고 적용고민
Ad-hoc Information Retrieval : Multi-Modal Text query Image or Video or Text document (title/content) 기존 Ad-hoc Information Retrieval 연구등에서 리뷰하고 관련 아디이어를 내어 고민해본다.
  • Ad-hoc Information Retrieval : Multi-Modal
    • 거의 없는관계로 관련 유사 Multi-Modal embedding(VQA, Image to Text Matching..)/L2R/GNN등의 연구등을 살펴보고 Idea를 내본다.

Ad-hoc Information Retrieval ??


Information retrieval (IR) is the activity of obtaining information system resources relevant to an information need from a collection. Searches can be based on full-text or other content-based indexing. Here, the Ad-hoc information retrieval refer in particular to text-based retrieval where documents in the collection remain relative static and new queries are submitted to the system continually (cited from the survey).

Ad-hoc Information Retrieval using Neural Ranking

  • Learning to Rank

Data

the number of queries is huge. Some benchmark datasets are listed in the following,

  • Robust04 is a small news dataset which contains about 0.5 million documents in total. The queries are collected from TREC Robust Track 2004. There are 250 queries in total.

  • Cluebweb09 is a large Web collection which contains about 34 million documents in total. The queries are accumulated from TREC Web Tracks 2009, 2010, and 2011. There are 150 queries in total.

  • Gov2 is a large Web collection where the pages are crawled from .gov. It consists of 25 million documents in total. The queries are accumulated over TREC Terabyte Tracks 2004, 2005, and 2006. There are 150 queries in total.

  • MSMARCO Passage Reranking provides a large number of information question-style queries from Bing's search logs. There passages are annotated by humans with relevant/non-relevant labels. There are 8,841822 documents in total. There are 808,731queries, 6,980 queries and 48,598 queries for train, validation and test, respectively.

  • LETOR is a package of benchmark data sets for research on LEarning TO Rank, which contains standard features, relevance judgments, data partitioning, evaluation tools, and several baselines. Version 1.0 was released in April 2007. Version 2.0 was released in Dec. 2007. Version 3.0 was released in Dec. 2008. This version, 4.0, was released in July 2009. Very different from previous versions (V3.0 is an update based on V2.0 and V2.0 is an update based on V1.0), LETOR4.0 is a totally new release. It uses the Gov2 web page collection (~25M pages) and two query sets from Million Query track of TREC 2007 and TREC 2008. We call the two query sets MQ2007 and MQ2008 for short. There are about 1700 queries in MQ2007 with labeled documents and about 800 queries in MQ2008 with labeled documents.

  • OHSUMED(or link) test collection is a set of 348,566 references from MEDLINE, the on-line medical information database, consisting of titles and/or abstracts from 270 medical journals over a five-year period (1987-1991). The available fields are title, abstract, MeSH indexing terms, author, source, and publication type. The National Library of Medicine has agreed to make the MEDLINE references in the test database available for experimentation, restricted to the following conditions:

  1. The data will not be used in any non-experimental clinical, library, or other setting.
  2. Any human users of the data will explicitly be told that the data is incomplete and out-of-date. (From the following source)

Paper : Text based Embedding

[1] Word2Vec

Efficient Estimation of Word Representations in Vector Space :

[2] node2vec

node2vec: Scalable Feature Learning for Networks

[3] BERT

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

[4] DESM

A Dual Embedding Space Model for Document Ranking. 2016

Improving Document Ranking with Dual Word Embeddings

Paper : MulitModel (image to image(Video)) based Embedding

Paper : Neural information retrieval (NeuIR)

Evaluation

  • 이쪽분야가 benchmarkset이 정립이안되는듯한 모습이 보인다.(제생각)
  • 일단 LETOR로.그나마..
MQ2007
Paper Year P@1 P@5 P@10 NDCG@1 NDCG@5 NDCG@10 MAP
BM25 1994 0.427 0.388 0.358 0.366 0.384 0.414 0.450
[1]DSSM 2013 0.345 0.359 0.352 0.290 0.335 0.371 0.409
[3]DRMM 2016 0.450 0.417 0.388 0.380 0.408 0.440 0.467
[6]Duet 2017 0.473 0.428 0.398 0.409 0.431 0.453 0.474
[10]DeepRank 2017 0.508 0.452 0.412 0.441 0.457 0.482 0.497
[11]HiNT 2018 0.515 0.461 0.418 0.447 0.463 0.490 0.502
MQ2008
Paper Year P@1 P@5 P@10 NDCG@1 NDCG@5 NDCG@10 MAP
BM25 1994 0.408 0.337 0.245 0.344 0.461 0.220 0.465
[1]DSSM 2013 0.341 0.284 0.221 0.286 0.378 0.178 0.391
[3]DRMM 2016 0.450 0.337 0.242 0.381 0.466 0.219 0.473
[6]Duet 2017 0.452 0.341 0.240 0.385 0.471 0.216 0.476
[10]DeepRank 2017 0.482 0.359 0.252 0.406 0.496 0.240 0.498
[11]HiNT 2018 0.491 0.367 0.255 0.415 0.501 0.244 0.505
Ad-Hoc Information Retrieval on TREC Robust04

링크

Papers

[1] DSSM

Learning Deep Structured Semantic Models for Web Search using Clickthrough Data. CIKM 2013.

[2] CDSSM

Learning Semantic Representations Using Convolutional Neural Networks for Web Search. WWW 2014. A Latent Semantic Model with Convolutional-Pooling Structure for Information Retrieval. CIKM 2014.

[3] DRMM

A Deep Relevance Matching Model for Ad-hoc Retrieval. DRMM 2016.

[4] KNRM

End-to-End Neural Ad-hoc Ranking with Kernel Pooling. SIGIR 2017

[5] CONV-KNRM

Convolutional Neural Networks for Soft-Matching N-Grams in Ad-hoc Search. WSDM 2018

[6] Duet

Learning to Match using Local and Distributed Representations of Text for Web Search. WWW 2017

[7] Co-PACRR

Co-PACRR: A Context-Aware Neural IR Model for Ad-hoc Retrieval. WSDM 2018.

[8] LSTM-RNN

Deep Sentence Embsedding Using Long Short-Term Memory Networks: Analysis and Application to Information Retrieval. TASLP 2016.

[9] DRMM_TKS

*A Deep Relevance Matching Model for Ad-hoc Retrieval (A variation of DRMM). CCIR 2018.

[10] DeepRank

DeepRank: A New Deep Architecture for Relevance Ranking in Information Retrieval. CIKM 2017

[11] HiNT

Modeling Diverse Relevance Patterns in Ad-hoc Retrieval. SIGIR 2018.

adding

[12] snrm

From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. ACM 2018

[13] RankNet

Learning to Rank using Gradient Descent. ICML 2005

[14] LambdaRank

Learning to Rank with Nonsmooth Cost Functions. NIPS 2006

[15] LambdaMART

Adapting Bboosting for Information Retrieval Measures

[16] RankNet/LambdaRank/LambdaMART:turtorial

From RankNet to LambdaRank to LambdaMART: An Overview

[17] TF-Ranking

TF-Ranking: A Scalable TensorFlow Library for Learning-to-Rank. 2018

TF ranking open-source

[18] FNRM

Neural Ranking Models with Weak Supervision. CoRR 2017

[19] PACRR

PACRR: A position-aware neural IR model for relevance matching. EMNLP 2017

[20] DRMM & PACRR

Deep Relevance Ranking Using Enhanced Document-Query Interactions. EMNLP 2018

[21] turtorial

An Introduction to Neural Information Retrieval

[22] rank-text-cnn

Learning to Rank Short Text Pairs with Convolutional Deep Neural Networks. SIGIR 2015

[23] ConvRankNet

Deep Neural Network for Learning to Rank Query-Text Pairs. 2018

[24] Listwise Neural Ranking Models

Listwise Neural Ranking Models. ICTIR 2019

[25] DLCM

Learning a Deep Listwise Context Model for Ranking Refinement. SIGIR 2018

[26] GSF

Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks

[27] NPRF

NPRF: A Neural Pseudo Relevance Feedback Framework for Ad-hoc Information Retrieval

BERT IR

[1] CEDR : 2019.12.18 Current SOTA

CEDR: Contextualized Embeddings for Document Ranking

[2] BERT-MaxP

Deeper Text Understanding for IR with Contextual Neural Language Modeling

[3] BERT FT

Simple Applications of BERT for Ad Hoc Document Retrieval

[4] Document Expansion by Query Prediction

[5] Passage Re-ranking with BERT

[6] Multi-Stage Document Ranking with BERT

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors