Discretization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ", D" to ", D") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 4: | Line 4: | ||
** It can be applied by a [[Discretization System]]. | ** It can be applied by a [[Discretization System]]. | ||
* <B>See:</B> [[Discretization]], [[Automated Discretization]]. | * <B>See:</B> [[Discretization]], [[Automated Discretization]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 02:56, 17 June 2021
A Discretization Algorithm is a Data Transformation Algorithm that can solve a Discretization Task.
- AKA: Feature Discretization Algorithm.
- Context:
- It can be applied by a Discretization System.
- See: Discretization, Automated Discretization.
References
2002
- (Gabor Melli, 2002) ⇒ Gabor Melli. (2002). “PredictionWorks' Data Mining Glossary." PredictionWorks.
- Automated Discretization: Discretization which sets the number of bins based on the range of a numeric value. Therefore, the user is not required to specify the number of bins. However, certain values may be 'lost' from the decision tree because of automatic binning, which is not the case with intelligent binning. See Binning, Discretization.