메뉴 건너뛰기




Volumn 39, Issue 7, 2012, Pages 6557-6561

Facing the spammers: A very effective approach to avoid junk e-mails

Author keywords

Confidence factors; Machine learning; Minimum description length; Spam filter; Text categorization

Indexed keywords

CONFIDENCE FACTORS; MACHINE-LEARNING; MINIMUM DESCRIPTION LENGTH; SPAM FILTER; TEXT CATEGORIZATION;

EID: 84856976954     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.12.049     Document Type: Article
Times cited : (20)

References (33)
  • 5
    • 79952048598 scopus 로고    scopus 로고
    • Spam filtering: How the dimensionality reduction affects the accuracy of Naive Bayes classifiers
    • T. Almeida, J. Almeida, and A. Yamakami Spam filtering: How the dimensionality reduction affects the accuracy of Naive Bayes classifiers Journal of Internet Services and Applications 1 3 2011 183 200
    • (2011) Journal of Internet Services and Applications , vol.1 , Issue.3 , pp. 183-200
    • Almeida, T.1    Almeida, J.2    Yamakami, A.3
  • 6
    • 33750975866 scopus 로고    scopus 로고
    • Learning to Filter Unsolicited Commercial E-mail
    • National Centre for Scientific Research "Demokritos", Athens, Greece
    • Androutsopoulos, I.; Paliouras, G.; & Michelakis, E. (2004). Learning to Filter Unsolicited Commercial E-mail. Technical Report 2004/2, National Centre for Scientific Research "Demokritos", Athens, Greece.
    • (2004) Technical Report 2004/2
    • Androutsopoulos, I.1    Paliouras, G.2    Michelakis, E.3
  • 7
    • 84856957048 scopus 로고    scopus 로고
    • Exponential differential document count - A feature selection factor for improving Bayesian filters accuracy
    • Cambridge, MA, USA
    • Assis, F.; Yerazunis, W.; Siefkes, C.; & Chhabra, S. (2006). Exponential differential document count - A feature selection factor for improving Bayesian filters accuracy. In Proceedings of 4th the MIT spam conference (pp. 1-6). Cambridge, MA, USA.
    • (2006) Proceedings of 4th the MIT Spam Conference , pp. 1-6
    • Assis, F.1    Yerazunis, W.2    Siefkes, C.3    Chhabra, S.4
  • 8
    • 0032183995 scopus 로고    scopus 로고
    • The Minimum Description Length Principle in Coding and Modeling
    • PII S0018944898052845
    • A. Barron, J. Rissanen, and B. Yu The minimum description length principle in coding and modeling IEEE Transactions on Information Theory 44 6 1998 2743 2760 (Pubitemid 128741906)
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.6 , pp. 2743-2760
    • Barron, A.1    Rissanen, J.2    Yu, B.3
  • 17
    • 33845625540 scopus 로고    scopus 로고
    • Applying lazy learning algorithms to tackle concept drift in spam filtering
    • DOI 10.1016/j.eswa.2006.04.011, PII S0957417406001175
    • F. Fdez-Riverola, E. Iglesias, F. Diaz, J. Mendez, and J. Corchado Applying lazy learning algorithms to tackle concept drift in spam filtering Expert Systems with Applications 33 1 2007 36 48 (Pubitemid 44959915)
    • (2007) Expert Systems with Applications , vol.33 , Issue.1 , pp. 36-48
    • Fdez-Riverola, F.1    Iglesias, E.L.2    Diaz, F.3    Mendez, J.R.4    Corchado, J.M.5
  • 19
    • 33749560322 scopus 로고    scopus 로고
    • A tutorial introduction to the minimum description length principle
    • P. Grünwald, I. Myung, M. Pitt, MIT Press
    • P. Grünwald A tutorial introduction to the minimum description length principle P. Grünwald, I. Myung, M. Pitt, Advances in minimum description length: Theory and applications 2005 MIT Press 3 81
    • (2005) Advances in Minimum Description Length: Theory and Applications , pp. 3-81
    • Grünwald, P.1
  • 20
    • 67349246464 scopus 로고    scopus 로고
    • A review of machine learning approaches to spam filtering
    • T. Guzella, and W. Caminhas A review of machine learning approaches to spam filtering Expert Systems with Applications 36 7 2009 10206 10222
    • (2009) Expert Systems with Applications , vol.36 , Issue.7 , pp. 10206-10222
    • Guzella, T.1    Caminhas, W.2
  • 21
    • 0036040906 scopus 로고    scopus 로고
    • Evaluating cost-sensitive unsolicited bulk email categorization
    • Hidalgo, J. (2002). Evaluating cost-sensitive unsolicited bulk email categorization. In Proceedings of the 17th ACM symposium on applied computing (pp. 615-620). Madrid, Spain. (Pubitemid 35009659)
    • (2002) Proceedings of the ACM Symposium on Applied Computing , pp. 615-620
    • Gomez Hidalgo, J.M.1
  • 22
    • 37349022259 scopus 로고    scopus 로고
    • An incremental cluster-based approach to spam filtering
    • DOI 10.1016/j.eswa.2007.01.018, PII S0957417407000279
    • W.-F. Hsiao, and T.-M. Chang An incremental cluster-based approach to spam filtering Expert Systems with Applications 34 3 2008 1599 1608 (Pubitemid 350298190)
    • (2008) Expert Systems with Applications , vol.34 , Issue.3 , pp. 1599-1608
    • Hsiao, W.-F.1    Chang, T.-M.2
  • 23
    • 0002409860 scopus 로고    scopus 로고
    • A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization
    • Nashville, TN, USA
    • Joachims, T. (1997). A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization. In Proceedings of 14th international conference on machine learning (pp. 143-151). Nashville, TN, USA.
    • (1997) Proceedings of 14th International Conference on Machine Learning , pp. 143-151
    • Joachims, T.1
  • 24
    • 32344446819 scopus 로고    scopus 로고
    • SVM-based filtering of e-mail spam with content-specific misclassification costs
    • San Jose, CA, USA
    • Kolcz, A.; & Alspector, J. (2001). SVM-based filtering of e-mail spam with content-specific misclassification costs. In Proceedings of the 1st international conference on data mining (pp. 1-14). San Jose, CA, USA.
    • (2001) Proceedings of the 1st International Conference on Data Mining , pp. 1-14
    • Kolcz, A.1    Alspector, J.2
  • 28
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen Modeling by shortest data description Automatica 14 1978 465 471
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 30
    • 84856463585 scopus 로고    scopus 로고
    • Spam filtering using inexact string matching in explicit feature space with on-line linear classifiers
    • Gaithersburg, MD, USA
    • Sculley, D.; Wachman, G.; & Brodley, C. (2006). Spam filtering using inexact string matching in explicit feature space with on-line linear classifiers. In Proceedings of the 15th text REtrieval conference (pp. 1-10). Gaithersburg, MD, USA.
    • (2006) Proceedings of the 15th Text REtrieval Conference , pp. 1-10
    • Sculley, D.1    Wachman, G.2    Brodley, C.3
  • 33
    • 12744250266 scopus 로고    scopus 로고
    • An evaluation of statistical spam filtering techniques
    • DOI 10.1145/1039621.1039625, Computer Processing of Oriental Languages
    • L. Zhang, J. Zhu, and T. Yao An evaluation of statistical spam filtering techniques ACM Transactions on Asian Language Information Processing 3 4 2004 243 269 (Pubitemid 40155221)
    • (2004) ACM Transactions on Asian Language Information Processing , vol.3 , Issue.4 , pp. 243-269
    • Zhang, L.E.1    Zhu, J.2    Yao, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.