An algorithm for pruning redundant modules in min-max modular network with GZC function

Lecture Notes in Computer Science

Volumn 3610, Issue PART I, 2005, Pages 293-302

  Li, Jing ^a   Lu, Bao Liang ^a   Ichikawa, Michinori ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; NEURAL NETWORKS; REDUNDANCY;

DECISION BOUNDARIES; QUADRATIC COMPLEXITY; REDUNDANT SAMPLE PRUNING;

ALGORITHMS;

EID: 26844520013     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539087_35     Document Type: Conference Paper

References (18)

1. Lu, B.L. and Ito, M.: Task decomposition based on class relations: a modular neural network architecture for pattern classification. Lecture Notes in Computer Science, Springer vol. 1240(1997)330-339
2. Lu, B.L. and Ito, M.: Task Decomposition and Module Combination Based on Class Relations: A Modular Neural Network for Pattern Classification. IEEE Trans. Neural Networks, vol.10 (1999) 1244-1256
3. Lu, B.L., Ma, Q., Ichikawa,M. and Isahara, H.: Efficient Part-of-Speech Tagging with a Min-Max Modular Neural Network Model. Applied Intelligence, vol. 19 (2003)65-81
4. Lu, B.L., Shin, J., and Ichikawa, M.: Massively Parallel Classification of Single-Trial EEG Signals Using a Min-Max Modular Neural Network. IEEE Trans. Biomedical Engineering, vol.51, (2004) 551-558
5. Duda, R.O., Hart, P.E. and Stork, D.G.: Pattern Classification, 2nd Ed. John Wiley & Sons, Inc. 2001.
6. Wang, Y.F.: A study of incremental learning method based on Min-Max Module networks (in Chinese). Bachelor Dissertation of SJTU, 2003.
7. Lu, B.L. and Ichikawa, M.: Emergent On-Line Learning with a Gaussian Zero-Crossing Discriminant Function. IJCNN '02, vol.2 (2002) 1263-1268
8. Hart, P.E.: The Condensed Nearest Neighbor Rule. IEEE Trans. Information Theory, vol.14 (1968) 515-516
9. Gates, G.W.: The Reduced Nearest Neighbor Rule. IEEE Trans. Information Theory, vol.18 (1972) 431-433
10. Wilson, D.L.: Asympotic propoties of nearest neighbor rules using edited data. IEEE trans. System, Man, and Cybernetics, vol.2, No.3 (1972) 431-433
11. Aha, D.W., Dennis, K. and Mack, K.A.: Instance-based learning algorithm. Machine Learning, vol.6 (1991) 37-66
12. Zhang, J.P.: Selecting typical instances in instance-based learning. Proceedings of the Ninth International Conference on Machine Learning, (1992) 470-479
13. Wai, L., Keung, C.K. and Liu, D.Y.: Discovering useful concept prototypes for classification based on filtering and abstraction. IEEE Trans. Pattern Analysis and Machine Intelligence, vol.24, No.8 (2002) 1075-1090
14. Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithm. Proceedings of the Eleventh International Conference on Machine Learning, (1994) 293-301
15. Cameron-Jones, R.M.: Instance selection by encoding length heuristic with random mutation hill climbing. Proceddings of the Eightn Australian Joint Conference on Artificial Intelligence, (1995) 99-106
16. Li, J., Lu, B.L. and Ichikawa, M.: Typical Sample Selection and Redundancy Reduction for Min-Max Modular Network with GZC Function. ISNN'05, Lecture Notes in Computer Science, (2005) 467-472
17. Lu, B.L., Wang, K.A., Utiyama, M. and Isahara, H.: A part-versus-part method for massively parallel training of support vector machines. Proceedings of IJCNN'04, Budapast, July25-29 (2004) 735-740.
18. Murphy, P.M. and Aha, D.W.: UCI Repository of Machine Learning Database. Dept. of Information and Computer Science, Univ. of Calif., Irvine, 1994.