Jump to content

Talk:Optimal discriminant analysis and classification tree analysis

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Maxeto0910 (talk | contribs) at 17:49, 20 March 2020 (Maxeto0910 moved page Talk:Optimal discriminant analysis to Talk:Optimal discriminant analysis and classification tree analysis: misleading). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconStatistics Stub‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the importance scale.
WikiProject iconPsychology Stub‑class
WikiProject iconThis article is within the scope of WikiProject Psychology, a collaborative effort to improve the coverage of Psychology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.

The title and thesis of this Wikipedia article relies on a single published article and is outside the mainstream of statistics and machine learning.

There are a variety of classification techniques developed researchers in a variety of fields and there is a lively competition.

At the moment leading classification techniques based upon their success in competitions such as KDD, Kaggle or Netflix would be random forests or boosting (gradient boosting or gbm).

ODA is nowhere to be seen.

See for example Statistical_classification

Moreover, in Decision Tree Learning it is stated: "The problem of learning an optimal decision tree is known to be NP-complete under several aspects of optimality and even for simple concepts[12][13]" Jim.Callahan,Orlando (talk) 17:16, 16 December 2015 (UTC)[reply]