1055 search results - page 109 / 211 » Convex Factorization Machines |
150
Voted
JMLR
2010
14 years 7 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
99
Voted
ATAL
2011
Springer
14 years 20 days ago
2011
Springer
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
98
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
93
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
86
Voted
MODELLIERUNG
2004
15 years 2 months ago
2004
: We consider socio-technical processes, i.e. processes where machines as well as humans participate. Typical examples occur in sales processes in e-commerce. Three modeling tasks ...