Open Access System for Information Sharing

Login Library

 

Article
Cited 2 time in webofscience Cited 4 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorNa, SH-
dc.contributor.authorKang, IS-
dc.contributor.authorLee, JH-
dc.date.accessioned2016-04-01T01:48:39Z-
dc.date.available2016-04-01T01:48:39Z-
dc.date.created2010-01-11-
dc.date.issued2007-01-
dc.identifier.issn0306-4573-
dc.identifier.other2006-OAK-0000006330-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/23752-
dc.description.abstractIn the KL divergence framework, the extended language modeling approach has a critical problem of estimating a query model, which is the probabilistic model that encodes the user's information need. For query expansion in initial retrieval, the translation model had been proposed to involve term co-occurrence statistics. However, the translation model was difficult to apply, because the term co-occurrence statistics must be constructed in the offline time. Especially in a large collection, constructing such a large matrix of term co-occurrences statistics prohibitively increases time and space complexity. In addition, reliable retrieval performance cannot be guaranteed because the translation model may comprise noisy non-topical terms in documents. To resolve these problems, this paper investigates an effective method to construct co-occurrence statistics and eliminate noisy terms by employing a parsimonious translation model. The parsimonious translation model is a compact version of a translation model that can reduce the number of terms containing non-zero probabilities by eliminating non-topical terms in documents. Through experimentation on seven different test collections, we show that the query model estimated from the parsimonious translation model significantly outperforms not only the baseline language modeling, but also the non-parsimonious models. (c) 2006 Elsevier Ltd. All rights reserved.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.relation.isPartOfINFORMATION PROCESSING & MANAGEMENT-
dc.subjectinformation retrieval-
dc.subjectlanguage model-
dc.subjectparsimonious translation model-
dc.subjectquery expansion-
dc.titleParsimonious translation models for information retrieval-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1016/j.ipm.2006.04.005-
dc.author.googleNa, SH-
dc.author.googleKang, IS-
dc.author.googleLee, JH-
dc.relation.volume43-
dc.relation.issue1-
dc.relation.startpage121-
dc.relation.lastpage145-
dc.contributor.id10083961-
dc.relation.journalINFORMATION PROCESSING & MANAGEMENT-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationINFORMATION PROCESSING & MANAGEMENT, v.43, no.1, pp.121 - 145-
dc.identifier.wosid000241539500009-
dc.date.tcdate2018-11-01-
dc.citation.endPage145-
dc.citation.number1-
dc.citation.startPage121-
dc.citation.titleINFORMATION PROCESSING & MANAGEMENT-
dc.citation.volume43-
dc.contributor.affiliatedAuthorLee, JH-
dc.identifier.scopusid2-s2.0-33748316409-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc2-
dc.type.docTypeArticle-
dc.subject.keywordAuthorinformation retrieval-
dc.subject.keywordAuthorlanguage model-
dc.subject.keywordAuthorparsimonious translation model-
dc.subject.keywordAuthorquery expansion-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryInformation Science & Library Science-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaInformation Science & Library Science-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

이종혁LEE, JONG HYEOK
Grad. School of AI
Read more

Views & Downloads

Browse