Indexing by Latent Dirichlet Allocation and an Ensemble Model
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Yanshan | - |
dc.contributor.author | Lee, Jae-Sung | - |
dc.contributor.author | Choi, In-Chan | - |
dc.date.accessioned | 2021-09-03T22:25:08Z | - |
dc.date.available | 2021-09-03T22:25:08Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2016-07 | - |
dc.identifier.issn | 2330-1643 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/88207 | - |
dc.description.abstract | The contribution of this article is twofold. First, we present Indexing by latent Dirichlet allocation (LDI), an automatic document indexing method. Many ad hoc applications, or their variants with smoothing techniques suggested in LDA-based language modeling, can result in unsatisfactory performance as the document representations do not accurately reflect concept space. To improve document retrieval performance, we introduce a new definition of document probability vectors in the context of LDA and present a novel scheme for automatic document indexing based on LDA. Second, we propose an Ensemble Model (EnM) for document retrieval. EnM combines basic indexing models by assigning different weights and attempts to uncover the optimal weights to maximize the mean average precision. To solve the optimization problem, we propose an algorithm, which is derived based on the boosting method. The results of our computational experiments on benchmark data sets indicate that both the proposed approaches are viable options for document retrieval. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY | - |
dc.title | Indexing by Latent Dirichlet Allocation and an Ensemble Model | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, In-Chan | - |
dc.identifier.doi | 10.1002/asi.23444 | - |
dc.identifier.scopusid | 2-s2.0-84973890989 | - |
dc.identifier.wosid | 000378644700013 | - |
dc.identifier.bibliographicCitation | JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY, v.67, no.7, pp.1736 - 1750 | - |
dc.relation.isPartOf | JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY | - |
dc.citation.title | JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY | - |
dc.citation.volume | 67 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 1736 | - |
dc.citation.endPage | 1750 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | ssci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Information Science & Library Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Information Science & Library Science | - |
dc.subject.keywordAuthor | information retrieval | - |
dc.subject.keywordAuthor | machine learning | - |
dc.subject.keywordAuthor | searching | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
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.