DocumentCode
484860
Title
Using Singular Value Decomposition (SVD) as a solution for search result clustering
Author
Abdulla, Hussam Dahwa ; Snasel, Vaclav
Author_Institution
Dept. of Comput. Sci., VSB - Tech. Univ. of Ostrava, Ostrava
fYear
2008
fDate
16-18 Dec. 2008
Firstpage
302
Lastpage
306
Abstract
There are many search engines in the web, but 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 Singular Value Decomposition (SVD) as a very good solution for search results clustering.
Keywords
pattern clustering; search engines; singular value decomposition; Web users; search engines; search result clustering; singular value decomposition; Computational linguistics; Computer science; Data mining; Information analysis; Information filtering; Information retrieval; Machine learning; Matrix decomposition; Search engines; Singular value decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Innovations in Information Technology, 2008. IIT 2008. International Conference on
Conference_Location
Al Ain
Print_ISBN
978-1-4244-3396-4
Electronic_ISBN
978-1-4244-3397-1
Type
conf
DOI
10.1109/INNOVATIONS.2008.4781642
Filename
4781642
Link To Document