The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Toolbox containing a variety of spectral clustering tools functions. Among the tools available are the hierarchical spectral clustering algorithm, the Shi and Malik clustering algorithm, the Perona and Freeman algorithm, the non-normalized clustering, the Von Luxburg algorithm, the Partition Around Medoids clustering algorithm, a multi-level clustering algorithm, recursive clustering and the fast method for all clustering algorithm. As well as other tools needed to run these algorithms or useful for unsupervised spectral clustering. This toolbox aims to gather the main tools for unsupervised spectral classification. See <http://mawenzi.univ-littoral.fr/> for more information and documentation.
| Version: | 1.0 |
| Depends: | R (≥ 3.0.0) |
| Imports: | cluster, stats, grDevices, class |
| Published: | 2021-08-23 |
| DOI: | 10.32614/CRAN.package.sClust |
| Author: | Emilie Poisson-Caillault [aut, cre, cph], Alain Lefebvre [ctb], Erwan Vincent [aut], Pierre-Alexandre Hebert [ctb] |
| Maintainer: | Emilie Poisson-Caillault <emilie.caillault at univ-littoral.fr> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | sClust results |
| Reference manual: | sClust.pdf |
| Package source: | sClust_1.0.tar.gz |
| Windows binaries: | r-devel: sClust_1.0.zip, r-release: sClust_1.0.zip, r-oldrel: sClust_1.0.zip |
| macOS binaries: | r-release (arm64): sClust_1.0.tgz, r-oldrel (arm64): sClust_1.0.tgz, r-release (x86_64): sClust_1.0.tgz, r-oldrel (x86_64): sClust_1.0.tgz |
| Reverse imports: | graphclust |
Please use the canonical form https://CRAN.R-project.org/package=sClust to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.