Performs projection pursuit based on spectral connectivity to find optimal subspaces for spectral clustering. Uses the method of Hofmeyr, D., Pavlidis, N., and Eckley, I. "Minimum spectral connectivity projection pursuit", Statistics and Computing, to appear. Clustering is performed recursively by repeatedly identifying subspaces for separating (some) clusters from others. All datasets included are from the UCI machine learning repository [https://archive.ics.uci.edu/ml/datasets.html](Bache and Lichman, 2013)
Package details |
|
---|---|
Author | David Hofmeyr <dhofmeyr@sun.ac.za> [aut, cre] |
Maintainer | David Hofmeyr <dhofmeyr@sun.ac.za> |
License | GPL-3 |
Version | 0.1.0 |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.