Asymmetric support vector machines: low false-positive learning under the user tolerance

Authors:
Shan-Hung Wu;Keng-Pei Lin;Chung-Min Chen;Ming-Syan Chen
Affiliations:
National Taiwan University, Taipei, Taiwan, ROC and Telcordia Applied Research Center, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC;Telcordia Applied Research Center, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC
Venue:
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2008

Citing 15
Cited 2

Support-Vector Networks

Machine Learning
Generalization performance of support vector machines and other pattern classifiers

Advances in kernel methods
An experimental comparison of naive Bayesian and keyword-based anti-spam filtering with personal e-mail messages

SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Support vector clustering

The Journal of Machine Learning Research
Leveraging Social Networks to Fight Spam

Computer
A comparison of event models for Naive Bayes anti-spam e-mail filtering

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Estimating the Support of a High-Dimensional Distribution

Neural Computation
On-line spam filter fusion

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Spam and the ongoing battle for the inbox

Communications of the ACM - Spam and the ongoing battle for the inbox
Spam Filtering Using Statistical Data Compression Models

The Journal of Machine Learning Research
Relaxed online SVMs for spam filtering

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Structural risk minimization over data-dependent hierarchies

IEEE Transactions on Information Theory
Support vector machines for spam categorization

IEEE Transactions on Neural Networks

Using the absolute difference of term occurrence probabilities in binary text categorization

Applied Intelligence
SVMpAUCtight: a new support vector method for optimizing partial AUC based on a tight convex upper bound

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many practical applications of classification require the classifier to produce a very low false-positive rate. Although the Support Vector Machine (SVM) has been widely applied to these applications due to its superiority in handling high dimensional data, there are relatively little effort other than setting a threshold or changing the costs of slacks to ensure the low false-positive rate. In this paper, we propose the notion of Asymmetric Support VectorMachine (ASVM) that takes into account the false-positives and the user tolerance in its objective. Such a new objective formulation allows us to raise the confidence in predicting the positives, and therefore obtain a lower chance of false-positives. We study the effects of the parameters in ASVM objective and address some implementation issues related to the Sequential Minimal Optimization (SMO) to cope with large-scale data. An extensive simulation is conducted and shows that ASVM is able to yield either noticeable improvement in performance or reduction in training time as compared to the previous arts.