Spectrum: Fast Adaptive Spectral Clustering for Single and Multi-View Data

A self-tuning spectral clustering method for single or multi-view data. 'Spectrum' uses a new type of adaptive density aware kernel that strengthens connections in the graph based on common nearest neighbours. It uses a tensor product graph data integration and diffusion procedure to integrate different data sources and reduce noise. 'Spectrum' uses either the eigengap or multimodality gap heuristics to determine the number of clusters. The method is sufficiently flexible so that a wide range of Gaussian and non-Gaussian structures can be clustered with automatic selection of K.

Version: 1.0
Depends: R (≥ 3.5.0)
Imports: ggplot2, ClusterR, Rfast, diptest
Suggests: knitr
Published: 2019-12-03
Author: Christopher R John, David Watson
Maintainer: Christopher R John <chris.r.john86 at gmail.com>
License: AGPL-3
NeedsCompilation: no
In views: Cluster
CRAN checks: Spectrum results

Downloads:

Reference manual: Spectrum.pdf
Vignettes: Spectrum
Package source: Spectrum_1.0.tar.gz
Windows binaries: r-devel: Spectrum_1.0.zip, r-devel-gcc8: Spectrum_1.0.zip, r-release: Spectrum_1.0.zip, r-oldrel: Spectrum_1.0.zip
OS X binaries: r-release: Spectrum_1.0.tgz, r-oldrel: Spectrum_1.0.tgz
Old sources: Spectrum archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=Spectrum to link to this page.