基于奇异值分解的搜索结果聚类方法

2008 International Conference on Advanced Computer Theory and Engineering Pub Date : 2008-12-20 DOI:10.1109/ICACTE.2008.143

V. Snás̃el, H. Abdulla

{"title":"基于奇异值分解的搜索结果聚类方法","authors":"V. Snás̃el, H. Abdulla","doi":"10.1109/ICACTE.2008.143","DOIUrl":null,"url":null,"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.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solution for Search Result Clustering by Using Singular Value Decomposition\",\"authors\":\"V. Snás̃el, H. Abdulla\",\"doi\":\"10.1109/ICACTE.2008.143\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":364568,\"journal\":{\"name\":\"2008 International Conference on Advanced Computer Theory and Engineering\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Advanced Computer Theory and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTE.2008.143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Advanced Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2008.143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

Web上有许多搜索引擎，但它们返回的是一长串搜索结果，按与给定查询的不相关性排序。Web用户必须浏览列表并依次检查标题和(短)片段，以确定他们需要的结果。在本文中，我们介绍了如何使用奇异值分解(SVD)作为搜索结果聚类的一个很好的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Solution for Search Result Clustering by Using Singular Value Decomposition

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 International Conference on Advanced Computer Theory and Engineering

自引率

0.00%

发文量