spectralGraphTopology (0.1.2)

Learning Graphs from Data via Spectral Constraints.

https://github.com/dppalomar/spectralGraphTopology
https://mirca.github.io/spectralGraphTopology
https://www.danielppalomar.com
http://cran.r-project.org/web/packages/spectralGraphTopology

Block coordinate descent estimators to learn k-component, bipartite, and k-component bipartite graphs from data by imposing spectral constraints on the eigenvalues and eigenvectors of the Laplacian and adjacency matrices. Those estimators leverages spectral properties of the graphical models as a prior information, which turn out to play key roles in unsupervised machine learning tasks such as clustering and community detection. This package is based on the paper "A Unified Framework for Structured Graph Learning via Spectral Constraints" by S. Kumar et al (2019) .

Maintainer: Ze Vinicius
Author(s): Ze Vinicius [cre, aut], Daniel P. Palomar [aut]

License: GPL-3

Uses: MASS, Matrix, progress, Rcpp, rlist, R.rsp, clusterSim, igraph, kernlab, matrixcalc, quadprog, testthat, corrplot, knitr, rmarkdown, viridis, bookdown, prettydoc, pals, CVXR, patrick

Released 8 months ago.