Summary: Static and Dynamic Information Organization
with Star Clusters
Javed Aslam Katya Pelekhov Daniela Rus
Department of Computer Science
Dartmouth College
Hanover, NH 03755
Abstract
In this paper we present a system for static and dy­
namic information organization and show our evaluations
of this system on TREC data. We introduce the o#­line
and on­line star clustering algorithms for information or­
ganization. Our evaluation experiments show that the o#­
line star algorithm outperforms the single link and average
link clustering algorithms. Since the star algorithm is also
highly e#cient and simple to implement, we advocate its
use for tasks that require clustering, such as information
organization, browsing, filtering, routing, topic tracking,
and new topic detection.
1 Introduction
Modern information systems have vast amounts of un­

Source: Aslam, Javed - College of Computer Science, Northeastern University

Collections: Computer Technologies and Information Sciences