Unsupervised Static Discretization Methods in Data Mining
Source: Titu Maiorescu University
Discretization of real-valued data is often used as a pre-processing step in many data mining algorithms. This paper reviews some important unsupervised discretization methods among which there are the discretization methods based on clustering. The paper proposes a discretization method based on the k-means clustering algorithm which avoids the O(n log n) time requirement for sorting .
| Format: | Size: | 628.80 | |
| Date: | Apr 2009 |



