getSpectralClusters: Clustering with the smallest eigenvectors from eigenvector...
In SpecDetec: Change Points Detection with Spectral Clustering
Description
Usage
Arguments
Details
Value
Author(s)
View source: R/SpectralClustering.R
Description
Clustering with the smallest eigenvectors from eigenvector Matrix
Usage
1
getSpectralClusters(eigenvectorMatrix, numberOfClusters = 2)
Arguments
eigenvectorMatrix
Eigenvector matrix based on the affinity matrix
numberOfClusters
maximum number of clusters for prediction
Details
Modified standard function present in kernlab to perform clustering with
graph spectrum using standard version of K-Means
Value
K-Means Cluster Object
Author(s)
Luis Gustavo Uzai
SpecDetec documentation built on May 2, 2019, 1:08 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Author(s)
View source: R/SpectralClustering.R
Description
Clustering with the smallest eigenvectors from eigenvector Matrix
Usage
1 | getSpectralClusters(eigenvectorMatrix, numberOfClusters = 2)
|
Arguments
eigenvectorMatrix |
Eigenvector matrix based on the affinity matrix |
numberOfClusters |
maximum number of clusters for prediction |
Details
Modified standard function present in kernlab to perform clustering with graph spectrum using standard version of K-Means
Value
K-Means Cluster Object
Author(s)
Luis Gustavo Uzai
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.