Clustering Accuracy between two clusterings. Clustering Accuracy is a measure of the similarity between two labels of the same data. Assume th

Compute representation matrix, then apply spectral clustering Parameters ---------- X : array-like or sparse matrix, shape

Compute affinity matrix from representation matrix.

An active support based algorithm for solving the elastic net optimization problem min_{c} tau ||c||_1 + (1-tau)/2 ||c||_2^2 + alpha / 2 ||y

Dimension reduction by principal component analysis Let X^T = U S V^T be the SVD of X^T in which the singular values are in ascending order. The ou

Elastic net subspace clustering (EnSC) [1]. Compute self-representation matrix C from solving the following optimization problem min_{c_j}

This funtion generates a union of subspaces under random model, i.e., subspaces are independently and uniformly distributed in the ambient space

Least squares subspace clustering. Compute self-representation matrix C by solving the following optimization problem min_{c_j} ||c_j||

Sparse subspace clustering by orthogonal matching pursuit (SSC-OMP) Compute self-representation matrix C by solving the following optimization pr

Compute representation matrix without apply spectral clustering. Parameters ---------- X : array-like or sparse matrix, sha

Connectivity for self-expressive subspace clustering. Connectivity is a measure of how well points within each class is connected to each othe

Self-representation error for self-expressive subspace clustering. Self-representation error is a measure of whether the representation matri

Evaluation of sparsity for self-expressive subspace clustering methods. Parameters ---------- representation_matrix : array, shape = [n_sa