Classification and Regression Trees 2017
DOI: 10.1201/9781315139470-8
|View full text |Cite
|
Sign up to set email alerts
|

Regression Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
1,068
0
3

Year Published

2017
2017
2021
2021

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 846 publications
(1,073 citation statements)
references
References 0 publications
2
1,068
0
3
Order By: Relevance
“…To classify data by cancer status, we used Classification and Regression Trees [30] as well as Discriminant Function Classifiers [31]. Prior to any classification methods being applied, we reduced the dimension of the feature space in two ways: 1) a Mann-Whitney-Wilcoxon (MWW) test was performed to extract the 25 most discriminant descriptors in the transformed feature space and 2) we visually assessed scatter plots of the transformed pairs of sensor readings and selected the 25 most discriminant pairings based on the visual perception of two study authors (CM, PB).…”
Section: Classification and Model Validationmentioning
confidence: 99%
“…To classify data by cancer status, we used Classification and Regression Trees [30] as well as Discriminant Function Classifiers [31]. Prior to any classification methods being applied, we reduced the dimension of the feature space in two ways: 1) a Mann-Whitney-Wilcoxon (MWW) test was performed to extract the 25 most discriminant descriptors in the transformed feature space and 2) we visually assessed scatter plots of the transformed pairs of sensor readings and selected the 25 most discriminant pairings based on the visual perception of two study authors (CM, PB).…”
Section: Classification and Model Validationmentioning
confidence: 99%
“…Two fast algorithms are proposed for finding the parameter settings which leads to high distortion-complexity performance. The algorithms are based on the Generalised Breiman, Friedman, Olshen and Stone (GBFOS) Algorithm [71] and use training sequences to find the best parameter settings.…”
Section: Computational Complexity Scaling For H264/avcmentioning
confidence: 99%
“…O FCART é uma versão fuzzy do algoritmo de CART [21]. O algoritmo CART lida com atributos categóricos e contínuos para construir uma árvore de decisão, mesmo que apresente dados incompletos.…”
Section: Fcartunclassified