Title
QC4: a clustering evaluation method
Abstract
Many clustering algorithms have been developed and researchers need to be able to compare their effectiveness. For some clustering problems, like web page clustering, different algorithms produce clusterings with different characteristics: coarse vs fine granularity, disjoint vs overlapping, flat vs hierarchical. The lack of a clustering evaluation method that can evaluate clusterings with different characteristics has led to incomparable research and results. QC4 solves this by providing a new structure for defining general ideal clusterings and new measurements for evaluating clusterings with different characteristics with respect to a general ideal clustering. The paper describes QC4 and evaluates it within the web clustering domain by comparison to existing evaluation measurements on synthetic test cases and on real world web page clustering tasks. The synthetic test cases show that only QC4 can cope correctly with overlapping clusters, hierarchical clusterings, and all the difficult boundary cases. In the real world tasks, which represent simple clustering situations, QC4 is mostly consistent with the existing measurements and makes better conclusions in some cases.
Year
DOI
Venue
2007
10.1007/978-3-540-71701-0_9
PAKDD
Keywords
Field
DocType
hierarchical clusterings,simple clustering situation,clustering evaluation method,general ideal clustering,different characteristic,web page clustering,clustering algorithm,general ideal clusterings,clustering problem,synthetic test case,hierarchical clustering,web pages
Hierarchical clustering,Data mining,Fuzzy clustering,Canopy clustering algorithm,CURE data clustering algorithm,Correlation clustering,Computer science,Artificial intelligence,Constrained clustering,Cluster analysis,Machine learning,Single-linkage clustering
Conference
Volume
ISSN
Citations 
4426
0302-9743
6
PageRank 
References 
Authors
0.48
7
3
Name
Order
Citations
PageRank
Daniel Crabtree1654.39
Peter Andreae235831.85
Xiaoying Gao322032.95