Generating, Visualizing and Evaluating High Quality Clusters for Information Organization

Dartmouth Technical Report PCS-TR97-319

	J. Aslam
	K. Pelekhov
	Daniela Rus

Date: August 1997

URL (compressed postscript): <http://www.cs.dartmouth.edu/reports/TR97-319.ps.Z> (196KB)

URL (PDF): <http://www.cs.dartmouth.edu/reports/TR97-319.pdf> (232KB)

Abstract:
 We present and analyze the star clustering algorithm. We discuss
 an implementation of this algorithm that supports browsing and
 document retrieval through information organization. We define three
 parameters for evaluating a clustering algorithm to measure the topic
 separation and topic aggregation achieved by the algorithm. In the
 absence of benchmarks, we present a method for randomly generating
 clustering data. Data from our user study shows evidence that the star
 algorithm is effective for organizing information.

Note:
 Submitted to the 1998 SIGIR Conference.