Learning Optimal Discriminant Functions through a Cooperative Game of Automata
From MaRDI portal
Recommendations
Cited in
(14)- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks
- Using a priori knowledge to create probabilistic models for optimization.
- Algorithms for Steiner connected dominating set problem based on learning automata theory
- A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
- On ε-Optimality of the Pursuit Learning Algorithm
- A hierarchical system of learning automata that can learn the globally optimal path
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
- Continuous action set learning automata for stochastic optimization
- Absolutely expedient algorithms for learning Nash equilibria
- A new continuous action-set learning automaton for function optimization
- Stochastic approximation algorithms: overview and recent trends.
- Learning automata algorithms for pattern classification.
- Stochastic automata and learning systems.
This page was built for publication: Learning Optimal Discriminant Functions through a Cooperative Game of Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771625)