Sciweavers

23 search results - page 4 / 5
» Properties of the k-norm pruning algorithm for decision tree...
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
CEAS
2007
Springer
13 years 10 months ago
Learning Fast Classifiers for Image Spam
Recently, spammers have proliferated "image spam", emails which contain the text of the spam message in a human readable image instead of the message body, making detect...
Mark Dredze, Reuven Gevaryahu, Ari Elias-Bachrach
DIS
2006
Springer
13 years 10 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...
AIME
1997
Springer
13 years 10 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....
IJCAI
1989
13 years 7 months ago
Noise-Tolerant Instance-Based Learning Algorithms
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
David W. Aha, Dennis F. Kibler