disc.Topdown {discretization}

Top-down discretization

Description

This function implements three top-down discretization algorithms(CAIM, CACC, Ameva).

Usage

disc.Topdown(data, method = 1)

Arguments

data

numeric data matrix to discretized dataset

method

1: CAIM algorithm, 2: CACC algorithm, 3: Ameva algorithm.

Value

cutp

list of cut-points for each variable(minimun value, cut-points and maximum value)

Disc.data

discretized data matrix

Author(s)

HyunJi Kim [e-mail]

References

Gonzalez-Abril, L., Cuberos, F. J., Velasco, F. and Ortega, J. A. (2009) Ameva: An autonomous discretization algorithm, Expert Systems with Applications, 36, 5327–5332.

Kurgan, L. A. and Cios, K. J. (2004). CAIM Discretization Algorithm, IEEE Transactions on knowledge and data engineering, 16, 145–153.

Tsai, C. J., Lee, C. I. and Yang, W. P. (2008). A discretization algorithm based on Class-Attribute Contingency Coefficient, Information Sciences, 178, 714–731.

See Also

topdown, insert, findBest, findInterval, caim, cacc, ameva

Examples

##---- CAIM discretization ----
##----cut-potins
cm=disc.Topdown(iris, method=1)
cm$cutp
##----discretized data matrix
cm$Disc.data

##---- CACC discretization----
disc.Topdown(iris, method=2)

##---- Ameva discretization ----
disc.Topdown(iris, method=3)