DocumentCode :
2200944
Title :
Solution for Search Result Clustering by Using Singular Value Decomposition
Author :
Snasel, Vaclav ; Abdulla, Hussam Dahwa
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
647
Lastpage :
651
Abstract :
There are many search engines in the Web, but they return a long list of search results, ranked by the irrelevancies 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 Singular Value Decomposition (SVD) as a very good solution for search results clustering.
Keywords :
query processing; search engines; singular value decomposition; Web; query processing; search engine; search result clustering; singular value decomposition; Computational linguistics; Computer science; Data analysis; Data mining; Information retrieval; Machine learning; Matrix decomposition; Search engines; Singular value decomposition; Sparse matrices; Data clustering; Singular Value Decomposition; search result clustering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-0-7695-3489-3
Type :
conf
DOI :
10.1109/ICACTE.2008.143
Filename :
4737037
Link To Document :
بازگشت