SVD BASED LATENT SEMANTIC INDEXING WITH USE OF THE GPU COMPUTATIONS release_ii2ekfasf5cphi3qajukmvc4lq

by Raczyński Damian, Stanisławski Włodzimierz

Published by Zenodo.

2017  

Abstract

The purpose of this article is to determine the usefulness of the Graphics Processing Unit (GPU) calculations used to implement the Latent Semantic Indexing (LSI) reduction of the TERM-BYDOCUMENT matrix. Considered reduction of the matrix is based on the use of the SVD (Singular Value Decomposition) decomposition. A high computational complexity of the SVD decomposition - O(n3 ), causes that a reduction of a large indexing structure is a difficult task. In this article there is a comparison of the time complexity and accuracy of the algorithms implemented for two different environments. The first environment is associated with the CPU and MATLAB R2011a. The second environment is related to graphics processors and the CULA library. The calculations were carried out on generally available benchmark matrices, which were combined to achieve the resulting matrix of high size. For both considered environments computations were performed for double and single precision data.
In text/plain format

Archived Files and Locations

application/pdf  873.9 kB
file_c4zpn24255fdtlqznnkjstjgom
zenodo.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2017-08-30
Language   en ?
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 55405f39-df57-4699-9dbf-8acc247232e7
API URL: JSON