Sciweavers

12194 search results - page 356 / 2439
» Numberings Optimal for Learning
Sort
View
KAIS
2000
106views more  KAIS 2000»
15 years 6 months ago
FANNC: A Fast Adaptive Neural Network Classifier
In this paper, a fast adaptive neural network classifier named FANNC is proposed. FANNC exploits the advantages of both adaptive resonance theory and field theory. It needs only on...
Zhi-Hua Zhou, Shifu Chen, Zhaoqian Chen
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
15 years 12 months ago
Focusing versus Intransitivity
Abstract. Recently, a minimal domain dubbed the numbers game has been proposed to illustrate well-known issues in co-evolutionary dynamics. The domain
Anthony Bucci, Jordan B. Pollack
CORIA
2008
15 years 8 months ago
Involving Validity Indices in Document Clustering
The goal of any clustering algorithm is to find the optimal clustering solution with the optimal number of clusters. In order to evaluate a clustering solution, a number of validit...
Ahmad El Sayed, Hakim Hacid, Djamel A. Zighed
ECCC
2007
180views more  ECCC 2007»
15 years 6 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
ECAI
2006
Springer
15 years 10 months ago
Patch Learning for Incremental Classifier Design
We present a learning algorithm for nominal data. It builds a classifier by adding iteratively a simple patch function that modifies the current classifier. Its main advantage lies...
Rudy Sicard, Thierry Artières, Eric Petit