Online Active Learning Methods for Fast Label-Efficient Spam Filtering Export

@inproceedings{citeulike:1706075, abstract = {Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustworthy labels for messages may be costly to acquire. Past investigations of active learning in spam filtering have focused on the pool-based scenario, where there is assumed to be a large, unlabeled data set and the goal is to iteratively identify the best subset of examples for which to request labels. However, even with optimizations this is a costly approach. We investigate an online active learning scenario where the filter is exposed to a stream of messages which must be classified one at a time. The filter may only request a label for a given message immediately after it has been classified. The goal is to achieve strong online classification performance with few label requests. This is a novel scenario for low-cost active spam filtering, fitting for application in large-scale systems. We draw from the label efficient machine learning literature to investigate several approaches to selective sampling in this scenario using linear classifiers. We show that online active learning can dramatically reduce labeling and training costs with negligible additional overhead while maintaining high levels of classification performance.}, author = {Sculley, D.}, citeulike-article-id = {1706075}, citeulike-linkout-0 = {http://www.eecs.tufts.edu/~dsculley/papers/activeSpam.pdf}, journal = {Fourth Conference on Email and AntiSpam}, keywords = {active-learning, online, spam-filtering}, month = {August}, posted-at = {2007-09-28 19:37:04}, priority = {0}, title = {Online Active Learning Methods for Fast Label-Efficient Spam Filtering}, url = {http://www.eecs.tufts.edu/~dsculley/papers/activeSpam.pdf}, year = {2007} }

TY - CONF ID - citeulike:1706075 L3 - citeulike-article-id:1706075 N2 - Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustworthy labels for messages may be costly to acquire. Past investigations of active learning in spam filtering have focused on the pool-based scenario, where there is assumed to be a large, unlabeled data set and the goal is to iteratively identify the best subset of examples for which to request labels. However, even with optimizations this is a costly approach. We investigate an online active learning scenario where the filter is exposed to a stream of messages which must be classified one at a time. The filter may only request a label for a given message immediately after it has been classified. The goal is to achieve strong online classification performance with few label requests. This is a novel scenario for low-cost active spam filtering, fitting for application in large-scale systems. We draw from the label efficient machine learning literature to investigate several approaches to selective sampling in this scenario using linear classifiers. We show that online active learning can dramatically reduce labeling and training costs with negligible additional overhead while maintaining high levels of classification performance. JF - Fourth Conference on Email and AntiSpam TI - Online Active Learning Methods for Fast Label-Efficient Spam Filtering KW - active-learning KW - online KW - spam-filtering AU - Sculley, D PY - 2007/08// UR - http://www.eecs.tufts.edu/~dsculley/papers/activeSpam.pdf ER -