Sciweavers

495 search results - page 51 / 99
» Transfer Learning in Decision Trees
Sort
View
JMLR
2006
132views more  JMLR 2006»
13 years 7 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
FOCS
2003
IEEE
14 years 1 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
ECML
1993
Springer
13 years 12 months ago
SIA: A Supervised Inductive Algorithm with Genetic Search for Learning Attributes based Concepts
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
Gilles Venturini
ECML
2003
Springer
14 years 1 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 9 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens