Boosting Trees for Anti-Spam Email Filtering

@inproceedings{citeulike:449886, abstract = {In this work, a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages are performed on two public corpora: PU1 and LingSpam. Several variants of the AdaBoost algorithm with confidence--rated predictions [14] have been applied, which differ in the complexity of the base learners considered.}, address = {Tzigov Chark, BG}, author = {Carreras, Xavier and M\'arquez, Llu\'\is }, booktitle = {Proceedings of RANLP-01, 4th International Conference on Recent Advances in Natural Language Processing}, citeulike-article-id = {449886}, keywords = {boosting, spam}, posted-at = {2005-12-26 06:28:29}, priority = {2}, title = {Boosting Trees for Anti-Spam Email Filtering}, url = {http://citeseer.ist.psu.edu/478863.html}, year = {2001} }

TY - CONF ID - citeulike:449886 L3 - citeulike-article-id:449886 TI - Boosting Trees for Anti-Spam Email Filtering T2 - Proceedings of RANLP-01, 4th International Conference on Recent Advances in Natural Language Processing AD - Tzigov Chark, BG N2 - In this work, a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages are performed on two public corpora: PU1 and LingSpam. Several variants of the AdaBoost algorithm with confidence--rated predictions [14] have been applied, which differ in the complexity of the base learners considered. KW - boosting KW - spam AU - Carreras, Xavier AU - M\'arquez, Llu\'\is PY - 2001/// UR - http://citeseer.ist.psu.edu/478863.html ER -