We present in this paper an auto-adaptive neural network tree structure that is used to solve classification problems. Two main ideas are behind this neural network tree structure. The first one is that it is easier to solve simple problems than difficult ones, so we divide an initial hard classification problem into several simpler/easier ones in a recursive way: "Divide To Simplify". In order to perform the classification problem decomposition, we need to answer two following questions: is the problem difficult? And then, how to simplify it? The second idea is to use some classification complexity estimation methods to evaluate the problem difficulty. We propose an algorithm which estimates the problem complexity, divides it into several easier ones and builds a self organized neural tree structure that solves this problem efficiently. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Rybnik, M., Chebira, A., & Madani, K. (2003). Auto-adaptive neural network tree structure based on complexity estimator. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2686, 558–565. https://doi.org/10.1007/3-540-44868-3_71
Mendeley helps you to discover research relevant for your work.