Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Taewon Yoon

dblp:216/7030 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
neural retrieval
0.512021
Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrieval · EMNLP (1) 2021
Information retrieval
retrieval models
0.512021
Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrieval · EMNLP (1) 2021
Information retrieval
sparse feature learning
0.512021
Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrieval · EMNLP (1) 2021
Information retrieval › retrieval models
sparse retrieval
0.512021
Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrieval · EMNLP (1) 2021

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

bucketing · 0.5binarization · 0.5BERT · 0.5
YearPublicationVenuePosition
2021 Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrieval
abstract
The semantic matching capabilities of neural information retrieval can ameliorate synonymy and polysemy problems of symbolic approaches.However, neural models' dense representations are more suitable for re-ranking, due to their inefficiency.Sparse representations, either in symbolic or latent form, are more efficient with an inverted index.Taking the merits of the sparse and dense representations, we propose an ultra-high dimensional (UHD) representation scheme equipped with directly controllable sparsity.UHD's large capacity and minimal noise and interference among the dimensions allow for binarized representations, which are highly efficient for storage and search.Also proposed is a bucketing method, where the embeddings from multiple layers of BERT are selected/merged to represent diverse linguistic aspects.We test our models with MS MARCO and TREC CAR, showing that our models outperforms other sparse models.
Kyoungrok Jang, Junmo Kang, Giwon Hong, Sung-Hyon Myaeng, Joohee Park, Taewon Yoon, Hee-Cheol Seo
EMNLP (1)6