Referenced Items are not available for this document.
Spam filtering is a classical online learning problem. When the size of training sample set becomes larger and larger, the speed of Online SVM is becoming slower and slower. Therefore, we relax the constraints of Online SVM and get the Relaxed Online SVM (ROSVM) model, which can not only improve the speed, but also can ensure the performance. In this paper, we applied this model to Chinese spam filter. Our model outperforms the best system of TREC 2006 Chinese spam filter track. Our filter also participated in the SEWM 2010 spam filter track, and got the best 1-ROCA% of the delayed feedback task and the active learning task.
Published in:
Asian Language Processing (IALP), 2010 International Conference on
Date of Conference: 28-30 Dec. 2010
- Page(s):
- 185 - 188
- Print ISBN:
- 978-1-4244-9063-9
- INSPEC Accession Number:
- 11746138
- Conference Location :
- Harbin
- Digital Object Identifier :
- 10.1109/IALP.2010.90
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
