254 search results - page 1 / 51 » Multi-interval Discretization Methods for Decision Tree Lear... |
IJCAI
1993
13 years 5 months ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
SSPR
1998
Springer
13 years 8 months ago
1998
Springer
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
ICML
1999
IEEE
14 years 5 months ago
1999
IEEE
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
TKDE
2008
13 years 4 months ago
2008
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
SIGKDD
2000
13 years 4 months ago
2000
The MP13 method is best summarized as recognition based on voting decision trees using "pipes" in potential space. Keywords Voting; Decision Tree; Potential Space