Improving Clustering with Graph Smoothing

Colley, Charles A.

Abstract:Clustering is a data mining technique which offers insight into datasets based offof similarities of elements to each other. Spectral clustering uses decompositionsof matrix representations of graphs to find appropriate clusters in a data set. Inthis thesis we propose two new methods to improve spectral clustering, SmoothedEmbedding clustering and Graph Smoothed clustering which involve p... read more

This object is in collection:
Undergraduate honors theses
Cluster analysis.
Data mining.
Graph theory.
Smoothing (Statistics)
Tufts University. Department of Mathematics.
Permanent URL
ID: tufts:sd.0000468
To Cite: DCA Citation Guide
Usage: Detailed Rights