1039 search results - page 40 / 208 » Kernels and Regularization on Graphs |
104
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
101
Voted
KDD
2004
ACM
16 years 28 days ago
2004
ACM
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
TSP
2008
15 years 12 days ago
2008
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...
77
Voted
DM
2008
15 years 18 days ago
2008
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
107
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...