417 search results - page 23 / 84 » Some Theory for Generalized Boosting Algorithms |
PODS
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
DIS
2009
Springer
14 years 3 months ago
2009
Springer
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...
NIPS
2007
13 years 10 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...