1.1k citations · 5.4k across the 59 of their papers we have counts for
4 papers · 1 filter
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Yangbo He, Jinzhu Jia, Bin Yu
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are sai…
Complexity Analysis of the Lasso Regularization Path
Julien Mairal, Bin Yu
The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popul…
Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
Julien Mairal, Bin Yu
We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automati…
Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim
Karl Rohe, Tai Qin, Bin Yu
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries. We give a spectra…