A fast, scalable and versatile tool for analysis of single-cell omics data
Single-cell omics technologies have revolutionized the study of gene regulation in complex
tissues. A major computational challenge in analyzing these datasets is to project the large …
tissues. A major computational challenge in analyzing these datasets is to project the large …
Efficient parameter-free clustering using first neighbor relations
We present a new clustering method in the form of a single clustering equation that is able to
directly discover grou**s in the data. The main proposition is that the first neighbor of each …
directly discover grou**s in the data. The main proposition is that the first neighbor of each …
Approximating spectral clustering via sampling: a review
Spectral clustering refers to a family of well-known unsupervised learning algorithms. Rather
than attempting to cluster points in their native domain, one constructs a (usually sparse) …
than attempting to cluster points in their native domain, one constructs a (usually sparse) …
Guarantees for spectral clustering with fairness constraints
Given the widespread popularity of spectral clustering (SC) for partitioning graph data, we
study a version of constrained SC in which we try to incorporate the fairness notion …
study a version of constrained SC in which we try to incorporate the fairness notion …
A review of Nyström methods for large-scale machine learning
Generating a low-rank matrix approximation is very important in large-scale machine
learning applications. The standard Nyström method is one of the state-of-the-art techniques …
learning applications. The standard Nyström method is one of the state-of-the-art techniques …
An efficient spectral clustering algorithm based on granular-ball
In order to solve the problem that the traditional spectral clustering algorithm is time-
consuming and resource consuming when applied to large-scale data, resulting in poor …
consuming and resource consuming when applied to large-scale data, resulting in poor …
Multi-view spectral clustering with high-order optimal neighborhood laplacian matrix
Multi-view spectral clustering can effectively reveal the intrinsic clustering structure among
data by performing clustering on the learned optimal embedding across views. Though …
data by performing clustering on the learned optimal embedding across views. Though …
Quantum spectral clustering
Spectral clustering is a powerful unsupervised machine learning algorithm for clustering
data with nonconvex or nested structures [AY Ng, MI Jordan, and Y. Weiss, On spectral …
data with nonconvex or nested structures [AY Ng, MI Jordan, and Y. Weiss, On spectral …
Combining multiple clusterings via crowd agreement estimation and multi-granularity link analysis
The clustering ensemble technique aims to combine multiple clusterings into a probably
better and more robust clustering and has been receiving an increasing attention in recent …
better and more robust clustering and has been receiving an increasing attention in recent …
Multi-view spectral clustering with optimal neighborhood Laplacian matrix
Multi-view spectral clustering aims to group data into different categories by optimally
exploring complementary information from multiple Laplacian matrices. However, existing …
exploring complementary information from multiple Laplacian matrices. However, existing …