Vertex Weighted Spectral Clustering

Vertex Weighted Spectral Clustering

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvecto...

Full description

Bibliographic Details
Main Author: Masum, Mohammad
Format: Others
Language:English
Published: Digital Commons @ East Tennessee State University 2017
Subjects:
Fiedler vector
Laplacian matrix
cosine similarity based clustering
unassociated data
vertex weighted graph
vector valued graph
Discrete Mathematics and Combinatorics
Other Mathematics
Theory and Algorithms
Online Access:https://dc.etsu.edu/etd/3266
https://dc.etsu.edu/cgi/viewcontent.cgi?article=4700&context=etd

Internet

https://dc.etsu.edu/etd/3266
https://dc.etsu.edu/cgi/viewcontent.cgi?article=4700&context=etd

Similar Items