A fast, scalable and versatile tool for analysis of single-cell omics data

K Zhang, NR Zemke, EJ Armand, B Ren - Nature methods, 2024 - nature.com
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 …

Efficient parameter-free clustering using first neighbor relations

S Sarfraz, V Sharma… - Proceedings of the IEEE …, 2019 - openaccess.thecvf.com
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 …

Approximating spectral clustering via sampling: a review

N Tremblay, A Loukas - … Techniques for Supervised or Unsupervised Tasks, 2020 - Springer
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) …

Guarantees for spectral clustering with fairness constraints

M Kleindessner, S Samadi, P Awasthi… - International …, 2019 - proceedings.mlr.press
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 …

A review of Nyström methods for large-scale machine learning

S Sun, J Zhao, J Zhu - Information Fusion, 2015 - Elsevier
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 …

An efficient spectral clustering algorithm based on granular-ball

J **e, W Kong, S **a, G Wang… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
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 …

Multi-view spectral clustering with high-order optimal neighborhood laplacian matrix

W Liang, S Zhou, J **ong, X Liu, S Wang… - … on Knowledge and …, 2020 - ieeexplore.ieee.org
Multi-view spectral clustering can effectively reveal the intrinsic clustering structure among
data by performing clustering on the learned optimal embedding across views. Though …

Quantum spectral clustering

I Kerenidis, J Landman - Physical Review A, 2021 - APS
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 …

Combining multiple clusterings via crowd agreement estimation and multi-granularity link analysis

D Huang, JH Lai, CD Wang - Neurocomputing, 2015 - Elsevier
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 …

Multi-view spectral clustering with optimal neighborhood Laplacian matrix

S Zhou, X Liu, J Liu, X Guo, Y Zhao, E Zhu… - Proceedings of the …, 2020 - ojs.aaai.org
Multi-view spectral clustering aims to group data into different categories by optimally
exploring complementary information from multiple Laplacian matrices. However, existing …