Sciweavers

3378 search results - page 41 / 676
» Learning in Friedberg Numberings
Sort
View
COMBINATORICA
2010
14 years 10 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
ICANN
2005
Springer
15 years 6 months ago
Reducing the Effect of Out-Voting Problem in Ensemble Based Incremental Support Vector Machines
Although Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems, they suffer from the catastrophic forgetti...
Zeki Erdem, Robi Polikar, Fikret S. Gürgen, N...
ICML
2006
IEEE
16 years 1 months ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil
100
Voted
ICML
2005
IEEE
16 years 1 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
ICML
1996
IEEE
16 years 1 months ago
Unsupervised Learning Using MML
This paper discusses the unsupervised learning problem. An important part of the unsupervised learning problem is determining the numberofconstituent groups (componentsor classes)...
Jonathan J. Oliver, Rohan A. Baxter, Chris S. Wall...