94 search results - page 12 / 19 » Boosting Lazy Decision Trees |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
: Boosting is a general method for improving the accuracy of any given learning algorithm. In this paper we employ combination of Adaboost with Support Vector Machine (SVM) as comp...
DKE
2008
13 years 7 months ago
2008
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
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...
JMLR
2006
13 years 7 months ago
2006
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...