Comparative Analysis of Sparse Matrix Algorithms For Information Retrieval
We evaluate and compare the storage efficiency of different sparse matrix storage formats as index structure for text collection and their corresponding sparse matrixvector multiplication algorithm to perform query processing in information retrieval (IR) application. We show the results of our impl...
Main Authors: | Nazli Goharian, Ankit Jain, Qian Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
International Institute of Informatics and Cybernetics
2003-02-01
|
Series: | Journal of Systemics, Cybernetics and Informatics |
Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/002759.pdf
|
Similar Items
-
GARLM: Greedy Autocorrelation Retrieval Levenberg–Marquardt Algorithm for Improving Sparse Phase Retrieval
by: Zhuolei Xiao, et al.
Published: (2018-10-01) -
Sparse hyperspectral unmixing algorithm supported by sparse difference prior information
by: ZHANG Zuoyu, et al.
Published: (2020-08-01) -
Direct sparse matrix methods for interior point algorithms.
by: Jung, Ho-Won.
Published: (1990) -
Energy-Efficient Distributed Sparse Signal Retrieval and Event Region Detection: Algorithms and Performance Analysis
by: Yang, Ming-Hsun, et al.
Published: (2018) -
Algorithm Architecture Co-design for Dense and Sparse Matrix Computations
Published: (2018)