An Effective Term-Weighting Scheme for Information Retrieval
2000-02-07
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
An Effective Term-Weighting Scheme for Information Retrieval
Authors
Published Date
2000-02-07
Publisher
Type
Report
Abstract
The retrieval performance of the information retrieval systems is largely dependent on similarity measures. Furthermore, a term-weighting scheme plays an important role for the similarity measure. In this paper, we investigate existing weighting approaches and similarity measures to propose a new term-weighting scheme supporting the cosine similarity measure to retrieve relevant documents effectively on the basis of vector space model. The new weighting technique considers not only occurrence terms but also absence terms in finding similarity among document vector representations. The consideration of negatively weighted terms resolves the masking by zero problem of the inner product operation. According to the experimental results, the balanced term-weighting scheme performs more effectively especially when the vector space of data collection is relatively dense. Consequently, the balanced weighting scheme promises significant contribution to the relevance effectiveness for the information retrieval systems.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 00-008
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Jung, Yunjae; Park, Haesun; Du, Ding-Zhu. (2000). An Effective Term-Weighting Scheme for Information Retrieval. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215454.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.