Discretization Techniques: A recent survey
By S. Kotsiantis, Dimitris N. Kanellopoulos. 2006
477 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/a5c64077637d57aaef1845f84d9f9c282ab96af5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jiliang Tang
- Jundong Li
- Huan Liu
- Fred Morstatter
- Suhang Wang
- Kewei Cheng
- Ana Carolina Lorena
- Robert P. Trevino
Citations in the corpus
- A naive Bayes probability estimation model based on self-adaptive differential evolution (2014, methodology): “In our experiments, the equal width discretization (EWD) approach (Kotsiantis and Kanellopoulos 2006) is employed to determine the minimum and maximum values of the discretized attribute and then divide the range into the user-defined number of equal width discrete intervals.”
- Feature Selection (2016, methodology): “For numeric feature values, some data discretization techniques (Dougherty et al., 1995; Kotsiantis and Kanellopoulos, 2006) are required.”
- How Complex Is Your Classification Problem? (2018, methodology): “Using this solution, continuous features must be discretized a priori, which imposes the difficulty of choosing a proper discretization technique and associated parameters, an open issue in data mining [Kotsiantis and Kanellopoulos, 2006].”