Sciweavers

86 search results - page 1 / 18
» Minimum Splits Based Discretization for Continuous Features
Sort
View
IJCAI
1997
13 years 6 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
PKDD
2007
Springer
121views Data Mining» more  PKDD 2007»
13 years 11 months ago
Improved Algorithms for Univariate Discretization of Continuous Features
In discretization of a continuous variable its numerical value range is divided into a few intervals that are used in classification. For example, Na¨ıve Bayes can benefit from...
Jussi Kujala, Tapio Elomaa
IJCAI
1993
13 years 6 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 8 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
ECAI
2010
Springer
13 years 2 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic