Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2004

Chapter type

chapter in monograph / paper

Publication language

english

Abstract

EN 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.

Pages (from - to)

359 - 368

DOI

10.1007/978-3-540-39985-8_37

URL

https://link.springer.com/chapter/10.1007/978-3-540-39985-8_37

Book

Intelligent Information Processing and Web Mining : Proceedings of the International IIS: IIPWM‘04 Conference held in Zakopane, Poland, May 17–20, 2004

Presented on

International IIS: IIPWM‘04 Conference, 17-20.05.2004, Zakopane, Polska

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.