Sciweavers

716 search results - page 69 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
ML
2007
ACM
192views Machine Learning» more  ML 2007»
15 years 1 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
ICML
2004
IEEE
16 years 3 months ago
Margin based feature selection - theory and algorithms
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
ALT
2009
Springer
15 years 11 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
154
Voted
COMBINATORICA
2010
14 years 11 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
ICML
2004
IEEE
16 years 3 months ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao