1039 search results - page 37 / 208 » Kernels and Regularization on Graphs |
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
122
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
98
Voted
CPC
2007
15 years 15 days ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
81
Voted
ECHT
1992
15 years 4 months ago
1992
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
JMLR
2010
14 years 7 months ago
2010
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...