This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 International Conference on Advances in Social Network Analysis and Mining
Search Results Clustering Using Nonnegative Matrix Factorization (NMF)
Athens, Greece
July 20-July 22
ISBN: 978-0-7695-3689-7
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.
Index Terms:
Search results clustering, Nonnegative Matrix Factorization (NMF), Clustering Data
Citation:
Hussam Dahwa Abdulla, Martin Polovincak, Vaclav Snasel, "Search Results Clustering Using Nonnegative Matrix Factorization (NMF)," asonam, pp.320-323, 2009 International Conference on Advances in Social Network Analysis and Mining, 2009
Usage of this product signifies your acceptance of the Terms of Use.