{"repository":{"description":"This project is an implementation of spectral clustering using the unnormalised (and sparse) graph Laplacian (in upper triangular form) solving the generalised eigenvalue problem using arpack++.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"dahlem","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-11-21T01:26:38-08:00","pushed_at":"2013-11-21T01:55:36-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Dominik Dahlem","company":"IBM Research","email":"f6c89deaad5bd447421dcbe3cdfef77cc07cf40b@gmail.com"},"url":"https://github.com/dahlem/spectralClustering/compare/master"}