Reusable components in decision tree induction algorithms

DOI10.1007/s00180-011-0242-8zbMath1304.65077OpenAlexW2041781402MaRDI QIDQ2512776

Milan Vukicevic, Milos Jovanovic, Dragana Becejski-Vujaklija, Boris Delibašić, Zoran Obradovic, Milija Suknović

Publication date: 30 January 2015

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-011-0242-8

zbMATH Keywords

algorithmdesigndecision treeframeworkgenericreusable components

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (1)

Reusable components in decision tree induction algorithms

Uses Software

• R
• C4.5
• AS 136

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• On the handling of continuous-valued attributes in decision tree generation
• Decision tree induction based on efficient tree restructuring
• Technical note: Some properties of splitting criteria
• Reusable components in decision tree induction algorithms
• Tree-Structured Classification Via Generalized Discriminant Analysis
• Data Mining with Decision Trees
• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms

This page was built for publication: Reusable components in decision tree induction algorithms