Using a Matrix Decomposition for Clustering Data

Abstract

There are many search engines in the web and when asked, they return a long list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present how usage of Matrix Decomposition (Singular Value Decomposition (SVD) and Nonnegative Matrix Factorization (NMF)) can be good solution for the search results clustering.