Discretization of continuous features: Difference between revisions

Revision as of 13:28, 3 August 2010

Revision as of 17:09, 3 August 2010

Line 7:

* Fayyad & Irani's MDL method <ref>{{cite web|url=http://hdl.handle.net/2014/35171 |title=Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning |accessdate=2008-07-10 }}</ref> - Uses [[Information_gain|Information Gain]] to recursively define the best bins.

* And many more <ref>{{cite web|url=http://www.ifir.edu.ar/~redes/curso/disc.ps |title=Supervised and Unsupervised Discretization of Continuous Features |accessdate=2008-07-10 }}</ref>

Many Machine Learning algorithms are known to produce better models by discretizing continuous attributes <ref>{{cite web|url=http://www.math.upatras.gr/~esdlab/en/members/kotsiantis/discretization%20survey%20kotsiantis.pdf | title=S. Kotsiantis, D. Kanellopoulos, Discretization Techniques: A recent survey, GESTS International Transactions on Computer Science and Engineering, Vol.32 (1), 2006, pp. 47-58.}}</ref>

== See also ==