ECML
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
In this article, I will consider Markov Decision Processes with two criteria, each defined as the expected value of an infinite horizon cumulative return. The second criterion is e...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper is about the evaluation of the results of clustering algorithms, and the comparison of such algorithms. We propose a new method based on the enrichment of a se...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
COLT
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
COLT
2005
Springer
13 years 9 months ago
2005
Springer
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
COLT
2005
Springer
13 years 9 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
COLT
2006
Springer
13 years 9 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
COLT
2006
Springer
13 years 9 months ago
2006
Springer