It is important that an optimal learning problem is proved to be NP-hard and the heuristic algorithm for solving the problem has to be given. This paper deals with a learning problem appearing in the process of simplifying fuzzy rules, proves that the solution optimization is NP-hard and gives its h
β¦ LIBER β¦
Optimal learning rules for familiarity detection
β Scribed by Andrea Greve; David C. Sterratt; David I. Donaldson; David J. Willshaw; Mark C. W. van Rossum
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 264 KB
- Volume
- 100
- Category
- Article
- ISSN
- 0340-1200
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Learning optimization in simplifying fuz
β
Xizhao Wang; Jiarong Hong
π
Article
π
1999
π
Elsevier Science
π
English
β 550 KB
βLiveβ neuron and optimal learning rule
β
L. B. Emelyanov-Yaroslavsky; V. I. Potapov
π
Article
π
1992
π
Springer-Verlag
π
English
β 503 KB
A concept of the live unit as an automatic regulation system with a few admissible states areas in the space of states is considered. Energetic profit of oscillatory behavior consisting in the consecutive transitions of system from one admissible states area to another is shown. It is stated, that e
Optimization algorithm for learning cons
β
Jun Liu; Luis Martinez; Da Ruan; Rosa Rodriguez; Alberto Calzada
π
Article
π
2010
π
Springer US
π
English
β 546 KB
Learning States and Rules for Detecting
β
Stan Salvador; Philip Chan
π
Article
π
2005
π
Springer US
π
English
β 870 KB
Learning rules for an oscillator network
β
Hidetsugu Sakaguchi
π
Article
π
1993
π
Elsevier Science
π
English
β 260 KB
Deterministic learning rules for boltzma
β
Hilbert J. Kappen
π
Article
π
1995
π
Elsevier Science
π
English
β 996 KB