Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies | Zendy

Erick CantúPaz | Zendy; Chandrika Kamath | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

<title>Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies</title>

Author(s) -

Erick CantúPaz,

Chandrika Kamath

Publication year - 2000

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.403609

Subject(s) - hyperplane , oblique case , computer science , scalability , algorithm , maxima and minima , image stitching , decision tree , evolutionary algorithm , node (physics) , artificial intelligence , mathematics , machine learning , theoretical computer science , combinatorics , philosophy , linguistics , mathematical analysis , structural engineering , database , engineering

Decision trees 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...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research