Boosting Ensembles of Weak Classifiers in High Dimensional Input Spaces
Book chapter (March 2009)
The most recent citing publication is shown below. View this citation on Dimensions.
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 18 Strategic directions in machine learning
-
Altmetric BadgeChapter 19 Introduction
-
Altmetric BadgeChapter 20 Training a 3-node neural network is NP-complete
-
Altmetric BadgeChapter 21 Cryptographic limitations on learning Boolean formulae and finite automata
-
Altmetric BadgeChapter 22 Inference of finite automata using homing sequences
-
Altmetric BadgeChapter 23 Introduction
-
Altmetric BadgeChapter 24 Adaptive search by learning from incomplete explanations of failures
-
Altmetric BadgeChapter 25 Learning of rules for fault diagnosis in power supply networks
-
Altmetric BadgeChapter 26 Cross references are features
-
Altmetric BadgeChapter 27 The schema mechanism
-
Altmetric BadgeChapter 28 L-ATMS: A tight integration of EBL and the ATMS
-
Altmetric BadgeChapter 29 Introduction
-
Altmetric BadgeChapter 30 Massively parallel symbolic induction of protein structure/function relationships
-
Altmetric BadgeChapter 31 Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks
-
Altmetric BadgeChapter 32 Phoneme discrimination using connectionist networks
-
Altmetric BadgeChapter 33 Behavior-based learning to control IR oven heating: Preliminary investigations
-
Altmetric BadgeChapter 34 Trellis codes, receptive fields, and fault tolerant, self-repairing neural networks
Attention for Chapter 31:
Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks
Altmetric Badge
Citations
- dimensions_citation
- 1 Dimensions
Readers on
- mendeley
- 6 Mendeley
- citeulike
- 2 CiteULike