Sciweavers

2111 search results - page 47 / 423
» Understanding the Yarowsky Algorithm
Sort
View
JMLR
2006
123views more  JMLR 2006»
13 years 10 months ago
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies
In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but...
Fu Chang, Chin-Chin Lin, Chi-Jen Lu
AUSAI
2004
Springer
14 years 4 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
CEC
2005
IEEE
14 years 22 days ago
A new approach to dynamics analysis of genetic algorithms without selection
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
Tatsuya Okabe, Yaochu Jin, Bernhard Sendhoff
SDM
2004
SIAM
189views Data Mining» more  SDM 2004»
14 years 4 days ago
An Abstract Weighting Framework for Clustering Algorithms
act Weighting Framework for Clustering Algorithms Richard Nock Frank Nielsen Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmi...
Richard Nock, Frank Nielsen
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
13 years 8 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile