Activity Number:
|
321
|
Type:
|
Contributed
|
Date/Time:
|
Wednesday, August 14, 2002 : 12:00 PM to 1:50 PM
|
Sponsor:
|
Section on Statistical Computing*
|
Abstract - #301603 |
Title:
|
The Clustergram: A Graph for Visualizing Non-Hierarchical Cluster Analyses of Large Data Sets
|
Author(s):
|
Matthias Schonlau*+
|
Affiliation(s):
|
RAND Corporation
|
Address:
|
1700 Main Street , Santa Monica , California, 90407, USA
|
Keywords:
|
visualization ; cluster analysis ; kmeans ; graph ; data mining ; dendrogram
|
Abstract:
|
In hierarchical cluster analysis, dendrogram graphs are used to visualize how clusters are formed. I propose an alternate graph, named clustergram, to examine how cluster members are assigned to clusters as the number of clusters increases. This graph is useful in exploratory analysis for non-hierarchical clustering algorithms like Kmeans and for hierarchical cluster algorithms when the number of observations is large enough to make dendrograms impractical.
|
- The address information is for the authors that have a + after their name.
- Authors who are presenting talks have a * after their name.
Back to the full JSM 2002 program |