IMPROVING TERM FREQUENCY NORMALIZATION FOR MULTI-TOPICAL DOCUMENTS AND APPLICATION TO LANGUAGE MODELING APPROACHES
SCIE
SCOPUS
- Title
- IMPROVING TERM FREQUENCY NORMALIZATION FOR MULTI-TOPICAL DOCUMENTS AND APPLICATION TO LANGUAGE MODELING APPROACHES
- Authors
- Na, S.-H; Kang, I.-S; Lee, J.-H.
- Date Issued
- 2008-01
- Publisher
- SPRINGER
- Abstract
- Term frequency normalization is a serious issue since lengths of documents are various. Generally, documents become long due to two different reasons - verbosity and multi-topicality. First, verbosity means that the same topic is repeatedly mentioned by terms related to the topic, so that term frequency is more increased than the well-summarized one. Second, multi-topicality indicates that a document has a broad discussion of multi-topics, rather than single topic. Although these document characteristics should be differently handled, all previous methods of term frequency normalization have ignored these differences and have used a simplified length-driven approach which decreases the term frequency by only the length of a document, causing an unreasonable penalization. To attack this problem, we propose a novel TF normalization method which is a type of partially-axiomatic approach. We first formulate two formal constraints that the retrieval model should satisfy for documents having verbose and multi-topicality characteristic, respectively. Then, we modify language modeling approaches to better satisfy these two constraints, and derive novel smoothing methods. Experimental results show that the proposed method increases significantly the precision for keyword queries, and substantially improves MAP (Mean Average Precision) for verbose queries.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/35959
- DOI
- 10.1007/978-3-540-78646-7_35
- ISSN
- 0302-9743
- Article Type
- Article
- Citation
- LECTURE NOTES IN COMPUTER SCIENCE, vol. 4956, page. 382 - 393, 2008-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.