Sciweavers

762 search results - page 62 / 153
» Constructive Neural Network Learning Algorithms
Sort
View
ML
2000
ACM
157views Machine Learning» more  ML 2000»
15 years 2 months ago
A Multistrategy Approach to Classifier Learning from Time Series
We present an approach to inductive concept learning using multiple models for time series. Our objective is to improve the efficiency and accuracy of concept learning by decomposi...
William H. Hsu, Sylvian R. Ray, David C. Wilkins
135
Voted
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 3 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
ESWA
2008
169views more  ESWA 2008»
15 years 1 months ago
Predicting opponent's moves in electronic negotiations using neural networks
Electronic negotiation experiments provide a rich source of information about relationships between the negotiators, their individual actions, and the negotiation dynami...
Réal Carbonneau, Gregory E. Kersten, Rustam...
96
Voted
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 7 months ago
Investigating whether hyperNEAT produces modular neural networks
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
Jeff Clune, Benjamin E. Beckmann, Philip K. McKinl...
134
Voted
ICANNGA
2009
Springer
203views Algorithms» more  ICANNGA 2009»
15 years 9 months ago
NEAT in HyperNEAT Substituted with Genetic Programming
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
Zdenek Buk, Jan Koutník, Miroslav Snorek