File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

나승훈

Na, Seung-Hoon
Natural Language Processing Lab
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Two-Stage Document Length Normalization for Information Retrieval

Author(s)
Na, Seung-Hoon
Issued Date
2015-02
DOI
10.1145/2699669
URI
https://scholarworks.unist.ac.kr/handle/201301/86826
Citation
ACM TRANSACTIONS ON INFORMATION SYSTEMS, v.33, no.2, pp.8
Abstract
The standard approach for term frequency normalization is based only on the document length. However, it does not distinguish the verbosity from the scope, these being the two main factors determining the document length. Because the verbosity and scope have largely different effects on the increase in term frequency, the standard approach can easily suffer from insufficient or excessive penalization depending on the specific type of long document. To overcome these problems, this article proposes two-stage normalization by performing verbosity and scope normalization separately, and by employing different penalization functions. In verbosity normalization, each document is prenormalized by dividing the term frequency by the verbosity of the document. In scope normalization, an existing retrieval model is applied in a straightforward manner to the prenormalized document, finally leading us to formulate our proposed verbosity normalized (VN) retrieval model. Experimental results carried out on standard TREC collections demonstrate that the VN model leads to marginal but statistically significant improvements over standard retrieval models.
Publisher
ASSOC COMPUTING MACHINERY
ISSN
1046-8188
Keyword (Author)
document length normalizationAlgorithmsExperimentationPerformanceTheoryVerbosity normalizationretrieval heuristicsterm frequencyscope normalization
Keyword
MODELSTERM FREQUENCY NORMALIZATION

qrcode

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