spectralClustering: Our implementation of spectral clustering

Description Usage Arguments Value

View source: R/clustering.R

Description

Given a data matrix x, samples are clustered into k groups using a spectral (eigen-) decomposition of the graph Laplacian. Uses the implementation of kmeans from this package 'k_means'.

Usage

1
spectralClustering(x, c = 1, k = 10)

Arguments

x

numeric matrix of data, where rows are samples

c
k

the number of groups

Value

vector of groups


g-l-mansell/RcppRidge documentation built on Dec. 20, 2021, 9:43 a.m.