A Novel Document Ranking Method Using the Discrete Cosine Transform

Authors:
Laurence A. F. Park;Marimuthu Palaniswami;Kotagiri Ramamohanarao
Affiliations:
IEEE;IEEE;IEEE
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2005

Citing 6
Cited 5

The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Self-indexing inverted files for fast text retrieval

ACM Transactions on Information Systems (TOIS)
Exploring the similarity space

ACM SIGIR Forum
Vector-space ranking with effective early termination

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient Processing of Proximity Queries for Large Databases

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fourier Domain Scoring: A Novel Document Ranking Method

IEEE Transactions on Knowledge and Data Engineering

A novel document retrieval method using the discrete wavelet transform

ACM Transactions on Information Systems (TOIS)
Broadening vector space schemes for improving the quality of information retrieval

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Spectral-based document retrieval

ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Structure-based document model with discrete wavelet transforms and its application to document classification

AusDM '08 Proceedings of the 7th Australasian Data Mining Conference - Volume 87
A novel neighborhood based document smoothing model for information retrieval

Information Retrieval

Quantified Score

Hi-index	0.14

Visualization

Abstract

We propose a new Spectral text retrieval method using the Discrete Cosine Transform (DCT). By taking advantage of the properties of the DCT and by employing the fast query and compression techniques found in vector space methods (VSM), we show that we can process queries as fast as VSM and achieve a much higher precision.