Optimal discriminant analysis and classification tree analysis: Difference between revisions
Content deleted Content added
Citation bot (talk | contribs) m [344]+: doi, issue. |
m Various citation & identifier cleanup, plus AWB genfixes. Report problems and suggestions at User talk:CitationCleanerBot |
||
Line 1:
{{
'''Optimal discriminant analysis (ODA)''' and the related '''classification tree analysis (CTA)''' are statistical methods that maximize predictive accuracy. For any specific sample and exploratory or confirmatory hypothesis, optimal discriminant analysis (ODA) identifies the statistical model that yields maximum predictive accuracy, assesses the exact [[Type I error]] rate, and evaluates potential cross-generalizability. Optimal discriminant analysis may be applied to > 0 dimensions, with the one-dimensional case being referred to as UniODA and the multidimensional case being referred to as MultiODA. Classification tree analysis is a generalization of optimal discriminant analysis to non-orthogonal trees. Classification tree analysis has more recently been called "hierarchical optimal discriminant analysis". Optimal discriminant analysis and classification tree analysis may be used to find the combination of variables and cut points that best separate classes of objects or events. These variables and cut points may then be used to reduce dimensions and to then build a statistical model that optimally describes the data.
Line 37:
|pages=179–188
|year=1936
|
|issue=2
}}
Line 59 ⟶ 58:
|url=http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9904
}}
== External links ==
*[http://people.revoledu.com/kardi/tutorial/LDA/index.html LDA tutorial using MS Excel]
|