Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

NIPS
2004

favoriteEmaildiscussreport

122views Information Technology» more NIPS 2004»

Maximum-Margin Matrix Factorization

13 years 5 months ago

Maximum-Margin Matrix Factorization

Download ttic.uchicago.edu

We present a novel approach to collaborative prediction, using low-norm instead of low-rank factorizations. The approach is inspired by, and has strong connections to, large-margin linear discrimination. We show how to learn low-norm factorizations by solving a semi-definite program, and discuss generalization error bounds for them.

Nathan Srebro, Jason D. M. Rennie, Tommi Jaakkola

Real-time Traffic

Generalization Error Bounds | Large-margin Linear Discrimination | Low-rank Factorizations | NIPS 2004 | NIPS 2007 |

claim paper

Related Content

» Fast maximum margin matrix factorization for collaborative prediction

» Improving maximum margin matrix factorization

» Feature Extraction base on Local Maximum Margin Criterion

» Maximum Margin Clustering

» Maximum marginal likelihood estimation for nonnegative dictionary learning

» Unsupervised Maximum Margin Feature Selection with Manifold Regularization

» Maximum Margin Temporal Clustering

» Convex nonnegative matrix factorization for massive datasets

» Automatic Factorization of Biological Signals Measured by Fluorescence Correlation Spectro...

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	NIPS
Authors	Nathan Srebro, Jason D. M. Rennie, Tommi Jaakkola

Comments (0)