82 search results - page 14 / 17 » Lookahead-based algorithms for anytime induction of decision... |
ICML
1999
IEEE
14 years 8 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 ...
23
Voted
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...
KCAP
2003
ACM
14 years 29 days ago
2003
ACM
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...