Combining classifiers in a tree structure
This paper presents a method for combining classifiers in a tree structure, where each node of the tree contains single hypothesis trained in respective region of the feature space. All base classifiers are then combined using weighted average. Majority vote and Newton-Raphson numerical optimization...
| Main Authors: | , |
|---|---|
| Format: | Conference Paper |
| Published: |
2008
|
| Online Access: | http://hdl.handle.net/20.500.11937/36035 |
| _version_ | 1848754657360347136 |
|---|---|
| author | Woloszynski, Tomasz Kurzynski, M. |
| author_facet | Woloszynski, Tomasz Kurzynski, M. |
| author_sort | Woloszynski, Tomasz |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This paper presents a method for combining classifiers in a tree structure, where each node of the tree contains single hypothesis trained in respective region of the feature space. All base classifiers are then combined using weighted average. Majority vote and Newton-Raphson numerical optimization are used for fitting the coefficients in the additive model. Two loss functions (quadratic and boosting-like exponential) as well as new splitting criteria for inducing the tree are examined within proposed framework. The idea of combining classifiers in a tree structure is then compared with other iteratively built classifiers: Adaboost.MH and MART (multiple additive regression trees). The experiments were conducted with the usage of well-known databases from the UCI Repository and the ELENA project. © 2008 IEEE. |
| first_indexed | 2025-11-14T08:43:54Z |
| format | Conference Paper |
| id | curtin-20.500.11937-36035 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:43:54Z |
| publishDate | 2008 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-360352017-09-13T15:16:37Z Combining classifiers in a tree structure Woloszynski, Tomasz Kurzynski, M. This paper presents a method for combining classifiers in a tree structure, where each node of the tree contains single hypothesis trained in respective region of the feature space. All base classifiers are then combined using weighted average. Majority vote and Newton-Raphson numerical optimization are used for fitting the coefficients in the additive model. Two loss functions (quadratic and boosting-like exponential) as well as new splitting criteria for inducing the tree are examined within proposed framework. The idea of combining classifiers in a tree structure is then compared with other iteratively built classifiers: Adaboost.MH and MART (multiple additive regression trees). The experiments were conducted with the usage of well-known databases from the UCI Repository and the ELENA project. © 2008 IEEE. 2008 Conference Paper http://hdl.handle.net/20.500.11937/36035 10.1109/CIMCA.2008.22 restricted |
| spellingShingle | Woloszynski, Tomasz Kurzynski, M. Combining classifiers in a tree structure |
| title | Combining classifiers in a tree structure |
| title_full | Combining classifiers in a tree structure |
| title_fullStr | Combining classifiers in a tree structure |
| title_full_unstemmed | Combining classifiers in a tree structure |
| title_short | Combining classifiers in a tree structure |
| title_sort | combining classifiers in a tree structure |
| url | http://hdl.handle.net/20.500.11937/36035 |