| Presentation | 1999/1/22 A High Speed Algorithm for Induction of Classification Tree Hiroto Yoshii, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper discloses a novel algorithm for induction of classificatio trees.The algorithm, Generalized Pyramid Architecture Classification Tree(G-PACT), imposes two restrictions on coefficients of linear combinations and splitting points of each value, which generates classification trees with high accuracy in a remarkably high speed.We carried out nine experiments using benchmark datasets from Proben1, for analysis of Generalized PACT's capability.The results support that the algorithm has a great ability to construct adequate performance classification trees in quite a short period of time.The empirical study indicates that the algorithm has an ability to avoid overfitting problems. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | classification tree / high speed / hyperplane |
| Paper # | DE98-48 |
| Date of Issue |
| Conference Information | |
| Committee | DE |
|---|---|
| Conference Date | 1999/1/22(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Data Engineering (DE) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A High Speed Algorithm for Induction of Classification Tree |
| Sub Title (in English) | |
| Keyword(1) | classification tree |
| Keyword(2) | high speed |
| Keyword(3) | hyperplane |
| 1st Author's Name | Hiroto Yoshii |
| 1st Author's Affiliation | () |
| Date | 1999/1/22 |
| Paper # | DE98-48 |
| Volume (vol) | vol.98 |
| Number (no) | 560 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |