Improving Tree-Based Classification Rules Using a Particle Swarm Optimization

Abstract : The main advantage of tree classifiers is to provide rules that are simple in form and are easily interpretable. Since decision tree is a top-down algorithm using a divide and conquer induction process, there is a risk of reaching a local optimal solution. This paper proposes a procedure of optimally determining the splitting variables and their thresholds for a decision tree using an adaptive particle swarm optimization. The proposed method consists of three phases – tree construction, threshold optimization and rule simplification. To validate the proposed algorithm, several artificial and real datasets are used. We compare our results with the original CART results and show that the proposed method is promising for improving prediction accuracy.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01470625
Contributor : Hal Ifip <>
Submitted on : Friday, February 17, 2017 - 3:53:01 PM
Last modification on : Friday, December 1, 2017 - 1:15:29 AM
Long-term archiving on : Thursday, May 18, 2017 - 3:10:19 PM

File

978-3-642-40361-3_2_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Chi-Hyuck Jun, Yun-Ju Cho, Hyeseon Lee. Improving Tree-Based Classification Rules Using a Particle Swarm Optimization. 19th Advances in Production Management Systems (APMS), Sep 2012, Rhodes, Greece. pp.9-16, ⟨10.1007/978-3-642-40361-3_2⟩. ⟨hal-01470625⟩

Share

Metrics

Record views

185

Files downloads

465