Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Conceptual Modeling of Coincident Failures in Multiversion Software
IEEE Transactions on Software Engineering
The Strength of Weak Learnability
Machine Learning
Learning internal representations by error propagation
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Letter Recognition Using Holland-Style Adaptive Classifiers
Machine Learning
A competitive modular connectionist architecture
NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
Evaluation of adaptive mixtures of competing experts
NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
Neural networks and the bias/variance dilemma
Neural Computation
Hierarchical mixtures of experts and the EM algorithm
Neural Computation
Network generalization differences quantified
Neural Networks
Bias/variance analyses of mixtures-of-experts architectures
Neural Computation
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
Improving Performance in Neural Networks Using a Boosting Algorithm
Advances in Neural Information Processing Systems 5, [NIPS Conference]
Adaptive mixtures of local experts
Neural Computation
Engineering multiversion neural-net systems
Neural Computation
Boosting and other ensemble methods
Neural Computation
A SOM based model combination strategy
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
| Hi-index | 0.00 |
This paper discusses some of the issues raised by various approaches to decomposing functions and modular networks, and it offers a unified framework for multiple classifier (MC) systems in general. It argues that as yet there is no general approach to this problem although several approaches provide solutions to situations in which parametric labelling of a function allows the task facing classifying networks to be simplified. An MC connectionist system consisting of networks that process sub-spaces within a function based upon the similarity of patterns within its input domain is proposed and evaluated in the context of previous approaches to modular networks, and in the broader context of MC systems more generally. This simple automatic partitioning scheme is investigated using several different problems, and is shown to be effective. The degree to which the sub-spaces are specialized on a predictable subset of the overall function is assessed, and their performance is compared with equivalent single-network, and undivided multiversion systems. Statistical measures of 'diversity' previously used to assess voting MC systems are shown to apply to the measurement of the the degree of specialization or bias within groups of sub-space nets as well as provide a useful indicator across the range of MC systems. By successively increasing the overlap between sub-space partitions we show a transition from experts subnets, through voting version sets to optimal single classifiers. Finally, a unified framework for MC systems is presented.