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

Ikkyu Choi

dblp:11/2632 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0002-8281-7211ORCID · corroborated

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
term dependency
0.012004
Refining term weights of documents using term dependencies · SIGIR 2004
Information retrieval › retrieval models
term weighting
0.012004
Refining term weights of documents using term dependencies · SIGIR 2004
Information retrieval › web search
link analysis
0.012003
Topic distillation using hierarchy concept tree · SIGIR 2003
Information retrieval › web search
topic distillation
0.012003
Topic distillation using hierarchy concept tree · SIGIR 2003
Information retrieval › retrieval models
language model
0.012004
Refining term weights of documents using term dependencies · SIGIR 2004
Information retrieval › retrieval models
vector space model
0.012004
Refining term weights of documents using term dependencies · SIGIR 2004

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

hierarchy concept tree · 0.0content analysis · 0.0
YearPublicationVenuePosition
2017 Off-Topic Spoken Response Detection Using Siamese Convolutional Neural Networks
Chong Min Lee, Su-Youn Yoon, Xihao Wang, Matthew Mulholland, Ikkyu Choi, Keelan Evanini
INTERSPEECH5
2017 Off-Topic Spoken Response Detection with Word Embeddings
Su-Youn Yoon, Chong Min Lee, Ikkyu Choi, Matthew Mulholland, Keelan Evanini
INTERSPEECH3
2013 Semi-automatic construction of domain ontology for agent reasoning
Ikkyu Choi, Seungmin Rho, Minkoo Kim
Pers. Ubiquitous Comput.1
2004 Refining term weights of documents using term dependencies
abstract
When processing raw documents in Information Retrieval (IR) System, a term-weighting scheme is used to calculate the importance of each term which occurs in a document. However, most term-weighting schemes assume that a term is independent of the other terms. Term dependency is an indispensable consequence of language use [1]. Therefore, this assumption can make the information of a document being lost. In this paper, we propose new approach to refine term weights of documents using term dependencies discovered from a set of documents. Then, we evaluate our method with two experiments based on the vector space model [2] and the language model [3].
Ikkyu Choi, Minkoo Kim
SIGIR2
2003 Topic distillation using hierarchy concept tree
abstract
In this paper, we propose a new approach for topic distillation on World Wide Web. Topic distillation is to find quality documents related to the user query topic. Our approach is based on Bharat's topic distillation algorithm [1]. We present the analysis of hyperlink graph structure using hierarchy concept tree to solve the mixed hubs problem that is also remained in the Bharat's algorithm. For assigning better weights to hyperlinks which point to relevant documents among hyperlinks in a document, we try to find the relationship in documents connected by hyperlinks using content analysis and we assign weights to hyperlinks based on the relationship. We evaluated this algorithm using 50 topics on WT10g corpus and obtained improved results.
Ikkyu Choi, Minkoo Kim
SIGIR1