Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"vector valued graph"”.

  1. Vertex Weighted Spectral Clustering

    … 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 eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler …

    etsu Repository record for Vertex Weighted Spectral Clustering (opens in a new tab) Download PDF for Vertex Weighted Spectral Clustering (opens in a new tab)