Refining term weights of documents using term dependencies

Authors:
Hee-soo Kim;Ikkyu Choi;Minkoo Kim
Affiliations:
Ajou University, Gyeonggi-do, Republic of Korea;Ajou University, Gyeonggi-do, Republic of Korea;Ajou University, Gyeonggi-do, Republic of Korea
Venue:
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
2004

Citing 5
Cited 2

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Extracting classification knowledge of Internet documents with mining term associations: a semantic approach

Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
A language modeling approach to information retrieval

Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Modern Information Retrieval

Modern Information Retrieval
Building and applying a concept hierarchy representation of a user profile

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval

Privacy preserving multi-factor authentication with biometrics

Proceedings of the second ACM workshop on Digital identity management
Semi-automatic construction of domain ontology for agent reasoning

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

When processing raw documents in Information Retrieval (IR) System, a term-weighting scheme is used to calculate the importance of each term which occurs in a document. However, most term-weighting schemes assume that a term is independent of the other terms. Term dependency is an indispensable consequence of language use [1]. Therefore, this assumption can make the information of a document being lost. In this paper, we propose new approach to refine term weights of documents using term dependencies discovered from a set of documents. Then, we evaluate our method with two experiments based on the vector space model [2] and the language model [3].