Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Omnivariate decision trees.

C T Yildiz1, E Alpaydin

  • 1Dept. of Comput. Eng., Bogazici Univ., Istanbul.

IEEE Transactions on Neural Networks
|February 6, 2008
PubMed
Summary
This summary is machine-generated.

Omnivariate decision trees automatically select the best node type (univariate, linear, or nonlinear) for each decision point. This approach improves generalization and creates smaller, more efficient decision trees.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Constructive feedforward ART clustering networks. I.

IEEE transactions on neural networks·2008
Same author

Constructive feedforward ART clustering networks. II.

IEEE transactions on neural networks·2008
Same author

Combined 5 x 2 cv F test for comparing supervised classification learning algorithms.

Neural computation·1999
Same author

Local linear perceptrons for classification.

IEEE transactions on neural networks·1996
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Area of Science:

  • Machine Learning
  • Artificial Intelligence
  • Data Mining

Background:

  • Traditional decision trees use univariate splits (axis-aligned).
  • Multivariate decision trees employ linear (hyperplane) or nonlinear (multilayer perceptron) splits.
  • Nonlinear methods increase complexity and overfitting risk.

Purpose of the Study:

  • To introduce omnivariate decision trees, a novel architecture.
  • To enable automatic selection of decision node complexity based on data characteristics.
  • To improve model generalization and reduce tree size.

Main Methods:

  • Developed omnivariate trees with decision nodes capable of being univariate, linear, or nonlinear.
  • Integrated comparative statistical tests to determine optimal node type at each decision point.

Related Experiment Videos

  • Performed simulations to evaluate performance against traditional tree structures.

    • Main Results:

    • Omnivariate trees demonstrated superior generalization compared to homogeneous node-type trees.
    • The proposed method automatically matched node complexity to subproblem requirements.
    • Induction resulted in smaller, more parsimonious decision trees.

    Conclusions:

    • Omnivariate trees offer an adaptive approach to decision tree induction.
    • Automatic node type selection simplifies model design and enhances performance.
    • This method effectively balances model complexity and predictive accuracy.