Sprint 1 - Implement DBSCAN and Birch algorithms to generate clusters from ndmg data. Extract features using PCA and Hessian Eigenmapping

karunkannan / R-RerF

This is the R implementation of Randomer Forest.

Apache License 2.0

1 stars 0 forks source link

Sprint 1 - Implement DBSCAN and Birch algorithms to generate clusters from ndmg data. Extract features using PCA and Hessian Eigenmapping #1

Open pmyers16 opened 6 years ago

pmyers16 commented 6 years ago

Description: Using the graph data output from ndmg, generate clusters using DBSCAN and Birch algorithms. Then generate features using PCA in addition to a method such as Hessian Eigenmapping.

DoD:

Run DBSCAN and Birch on ndmg output (using SKLearn)
Generate features using PCA and Hessian Eigenmapping (SKLearn)
Unsupervised RF algorithm run on ndmg data

jovo commented 6 years ago