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
关键词
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
相关论文
共 50 条
  • [41] Multi-objective exploration and search for autonomous rescue robots
    Calisi, Daniele
    Farinelli, Alessandro
    Locchi, Luca
    Nardi, Daniele
    JOURNAL OF FIELD ROBOTICS, 2007, 24 (8-9) : 763 - 777
  • [42] A Local Optimization Framework for Multi-Objective Ergodic Search
    Ren, Zhongqiang
    Srinivasan, Akshaya Kesarimangalam
    Coffin, Howard
    Abraham, Ian
    Choset, Howie
    ROBOTICS: SCIENCE AND SYSTEM XVIII, 2022,
  • [43] Genetic tabu search for the multi-objective knapsack problem
    Barichard, Vincent
    Hao, Jin-Kao
    Tsinghua Science and Technology, 2003, 8 (01) : 8 - 13
  • [45] MONSS: A multi-objective nonlinear simplex search approach
    Zapotecas-Martinez, Saul
    Coello Coello, Carlos A.
    ENGINEERING OPTIMIZATION, 2016, 48 (01) : 16 - 38
  • [46] Efficient computation of the search region in multi-objective optimization
    Daechert, Kerstin
    Klamroth, Kathrin
    Lacour, Renaud
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (03) : 841 - 855
  • [47] Distributed Pareto Local Search for Multi-Objective DCOPs
    Clement, Maxime
    Okimoto, Tenda
    Inoue, Katsumi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (12): : 2897 - 2905
  • [48] Software Module Clustering as a Multi-Objective Search Problem
    Praditwong, Kata
    Harman, Mark
    Yao, Xin
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2011, 37 (02) : 264 - 282
  • [49] Damping Search Algorithm for Multi-objective Optimization Problems
    Ji, Jia
    Peng, Jinhua
    Zhao, Xinchao
    ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, AICI 2010, PT II, 2010, 6320 : 185 - 192
  • [50] A Study on Cooperative Multi-objective Group Search Optimizer
    Li, Ya-zhou
    Zheng, Xiang-wei
    Xiao, Xian-cui
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 3776 - 3781