DocumentCode
3281121
Title
Search Results Clustering Using Nonnegative Matrix Factorization (NMF)
Author
Abdulla, Hussam Dahwa ; Polovincak, Martin ; Snasel, Vaclav
Author_Institution
Dept. of Comput. Sci., VSB Tech. Univ. of Ostrava, Ostrava, Czech Republic
fYear
2009
fDate
20-22 July 2009
Firstpage
320
Lastpage
323
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 Nonnegative Matrix Factorization (NMF) can be good solution for the search results clustering.
Keywords
matrix decomposition; pattern clustering; query processing; search engines; Web user; nonnegative matrix factorization; search engine; search result clustering; Computational linguistics; Computer science; Data analysis; Data mining; Information filtering; Information filters; Information retrieval; Search engines; Social network services; Text mining; Clustering Data; Nonnegative Matrix Factorization (NMF); Search results clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Social Network Analysis and Mining, 2009. ASONAM '09. International Conference on Advances in
Conference_Location
Athens
Print_ISBN
978-0-7695-3689-7
Type
conf
DOI
10.1109/ASONAM.2009.58
Filename
5231846
Link To Document