Sciweavers

3050 search results - page 379 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICML
2007
IEEE
16 years 5 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
ICML
2007
IEEE
16 years 5 months ago
Graph clustering with network structure indices
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...
Matthew J. Rattigan, Marc Maier, David Jensen
COLT
2006
Springer
15 years 8 months ago
A Sober Look at Clustering Stability
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
Shai Ben-David, Ulrike von Luxburg, Dávid P...
ECML
2005
Springer
15 years 7 months ago
Clustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
Liviu Badea