1661 search results - page 225 / 333 » Decision Tree Fields |
153
click to vote
MVA
1994
15 years 7 months ago
1994
CT This paper presents a rapid detecting method to tell the external contours from internal ones, and adopt an aid measure of adding 'black points" . These two methods re...
255
click to vote
CATA
2009
15 years 7 months ago
2009
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
170
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
173
click to vote
CORR
2008
Springer
15 years 6 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...
137
click to vote
DKE
2008
15 years 6 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 ...