Search Results for author:
Found 3 papers, 0 papers with code
Randomized Algorithms for Symmetric Nonnegative Matrix Factorization
The second algorithm uses randomized leverage score sampling to approximately solve constrained least squares problems.
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering methods.
Hypergraph Random Walks, Laplacians, and Clustering
We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
