Sciweavers

716 search results - page 56 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
102
Voted
ALT
2008
Springer
15 years 11 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
127
Voted
MLDM
2007
Springer
15 years 8 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
128
Voted
ICML
2009
IEEE
16 years 3 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
106
Voted
AUSAI
2008
Springer
15 years 4 months ago
Additive Regression Applied to a Large-Scale Collaborative Filtering Problem
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
Eibe Frank, Mark Hall
NECO
2008
112views more  NECO 2008»
15 years 2 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel