Multi-objective Topic Modeling for Exploratory Search in Tech News

被引:5
作者
Ianina, Anastasia [1 ]
Golitsyn, Lev [2 ]
Vorontsov, Konstantin [1 ]
机构
[1] Moscow Inst Phys & Technol, Moscow, Russia
[2] Integrated Syst, Moscow, Russia
来源
ARTIFICIAL INTELLIGENCE AND NATURAL LANGUAGE | 2018年 / 789卷
关键词
Information retrieval; Exploratory search; Relevance feedback; Topic modeling; Additive regularization for topic modeling; ARTM; BigARTM; ADDITIVE REGULARIZATION;
D O I
10.1007/978-3-319-71746-3_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Exploratory search is a paradigm of information retrieval, in which the user's intention is to learn the subject domain better. To do this the user repeats "query-browse-refine" interactions with the search engine many times. We consider typical exploratory search tasks formulated by long text queries. People usually solve such a task in about half an hour and find dozens of documents using conventional search facilities iteratively. The goal of this paper is to reduce the time-consuming multi-step process to one step without impairing the quality of the search. Probabilistic topic modeling is a suitable text mining technique to retrieve documents, which are semantically relevant to a long text query. We use the additive regularization of topic models (ARTM) to build a model that meets multiple objectives. The model should have sparse, diverse and interpretable topics. Also, it should incorporate meta-data and multimodal data such as n-grams, authors, tags and categories. Balancing the regularization criteria is an important issue for ARTM. We tackle this problem with coordinate-wise optimization technique, which chooses the regularization trajectory automatically. We use the parallel online implementation of ARTM from the open source library BigARTM. Our evaluation technique is based on crowdsourcing and includes two tasks for assessors: the manual exploratory search and the explicit relevance feedback. Experiments on two popular tech news media show that our topic-based exploratory search outperforms assessors as well as simple baselines, achieving precision and recall of about 85-92%.
引用
收藏
页码:181 / 193
页数:13
相关论文
共 22 条
[1]  
Andrzejewski David., 2011, Proceedings of the 17th SIGKDD International Conference on Knowledge Discovery and Data Mining, P600, DOI DOI 10.1145/2020408.2020503
[2]  
[Anonymous], 2013, EXPLORATORY SEARCH Q, DOI DOI 10.2200/S00174ED1V01Y200901ICR003
[3]  
[Anonymous], 2008, Introduction to information retrieval
[4]  
Apishev M., 2016, LNCS LNAI, P169, DOI DOI 10.1007/978-3-319-62434-114
[5]   Mining Ethnic Content Online with Additively Regularized Topic Models [J].
Apishev, Murat ;
Koltcov, Sergei ;
Koltsova, Olessia ;
Nikolenko, Sergey ;
Vorontsov, Konstantin .
COMPUTACION Y SISTEMAS, 2016, 20 (03) :387-403
[6]  
Baeza-Yates R., 2011, MODERN INFORM RETRIE, V2
[7]   Probabilistic Topic Models [J].
Blei, David M. .
COMMUNICATIONS OF THE ACM, 2012, 55 (04) :77-84
[8]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[9]   Parallel Non-blocking Deterministic Algorithm for Online Topic Modeling [J].
Frei, Oleksandr ;
Apishev, Murat .
ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS, AIST 2016, 2017, 661 :132-144
[10]  
Grant C.E., 2015, Flairs conference, P43