Talk:Optimal discriminant analysis and classification tree analysis

Statistics Low‑importance

	This 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.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics
Low	This article has been rated as Low-importance on the importance scale.

Psychology

	Psychology portal This 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.PsychologyWikipedia:WikiProject PsychologyTemplate:WikiProject Psychologypsychology
???	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

This page was redesigned at the edge.

A page that knows where it met you.

Talk:Optimal discriminant analysis and classification tree analysis