Clustering and latent semantic indexing aspects of the singular value decomposition Online publication date: Tue, 05-Apr-2016
by Andri Mirzal
International Journal of Information and Decision Sciences (IJIDS), Vol. 8, No. 1, 2016
Abstract: This paper discusses clustering and latent semantic indexing (LSI) aspects of the singular value decomposition (SVD). The purposes of this paper are two-fold. The first is to give a review on how and why the singular vectors can be used in clustering. And the second is to show that the two seemingly unrelated aspects actually originate from the same source: related vertices tend to be more clustered in the graph representation of lower rank approximate matrix using the SVD than in the original semantic graph. By utilising this fact, we devise an LSI algorithm that mimics SVD capability in grouping related vertices. The proposed algorithm is more practical and easier to use because there is no need to determine decomposition rank which is crucial in driving retrieval performance of the SVD. Moreover, convergence analysis shows that the algorithm is convergent and produces a unique solution. Experimental results using some standard datasets in LSI research show that retrieval performances of the algorithm are comparable to retrieval performances of the SVD.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook