An L1-Version of the Spectral Clustering

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. Blazère, R. Burcelin and J.M. Loubes, "l1-spectral clustering algorithm: a robust spectral clustering using Lasso regularization" (2021).


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.99.5 by Magali Champion, 22 days ago

Browse source code at

Authors: Camille Champion [aut] , Magali Champion [aut, cre]

Documentation:   PDF Manual  

GPL-2 license

Imports Rcpp, stats, dplyr, graphics, igraph, Matrix, aricode, grDevices, caret, glmnet, ggplot2, cvTools

Linking to Rcpp, RcppArmadillo

See at CRAN