tag:crantastic.org,2005:/authors/8120Latest activity for Carson Eisenach2019-04-07T10:01:27Zcrantastic.orgtag:crantastic.org,2005:TimelineEvent/869752019-04-07T10:01:27Z2019-04-07T10:01:27ZGFORCE was upgraded to version 0.1.4<a href="/packages/GFORCE">GFORCE</a> was <span class="action">upgraded</span> to version <a href="/packages/GFORCE/versions/82676">0.1.4</a><br /><h3>Package description:</h3><p>A complete suite of computationally efficient methods for high dimensional clustering and inference problems in G-Latent Models (a type of Latent Variable Gaussian graphical model). The main feature is the FORCE (First-Order, Certifiable, Efficient) clustering algorithm which is a fast solver for a semi-definite programming (SDP) relaxation of the K-means problem. For certain types of graphical models (G-Latent Models), with high probability the algorithm not only finds the optimal clustering, but produces a certificate of having done so. This certificate, however, is model independent and so can also be used to certify data clustering problems. The 'GFORCE' package also contains implementations of inferential procedures for G-Latent graphical models using n-fold cross validation. Also included are native code implementations of other popular clustering methods such as Lloyd's algorithm with kmeans++ initialization and complete linkage hierarchical clustering. The FORCE method is due to Eisenach and Liu (2019) <arxiv:1806.00530>.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/763722018-06-14T19:21:12Z2018-06-14T19:21:12ZGFORCE was released<a href="/packages/GFORCE">GFORCE</a> was <span class="action">released</span><br /><h3>Package description:</h3><p>A complete suite of computationally efficient methods for high dimensional clustering and inference problems in G-Latent Models (a type of Latent Variable Gaussian graphical model). The main feature is the FORCE (First-Order, Certifiable, Efficient) clustering algorithm which is a fast solver for a semi-definite programming (SDP) relaxation of the K-means problem. For certain types of graphical models (G-Latent Models), with high probability the algorithm not only finds the optimal clustering, but produces a certificate of having done so. This certificate, however, is model independent and so can also be used to certify data clustering problems. The 'GFORCE' package also contains implementations of inferential procedures for G-Latent graphical models using n-fold cross validation. Also included are native code implementations of other popular clustering methods such as Lloyd's algorithm with kmeans++ initialization and complete linkage hierarchical clustering. The FORCE method is due to Eisenach and Liu (2019) <arxiv:1806.00530>.</p>crantastic.org