DocumentCode :
3540199
Title :
Clustering data using a 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 :
4-6 Aug. 2009
Firstpage :
749
Lastpage :
752
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 :
Internet; matrix decomposition; pattern clustering; query processing; search engines; World Wide Web; data clustering; nonnegative matrix factorization; search engines; Computational linguistics; Computer science; Data analysis; Data mining; Encoding; Information filtering; Information retrieval; Least squares approximation; Search engines; Text mining;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Applications of Digital Information and Web Technologies, 2009. ICADIWT '09. Second International Conference on the
Conference_Location :
London
Print_ISBN :
978-1-4244-4456-4
Electronic_ISBN :
978-1-4244-4457-1
Type :
conf
DOI :
10.1109/ICADIWT.2009.5273975
Filename :
5273975
Link To Document :
بازگشت