Learn R Programming

l1spectral (version 0.99.6)

An L1-Version of the Spectral Clustering

Description

Provides an l1-version of the spectral clustering algorithm devoted to robustly clustering highly perturbed graphs using l1-penalty. This algorithm is described with more details in the preprint C. Champion, M. Champion, M. Blazre, R. Burcelin and J.M. Loubes, "l1-spectral clustering algorithm: a spectral clustering method using l1-regularization" (2022).

Copy Link

Version

Install

install.packages('l1spectral')

Monthly Downloads

248

Version

0.99.6

License

GPL-2

Maintainer

Magali Champion

Last Published

January 26th, 2022

Functions in l1spectral (0.99.6)

FindNbrClusters

Find the optimal number of clusters
l1spectral-package

Description of the package
CreateDataSet

Create data set
ToyData

Toy data for running the l1-spectral clustering algorithm
l1_spectralclustering

Run the l1-spectral clustering algorithm
FindStructure

Find the structure of the graph from the adjacency matrix
FindElement

Find the representative elements of the clusters
ComputePerformances

Compute the performances of the l1-spectral clustering algorithm
l1_spectral

Run the l1-spectral clustering algorithm on one component
PenOpt

Solve the internal minimization problem