Learning Sparse Graphs for Prediction and Filtering of Multivariate Data Processes
share
We address the problem of prediction and filtering of multivariate data process using an underlying graph model. We develop a method that learns a sparse partial correlation graph in a tuning-free and computationally efficient manner. Specifically, the graph structure is learned recursively without the need for cross-validation or parameter tuning by building upon a hyperparameter-free framework. Experiments using real-world datasets show that the proposed method offers significant performance gains in prediction and filtering tasks, in comparison with the graphs frequently associated with these datasets.
READ FULL TEXT
