Search Results for author:
Found 3 papers, 2 papers with code
Fast and Robust Sparsity-Aware Block Diagonal Representation
The block diagonal structure of an affinity matrix is a commonly desired property in cluster analysis because it represents clusters of feature vectors by non-zero coefficients that are concentrated in blocks.
Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation
The Fiedler vector of a connected graph is the eigenvector associated with the algebraic connectivity of the graph Laplacian and it provides substantial information to learn the latent structure of a graph.
Sparsity-aware Robust Community Detection(SPARCODE)
We compare the performance to popular graph and cluster-based community detection approaches on a variety of benchmark network and cluster analysis data sets.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
