1997 search results - page 70 / 400 » On the convergence of Hill's method |
111
click to vote
JMLR
2010
14 years 11 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
90
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
110
Voted
WSC
1998
15 years 2 months ago
1998
We consider a new simulation-based optimization method called the Nested Partitions (NP) method. This method generates a Markov chain and solving the optimization problem is equiv...
94
Voted
ICASSP
2010
IEEE
15 years 28 days ago
2010
IEEE
This paper introduces a new method to maximize kurtosisbased contrast functions. Such contrast functions appear in the problem of blind source separation of convolutively mixed so...
83
Voted
ML
2002
ACM
15 years 12 days ago
2002
ACM
The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this pape...