Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.08515 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915104341098496 |
|---|---|
| author | Li, Hongyi Xu, Jun Armstrong, William Ward |
| author_facet | Li, Hongyi Xu, Jun Armstrong, William Ward |
| contents | This paper introduces a novel tree-based model, Learning Hyperplane Tree (LHT), which outperforms state-of-the-art (SOTA) tree models for classification tasks on several public datasets. The structure of LHT is simple and efficient: it partitions the data using several hyperplanes to progressively distinguish between target and non-target class samples. Although the separation is not perfect at each stage, LHT effectively improves the distinction through successive partitions. During testing, a sample is classified by evaluating the hyperplanes defined in the branching blocks and traversing down the tree until it reaches the corresponding leaf block. The class of the test sample is then determined using the piecewise linear membership function defined in the leaf blocks, which is derived through least-squares fitting and fuzzy logic. LHT is highly transparent and interpretable--at each branching block, the contribution of each feature to the classification can be clearly observed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_08515 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning Hyperplane Tree: A Piecewise Linear and Fully Interpretable Decision-making Framework Li, Hongyi Xu, Jun Armstrong, William Ward Machine Learning This paper introduces a novel tree-based model, Learning Hyperplane Tree (LHT), which outperforms state-of-the-art (SOTA) tree models for classification tasks on several public datasets. The structure of LHT is simple and efficient: it partitions the data using several hyperplanes to progressively distinguish between target and non-target class samples. Although the separation is not perfect at each stage, LHT effectively improves the distinction through successive partitions. During testing, a sample is classified by evaluating the hyperplanes defined in the branching blocks and traversing down the tree until it reaches the corresponding leaf block. The class of the test sample is then determined using the piecewise linear membership function defined in the leaf blocks, which is derived through least-squares fitting and fuzzy logic. LHT is highly transparent and interpretable--at each branching block, the contribution of each feature to the classification can be clearly observed. |
| title | Learning Hyperplane Tree: A Piecewise Linear and Fully Interpretable Decision-making Framework |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2501.08515 |