Cluster graph data (Spectral Clustering and Gaussian Mixture) and generate features (PCA and spectral embedding)

karunkannan / R-RerF

This is the R implementation of Randomer Forest.

Apache License 2.0

1 stars 0 forks source link

Cluster graph data (Spectral Clustering and Gaussian Mixture) and generate features (PCA and spectral embedding) #16

Open karunkannan opened 5 years ago

karunkannan commented 5 years ago

Description:

Cluster graph data generated from ndmg using Spectral Clustering and Gaussian Mixture algorithms. Generate features using PCA and graph statistics method such as spectral embedding (method may still change).

DoD:

Run Spectral Clustering and Gaussian Mixture on ndmg data set using sklearn.
Generate features using PCA (sklearn)
Generate features using spectral embedding

jovo commented 5 years ago

spectral clustering is usually within not across graphs

jovo commented 5 years ago

very nice. you don't need "sprint 1" in title.