Generalized Ensemble Model for Document Ranking in Information Retrieval
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Yanshan | - |
dc.contributor.author | Choi, In-Chan | - |
dc.contributor.author | Liu, Hongfang | - |
dc.date.accessioned | 2021-09-03T11:28:34Z | - |
dc.date.available | 2021-09-03T11:28:34Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2017-01 | - |
dc.identifier.issn | 1820-0214 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/85046 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | COMSIS CONSORTIUM | - |
dc.title | Generalized Ensemble Model for Document Ranking in Information Retrieval | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, In-Chan | - |
dc.identifier.doi | 10.2298/CSIS160229042W | - |
dc.identifier.scopusid | 2-s2.0-85011634648 | - |
dc.identifier.wosid | 000396389300008 | - |
dc.identifier.bibliographicCitation | COMPUTER SCIENCE AND INFORMATION SYSTEMS, v.14, no.1, pp.123 - 151 | - |
dc.relation.isPartOf | COMPUTER SCIENCE AND INFORMATION SYSTEMS | - |
dc.citation.title | COMPUTER SCIENCE AND INFORMATION SYSTEMS | - |
dc.citation.volume | 14 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 123 | - |
dc.citation.endPage | 151 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordAuthor | ensemble model | - |
dc.subject.keywordAuthor | information retrieval | - |
dc.subject.keywordAuthor | optimization | - |
dc.subject.keywordAuthor | mean average precision | - |
dc.subject.keywordAuthor | document ranking | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.