Sciweavers

12194 search results - page 71 / 2439
» Numberings Optimal for Learning
Sort
View
120
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 1 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
115
Voted
ICML
2007
IEEE
16 years 1 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
ECML
2006
Springer
15 years 4 months ago
Efficient Prediction-Based Validation for Document Clustering
Recently, stability-based techniques have emerged as a very promising solution to the problem of cluster validation. An inherent drawback of these approaches is the computational c...
Derek Greene, Padraig Cunningham
88
Voted
ALT
2008
Springer
15 years 9 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
82
Voted
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 1 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...