no code implementations • 17 Mar 2016 • Qilian Yu, Easton Li Xu, Shuguang Cui
Submodular maximization problems belong to the family of combinatorial optimization problems and enjoy wide applications.
no code implementations • 12 Feb 2016 • Easton Li Xu, Xiaoning Qian, Tie Liu, Shuguang Cui
For the case when the underlying interaction graph is known to be acyclic, it is shown that a simple algorithm that is based on a maximum-weight spanning tree with respect to the plug-in estimates of the influences not only has strong theoretical performance guarantees, but can also outperform generic feature selection algorithms for recovering the interaction graph from i. i. d.