1992
DOI: 10.1016/0747-5632(92)90001-u
|View full text |Cite
|
Sign up to set email alerts
|

The construction of computerized classification systems using machine learning algorithms: An overview

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1992
1992
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…We used the CART (Classification and Regression Trees) non-parametric procedure (Breiman et al, 1993;Efron and Tibshirani, 1991) of statistical decision-making that hierarchically splits data into progressively smaller turning points. Unlike single change-point tests (Siegel and Castellan, 1988), CART identifies several such points, building trees by recursive statistical decisions (McKenzie and Low, 1992). The result is a hierarchical structure in which each discontinuity reveals a transition within the time trend.…”
Section: Resultsmentioning
confidence: 99%
“…We used the CART (Classification and Regression Trees) non-parametric procedure (Breiman et al, 1993;Efron and Tibshirani, 1991) of statistical decision-making that hierarchically splits data into progressively smaller turning points. Unlike single change-point tests (Siegel and Castellan, 1988), CART identifies several such points, building trees by recursive statistical decisions (McKenzie and Low, 1992). The result is a hierarchical structure in which each discontinuity reveals a transition within the time trend.…”
Section: Resultsmentioning
confidence: 99%
“…the subjects were dichotomously divided into aggressive and nonaggressive. The tree generation procedure is halted when the chi-squared value for the contingency table between the categories of the predictor (correlates of aggressive behavior) and outcome (aggressive behavior) is no longer significant (McKenzie & Low, 1992). Categories that are similar with regard to frequencies on the outcome variable, assessed using the chi-square test, are merged together and the significance level is adjusted for the number of such comparisons (Kass, 1980;McKenzieet al, 1993;McKenzie & Low, 1992).…”
Section: Comparison Of Aggressive and Nonaggressive Groupsmentioning
confidence: 99%
“…The tree generation procedure is halted when the chi-squared value for the contingency table between the categories of the predictor (correlates of aggressive behavior) and outcome (aggressive behavior) is no longer significant (McKenzie & Low, 1992). Categories that are similar with regard to frequencies on the outcome variable, assessed using the chi-square test, are merged together and the significance level is adjusted for the number of such comparisons (Kass, 1980;McKenzieet al, 1993;McKenzie & Low, 1992). In the case of the RAGE, a dimensional outcome variable, a similar tree-building algorithm known as extended automatic interaction detection (XAID) (Angoss Software International, 1994;Biggs et al, 1991) was employed.…”
Section: Comparison Of Aggressive and Nonaggressive Groupsmentioning
confidence: 99%
“…Several implementations of CHArD are available [8]. A commercial version known as Knowledge SEEKER (KS) [7,12,28] was selected for its ease of use 1.…”
Section: Chaid Parametersmentioning
confidence: 99%
“…With regards to the extraction of classification and diagnostic rules from datasets, discussions of various parametric and non parametric methods are available [6][7][8]. Diagnostic decision trees are generally considered to be easier for clinicians to grasp than systems based on discriminant functions [9][10].…”
Section: Introductionmentioning
confidence: 99%