2177 search results - page 204 / 436 » Relative Margin Machines |
143
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
164
Voted
COLT
1995
Springer
15 years 7 months ago
1995
Springer
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
139
click to vote
COLT
2006
Springer
15 years 6 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...
111
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
156
click to vote
ICMLA
2010
15 years 2 months ago
2010
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...