Journal
APPLIED MATHEMATICAL MODELLING
Volume 34, Issue 12, Pages 3884-3895Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2010.03.027
Keywords
Modular neural networks; Task decomposition; Affinity propagation; Time consumption; Generalization capability
Funding
- Research Fund for the Doctoral Program of Higher Education of China [200803591024]
- National Natural Science Foundation of China [60875012, 60828005, 60672120]
- National 973 Program of China [2009CB326203]
- French National Agency of Research [ANR-06-MDCA-002]
Ask authors/readers for more resources
In this paper, a matrix modular neural network (MMNN) based on task decomposition with subspace division by adaptive affinity propagation clustering is developed to solve classification tasks. First, we propose an adaptive version to affinity propagation clustering, which is adopted to divide each class subspace into several clusters. By these divisions of class spaces, a classification problem can be decomposed into many binary classification subtasks between cluster pairs, which are much easier than the classification task in the original multi-class space. Each of these binary classification subtasks is solved by a neural network designed by a dynamic process. Then all designed network modules form a network matrix structure, which produces a matrix of outputs that will be fed to an integration machine so that a classification decision can be made. Finally, the experimental results show that our proposed MMNN system has more powerful generalization capability than the classifiers of single 3-layered perceptron and modular neural networks adopting other task decomposition techniques, and has a less training time consumption. (C) 2010 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available