English
Related papers

Related papers: The Cluster Graphical Lasso for improved estimatio…

200 papers

We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In…

Machine Learning · Statistics 2017-06-06 Qiang Sun , Kean Ming Tan , Han Liu , Tong Zhang

Graph model is emerging as a very effective tool for learning the complex structures and relationships hidden in data. Generally, the critical purpose of graph-oriented learning algorithms is to construct an informative graph for image…

Computer Vision and Pattern Recognition · Computer Science 2016-12-21 Qingshan Liu , Yubao Sun , Cantian Wang , Tongliang Liu , Dacheng Tao

In recent years, there is a growing interest in combining techniques attributed to the areas of Statistics and Machine Learning in order to obtain the benefits of both approaches. In this article, the statistical technique lasso for…

Machine Learning · Statistics 2023-09-08 David Delgado , Ernesto Curbelo , Danae Carreras

We propose a novel graphical model selection (GMS) scheme for high-dimensional stationary time series or discrete time process. The method is based on a natural generalization of the graphical LASSO (gLASSO), introduced originally for GMS…

Machine Learning · Statistics 2023-07-19 Alexander Jung , Gabor Hannak , Norbert Görtz

The paper tackles the problem of clustering multiple networks, directed or not, that do not share the same set of vertices, into groups of networks with similar topology. A statistical model-based approach based on a finite mixture of…

Statistics Theory · Mathematics 2023-11-07 Tabea Rebafka

In recent literature, the Gaussian Graphical model (GGM; Lauritzen, 1996),a network of partial correlation coefficients, has been used to capture potential dynamic relationships between observed variables. The GGM can be estimated using…

Methodology · Statistics 2017-09-25 Sacha Epskamp

We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…

Methodology · Statistics 2023-06-26 Kartik G. Waghmare , Tomas Masak , Victor M. Panaretos

Cluster analysis of biological samples using gene expression measurements is a common task which aids the discovery of heterogeneous biological sub-populations having distinct mRNA profiles. Several model-based clustering algorithms have…

Methodology · Statistics 2012-01-30 Alberto Cozzini , Ajay Jasra , Giovanni Montana

We propose a new modeling framework for highly-multivariate spatial processes that synthesizes ideas from recent multiscale and spectral approaches with graphical models. The basis graphical lasso writes a univariate Gaussian process as a…

Methodology · Statistics 2024-07-08 Mitchell Krock , William Kleiber , Dorit Hammerling , Stephen Becker

Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this…

Machine Learning · Statistics 2016-11-17 Yudong Chen , Sujay Sanghavi , Huan Xu

Finite Gaussian mixture models provide a powerful and widely employed probabilistic approach for clustering multivariate continuous data. However, the practical usefulness of these models is jeopardized in high-dimensional spaces, where…

Methodology · Statistics 2022-05-13 Alessandro Casa , Andrea Cappozzo , Michael Fop

Graphical modelling techniques based on sparse selection have been applied to infer complex networks in many fields, including biology and medicine, engineering, finance, and social sciences. One structural feature of some of the networks…

Statistics Theory · Mathematics 2020-03-03 Annaliza McGillivray , Abbas Khalili , David A. Stephens

Gaussian mixture block models are distributions over graphs that strive to model modern networks: to generate a graph from such a model, we associate each vertex $i$ with a latent feature vector $u_i \in \mathbb{R}^d$ sampled from a mixture…

Machine Learning · Statistics 2024-04-12 Shuangping Li , Tselil Schramm

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) based on Hub Graphical Lasso (HGL) by providing prior information of hubs. We apply this new method in two situations: with known hubs and without known hubs. Then we…

Machine Learning · Statistics 2017-05-19 Zhen Li , Jingtian Bai , Weilian Zhou

This thesis studies two problems in modern statistics. First, we study selective inference, or inference for hypothesis that are chosen after looking at the data. The motiving application is inference for regression coefficients selected by…

Machine Learning · Statistics 2015-07-02 Jason D. Lee

Sparse high dimensional graphical model selection is a popular topic in contemporary machine learning. To this end, various useful approaches have been proposed in the context of $\ell_1$-penalized estimation in the Gaussian framework.…

Computation · Statistics 2022-02-04 Sang-Yun Oh , Onkar Dalal , Kshitij Khare , Bala Rajaratnam

Gaussian graphical model is a graphical representation of the dependence structure for a Gaussian random vector. It is recognized as a powerful tool in different applied fields such as bioinformatics, error-control codes, speech language,…

Machine Learning · Statistics 2017-01-10 Valery A. Kalyagin , Alexander P. Koldanov , Petr A. Koldanov , Panos M. Pardalos

Components of biological systems interact with each other in order to carry out vital cell functions. Such information can be used to improve estimation and inference, and to obtain better insights into the underlying cellular mechanisms.…

Machine Learning · Statistics 2010-07-06 Ali Shojaie , George Michailidis

We consider the problem of learning a high-dimensional graphical model in which certain hub nodes are highly-connected to many other nodes. Many authors have studied the use of an l1 penalty in order to learn a sparse graph in…

Machine Learning · Statistics 2014-08-12 Kean Ming Tan , Palma London , Karthik Mohan , Su-In Lee , Maryam Fazel , Daniela Witten

We consider the problem of learning a structured multi-task regression, where the output consists of multiple responses that are related by a graph and the correlated response variables are dependent on the common inputs in a sparse but…

Machine Learning · Statistics 2010-05-21 Xi Chen , Seyoung Kim , Qihang Lin , Jaime G. Carbonell , Eric P. Xing