메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject

A Study on Multivariate Oblique Decision Tree - Bivariate Linear Combination Split -
Recommendations
Search

다변량 사각 의사결정나무에 관한 연구 - 이변량 분리기준을 중심으로 -

논문 기본 정보

Type
Academic journal
Author
Journal
The Korean Data Analysis Society Journal of The Korean Data Analysis Society Journal of The Korean Data Analysis Society 제12권 제1호 KCI Accredited Journals
Published
2010.1
Pages
251 - 260 (10page)

Usage

cover
A Study on Multivariate Oblique Decision Tree - Bivariate Linear Combination Split -
Ask AI
Recommendations
Search

Abstract· Keywords

Report Errors
A classification tree is a rule for predicting the class of an object from the values for its predictor variables. The common goal in CART, CHAID, C4.5 and QUEST is to obtain such that in each terminal node is quite pure and simple tree. Occasionally this cannot be achieved with standard algorithms can produce large tree structure because they use only single splits. This study introduce a classification tree split criterion that can improve class prediction using linear combination split. We focus on bivariate linear combination splits in this study. Our splits are simple bivariate linear combination split and golden section splits. Some simulation and real data experiments are performed to demonstrate the performance of the proposed approach.

Contents

No content found

References (10)

Add References

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Recently viewed articles

Comments(0)

0

Write first comments.