1 citations · 1 across the 2 of their papers we have counts for
3 papers
Fast and Robust Sparsity-Aware Block Diagonal Representation
Aylin Tastan, Michael Muma, Abdelhak M. Zoubir
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 tha…
Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation
Aylin Tastan, Michael Muma, Abdelhak M. Zoubir
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 la…
Sparsity-aware Robust Community Detection(SPARCODE)
Aylin Tastan, Michael Muma, Abdelhak M. Zoubir
Community detection refers to finding densely connected groups of nodes in graphs. In important applications, such as cluster analysis and network modelling, the graph is sparse bu…