Hyper-rectangular space partitioning trees: practical approach (Q2488385): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3327527 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4881152 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4843404 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4314469 / rank | |||
Normal rank | |||
Revision as of 14:32, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hyper-rectangular space partitioning trees: practical approach |
scientific article |
Statements
Hyper-rectangular space partitioning trees: practical approach (English)
0 references
24 May 2006
0 references
Hyper-rectangular space partitioning (HSP) classification trees are considered in which, at a given node, partitioning is made by hyper-rectangles rather then hyper-planes (as in most popular ordinary binary classification trees). An HSP tree growing algorithm is described. Advantages of HSP trees in solving some complex (for ordinary binary trees) problems are considered. It is noted that HSP trees are more stable than ordinary binary trees. HSP is compared to CART and C4.5 procedures via simulation and on real data.
0 references
binary classification tree
0 references
splitting method
0 references
pruning
0 references
