172
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
139
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
143
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...
154
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
In the multi-view regression problem, we have a regression problem where the input variable (which is a real vector) can be partitioned into two different views, where it is assum...
109
Voted
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
121
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
144
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...