Statistics – Computation
Scientific paper
Oct 2000
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2000spie.4120...63c&link_type=abstract
Proc. SPIE Vol. 4120, p. 63-71, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation III, Br
Statistics
Computation
1
Scientific paper
Decision tress have long been popular in classification as they use simple and easy-to-understand tests at each node. Most variants of decision trees test a single attribute at a node, leading to axis- parallel trees, where the test results in a hyperplane which is parallel to one of the dimensions in the attribute space. These trees can be rather large and inaccurate in cases where the concept to be learned is best approximated by oblique hyperplanes. In such cases, it may be more appropriate to use an oblique decision tree, where the decision at each node is a linear combination of the attributes. Oblique decision trees have not gained wide popularity in part due to the complexity of constructing good oblique splits and the tendency of existing splitting algorithms to get stuck in local minima. Several alternatives have been proposed to handle these problems including randomization in conjunction wiht deterministic hill-climbing and the use of simulated annealing. In this paper, we use evolutionary algorithms (EAs) to determine the split. EAs are well suited for this problem because of their global search properties, their tolerance to noisy fitness evaluations, and their scalability to large dimensional search spaces. We demonstrate our technique on a synthetic data set, and then we apply it to a practical problem from astronomy, namely, the classification of galaxies with a bent-double morphology. In addition, we describe our experiences with several split evaluation criteria. Our results suggest that, in some cases, the evolutionary approach is faster and more accurate than existing oblique decision tree algorithms. However, for our astronomical data, the accuracy is not significantly different than the axis-parallel trees.
Cantu-Paz Erick
Kamath Chandrika
No associations
LandOfFree
Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1107636