Generalized Ensemble Model for Document Ranking in Information Retrieval
- Authors
- Wang, Yanshan; Choi, In-Chan; Liu, Hongfang
- Issue Date
- 1월-2017
- Publisher
- COMSIS CONSORTIUM
- Keywords
- ensemble model; information retrieval; optimization; mean average precision; document ranking
- Citation
- COMPUTER SCIENCE AND INFORMATION SYSTEMS, v.14, no.1, pp.123 - 151
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTER SCIENCE AND INFORMATION SYSTEMS
- Volume
- 14
- Number
- 1
- Start Page
- 123
- End Page
- 151
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/85046
- DOI
- 10.2298/CSIS160229042W
- ISSN
- 1820-0214
- Abstract
- A generalized ensemble model (gEnM) for document ranking is proposed in this paper. The gEnM linearly combines the document retrieval models and tries to retrieve relevant documents at high positions. In order to obtain the optimal linear combination of multiple document retrieval models or rankers, an optimization program is formulated by directly maximizing the mean average precision. Both supervised and unsupervised learning algorithms are presented to solve this program. For the supervised scheme, two approaches are considered based on the data setting, namely batch and online setting. In the batch setting, we propose a revised Newton's algorithm, gEnM. BAT, by approximating the derivative and Hessian matrix. In the online setting, we advocate a stochastic gradient descent (SGD) based algorithm-gEnM. ON. As for the unsupervised scheme, an unsupervised ensemble model (UnsEnM) by iteratively co-learning from each constituent ranker is presented. Experimental study on benchmark data sets verifies the effectiveness of the proposed algorithms. Therefore, with appropriate algorithms, the gEnM is a viable option in diverse practical information retrieval applications.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.