Combining SVM classifiers for email anti-spam filtering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4507 LNCS, Issue , 2007, Pages 903-910

  Blanco, Ángela ^a   Ricket, Alba María ^a   Martín Merino, Manuel ^a  

^a UNIVERSIDAD PONTIFICIA DE SALAMANCA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DIGITAL FILTERS; ELECTRONIC MAIL; PROBLEM SOLVING;

FALSE POSITIVE ERRORS; SPAM MESSAGES; UNSOLICITED COMMERCIAL EMAIL (UCE);

SUPPORT VECTOR MACHINES;

EID: 38049148757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73007-1_109     Document Type: Conference Paper

References (20)

1. Aggarwal, C.C.: Re-designing distance functions and distance-based applications for high dimensional applications. In: Proc. of the ACM International Conference on Management of Data and Symposium on Principles of Database Systems (SIGMOD-PODS), vol. 1, pp. 13-18 (March 2001)
2. Androutsopoulos, I., Koutsias, J., Chandrinosand, K.V., Spyropoulos, C.D.: An experimental comparison of naive bayesian and keyword-based anti-spam filtering with personal E-mail Messages. In: 23rd Annual Internacional ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 160-167, Athens, Greece (2000)
3. Bauer, E., Kohavi, R.: An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning 36, 105-139 (1999)
4. Breiman, L.: Bagging predictors. Machine Learning 24, 123-140 (1996)
5. Carreras, X., Márquez, I.: Boosting Trees for Anti-Spam Email Filtering. In: RANLP-Ol, Forth International Conference on Recent Advances in Natural Language Processing, Tzigov Chark, BG (2001)
6. Cox, T., Cox, M.: Multidimensional Scaling, 2nd edn. Chapman and Hall/CRC Press, New York (2001)
7. Drucker, H., Wu, D., Vapnik, V.N.: Support Vector Machines for Spam Categorization. IEEE Transactions on Neural Networks 10(5), 1048-1054 (September 1999)
8. Fawcett, T.: In vivo spam filtering: A challenge problem for KDD. ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD) 5(2), 140-148 (December 2003)
9. Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. Johns Hopkins University press, Baltimore, Maryland, USA (1996)
10. Hershkop, S., Salvatore, J.S.: Combining Email Models for False Positive Reduction. ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD), August, Chicago, Illinois, pp. 98-107 (2005)
11. Hinneburg, C.C.A.A., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. of the International Conference on Database Theory (ICDT), pp. 506-515. Morgan Kaufmann, Cairo, Egypt (September 2000)
12. Kittler, J., Hatef, M., Duin, R., Matas, J.: On combining classifiers. IEEE Transactions on Neural Networks 20(3), 228-239 (March 1998)
13. Kolcz, A., Alspector, J.: SVM-based filtering of E-mail Spam with content-specific misclassification costs. In: Workshop on Text Mining (TextDM'2001), San Jose, California, pp. 1-14 (2001)
14. Martín-Merino, M., Muñoz, A.: A new Sammon algorithm for sparse data visualization. In: International Conference on Pattern Recognition (ICPR), vol. 1, pp. 477-481. IEEE Press, Cambridge, UK (August 2004)
15. Martín-Merino, M., Muñoz, A.: Self organizing map and Sammon mapping for asymmetric proximities. Neurocomputing 63, 171-192 (2005)
16. Pekalska, E., Paclick, P., Duin, R.: A generalized kernel approach to dissimilaritybased classification. Journal of Machine Learning Research 2, 175-211 (2001)
17. Provost, F., Fawcett, T.: Robust Classification for Imprecise Environments. Machine Learning 42, 203-231 (2001)
18. UCI Machine Learning Database. Available from: http://www.ics.uci.edu/~ mlearn/MLRepository.html
19. Valentini, G., Dietterich, T.: Bias-variance analysis of support vector machines for the development of svm-based ensemble methods. Journal of Machine Learning Research 5, 725-775 (2004)
20. Vapnik, V.: Statistical Learning Theory. John Wiley and Sons, New York (1998)