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 条
  • [21] Multi-objective genetic local search algorithm
    Ishibuchi, H
    Murata, T
    1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 119 - 124
  • [23] A Multi-Objective Binary Harmony Search Algorithm
    Wang, Ling
    Mao, Yunfei
    Niu, Qun
    Fei, Minrui
    ADVANCES IN SWARM INTELLIGENCE, PT II, 2011, 6729 : 74 - 81
  • [24] Tabu search for a multi-objective routing problem
    Pacheco, J
    Martí, R
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (01) : 29 - 37
  • [25] Multi-objective Local Search Based on Decomposition
    Derbel, Bilel
    Liefooghe, Arnaud
    Zhang, Qingfu
    Aguirre, Hernan
    Tanaka, Kiyoshi
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIV, 2016, 9921 : 431 - 441
  • [26] A Chaos Search for Multi-Objective Memetic Algorithm
    Ammaruekarat, Paranya
    Meesad, Phayung
    INFORMATION AND ELECTRONICS ENGINEERING, 2011, 6 : 140 - 144
  • [27] A Multi-Objective Integer Melody Search Algorithm
    Shafique, Jawad
    Ahmad, Ayaz
    Murtza, Shahid Ali
    APPLIED ARTIFICIAL INTELLIGENCE, 2019, 33 (03) : 208 - 228
  • [28] Multi-objective Search for Comprehensible Rule Ensembles
    Blaszczynski, Jerzy
    Prusak, Bartosz
    Slowinski, Roman
    ROUGH SETS, (IJCRS 2016), 2016, 9920 : 503 - 513
  • [29] Theoretical Study on Multi-objective Heuristic Search
    Skyler, Shawn
    Shperberg, Shahaf
    Atzmon, Dor
    Felner, Ariel
    Salzman, Oren
    Chan, Shao-Hung
    Zhang, Han
    Keonig, Sven
    Yeoh, William
    Ulloa, Carlos Hernandez
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 7021 - 7028
  • [30] Hybrid multi-objective cuckoo search with dynamical local search
    Zhang, Maoqing
    Wang, Hui
    Cui, Zhihua
    Chen, Jinjun
    MEMETIC COMPUTING, 2018, 10 (02) : 199 - 208