lingo搜索聚集原理-LingoSearchResultsClustering.PDF

Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition Stanislaw Osi´nski, Jerzy Stefanowski, and Dawid Weiss Institute of Computing Science, Pozna´n University of Technology, ul. Piotrowo 3A, 60–965 Pozna´n, Poland, E-mail: stanislaw.osinski@man.poznan.pl, {jerzy.stefanowski, dawid.weiss}@cs.put.poznan.pl Abstract. Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present Lingo—a novel algorithm for clustering search results, which emphasizes cluster description quality. We describe methods used in the algorithm: algebraic transformations of the term-document matrix and frequent phrase extraction using suffix arrays. Finally, we discuss results acquired from an empirical evaluation of the algorithm. Knowledge is of two kinds: we know a subject ourselves, or we know where we can find information about it. — Samuel Johnson, 1775 1 Introduction and related work With an enormous growth of the Internet it has become very difficult for the users to find relevant documents. In response to the user’s query, currently available search engines return a ranked list of documents along with their partial content (snippets). If the query is general, it is extremely difficult to identify the specific document which the user is interested in. The users are forced to sift through a long list of off-topic documents. Moreover, internal relationships among the documents in the search result are rarely presented and are left for the user. One of the alternative approaches is to automati- cally group search results into thematic groups (clusters). Clustering of web search