Name
Abstract | ||
|---|---|---|
In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm which responds to the structure of this problem through the relationship between submodularity and convexity. The D.S. programming problem covers a broad range of applications in machine learning because this generalizes the optimization of a wide class of set functions. We empirically investigate the performance of our algorithm, and illustrate the difference between exact and approximate solutions respectively obtained by the proposed and existing algorithms in feature selection and discriminative structure learning. |
Year | Venue | Keywords |
|---|---|---|
2011 | neural information processing systems | machine learning,feature selection,data structure,branch and bound |
DocType | Volume | Citations |
Conference | abs/1108.4217 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kawahara, Yoshinobu | 1 | 317 | 31.30 |
| Takashi Washio | 2 | 1775 | 190.58 |