Unitn Eprints Research (Università Degli Studi di Trento) · 2007 · 33 citations · 17 references
Open access
ComputingComputer ScienceData MiningMachine LearningStatistical LearningClassificationKernel MethodsOptimization For Machine LearningPattern RecognitionProbabilistic Machine LearningSupport Vector MachinesAccuracyK-nearest NeighborsNearest-neighbor ClassificationSpam DetectionSpam FilteringSupport Vector ClassificationSupport Vector Machine ClassificationSvms
In this paper we evaluate the performance of the highest probability SVM nearest neighbor classifier, which is a combination of the SVM and k-NN classifiers, on a corpus of email messages. To classify a sample the algorithm performs the following actions: for each k in a predefined set {k1,..., kN} it trains an SVM model on k nearest labelled samples, and uses this model to classify the given sample, then fits a sigmoid approximation of the probabilistic output for the SVM model, and computes the probabilities of the positive and the negative answers; than it selects that of the 2 × N resulting answers which has the highest probability. The experimental evaluation shows, that this algorithm is able to achieve higher accuracy than the pure SVM classifier at least in the case of equal error costs. 1
17
Corinna Cortes, Vladimir Vapnik · Machine Learning · 1995 · 33K citations · Full text
Making Large-Scale SVM Learning Practical
Thorsten Joachims · Technical reports · 2006 · 4.3K citations · Full text
A Bayesian Approach to Filtering Junk E-Mail
Mehran Sahami, Susan Dumais, David Heckerman et al. · 1998 · 1.2K citations