Sciweavers

132 search results - page 23 / 27
» Induction of Oblique Decision Trees
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
IIS
2001
13 years 10 months ago
The Development of the AQ20 Learning System and Initial Experiments
: Research on a new system implementing the AQ learning methodology, called AQ20, is briefly described, and illustrated by initial results from an experimental version. Like its pr...
Guido Cervone, Liviu Panait, Ryszard S. Michalski
MLDM
2005
Springer
14 years 2 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
JMLR
2006
132views more  JMLR 2006»
13 years 8 months ago
Learning to Detect and Classify Malicious Executables in the Wild
We describe the use of machine learning and data mining to detect and classify malicious executables as they appear in the wild. We gathered 1,971 benign and 1,651 malicious execu...
Jeremy Z. Kolter, Marcus A. Maloof
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
14 years 9 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...