Sciweavers

ICML
2004
IEEE
14 years 8 months ago
Extensions of marginalized graph kernels
Jean-Luc Perret, Jean-Philippe Vert, Nobuhisa Ueda...
ICML
2004
IEEE
14 years 8 months ago
The multiple multiplicative factor model for collaborative filtering
We describe a class of causal, discrete latent variable models called Multiple Multiplicative Factor models (MMFs). A data vector is represented in the latent space as a vector of...
Benjamin M. Marlin, Richard S. Zemel
ICML
2004
IEEE
14 years 8 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
ICML
2004
IEEE
14 years 8 months ago
Dynamic abstraction in reinforcement learning via clustering
Abstraction in Reinforcement Learning via Clustering Shie Mannor shie@mit.edu Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA ...
Shie Mannor, Ishai Menache, Amit Hoze, Uri Klein
ICML
2004
IEEE
14 years 8 months ago
Hyperplane margin classifiers on the multinomial manifold
The assumptions behind linear classifiers for categorical data are examined and reformulated in the context of the multinomial manifold, the simplex of multinomial models furnishe...
Guy Lebanon, John D. Lafferty
ICML
2004
IEEE
14 years 8 months ago
Sparse cooperative Q-learning
Jelle R. Kok, Nikos A. Vlassis
ICML
2004
IEEE
14 years 8 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
ICML
2004
IEEE
14 years 8 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
ICML
2004
IEEE
14 years 8 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
ICML
2004
IEEE
14 years 8 months ago
Robust feature induction for support vector machines
The goal of feature induction is to automatically create nonlinear combinations of existing features as additional input features to improve classification accuracy. Typically, no...
Rong Jin, Huan Liu