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

Conceptual Clustering Using Lingo Algorithm: Evaluation on Open Directory Project Data

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 hits list, returned from a search engine. In this paper we present the results of an experimental evaluation of a new algorithm named Lingo. We use Open Directory Project as a source of high-quality narrow-topic document references and mix them into several multi-topic test sets for the algorithm We then compare the clusters acquired from Lingo to the expected set of ODP categories mixed in the input. Finally we discuss observations from the experiment, highlighting the algorithm’s strengths and weaknesses and conclude with research directions for the future.

Pages (from - to)

369 - 377

DOI

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

URL

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

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.