메뉴 건너뛰기




Volumn 65, Issue 1, 2006, Pages 309-338

A suffix tree approach to anti-spam email filtering

Author keywords

E mail filtering; Scoring function; Spam; Suffix tree; Text categorization

Indexed keywords

E-MAIL FILTERING; SCORING FUNCTIONS; SUFFIX TREE; TEXT CATEGORIZATION;

EID: 33749028201     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-9505-y     Document Type: Article
Times cited : (33)

References (33)
  • 1
    • 0009878181 scopus 로고    scopus 로고
    • Text categorisation: A survey
    • Norwegian Computing Center Available online: citeseer.ist.psu.edu/aas99text.html
    • Aas, K., & Eikvil, L. (1999). Text categorisation: A survey. Technical report, Norwegian Computing Center. Available online: citeseer.ist.psu.edu/aas99text.html.
    • (1999) Technical Report
    • Aas, K.1    Eikvil, L.2
  • 3
    • 84870689557 scopus 로고    scopus 로고
    • Webpage (last accessed November 3, 2005)
    • apache.org. (2005). The apache spamassassin project. Webpage (last accessed November 3, 2005): http://spamassassin.apache.org/index.html.
    • The Apache Spamassassin Project
  • 4
    • 0035109647 scopus 로고    scopus 로고
    • Variations on probabilistic suffix trees: Statistical modeling and prediction of protein families
    • Bejerano, G., & Yona, G. (2001). Variations on probabilistic suffix trees: Statistical modeling and prediction of protein families. Bioinformatics, 17(1), 23-43.
    • (2001) Bioinformatics , vol.17 , Issue.1 , pp. 23-43
    • Bejerano, G.1    Yona, G.2
  • 8
    • 4444320782 scopus 로고    scopus 로고
    • Naive bayes classification of structured data
    • Flach, P., & Lachiche, N. (2004). Naive bayes classification of structured data. Machine Learning, 57(3), 233-269.
    • (2004) Machine Learning , vol.57 , Issue.3 , pp. 233-269
    • Flach, P.1    Lachiche, N.2
  • 9
    • 0001553729 scopus 로고    scopus 로고
    • From ukkonen to mccreight and weiner: A unifying view of linear-time suffix tree construction
    • Giegerich, R., & Kurtz, S. (1997). From ukkonen to mccreight and weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3), 331-353.
    • (1997) Algorithmica , vol.19 , Issue.3 , pp. 331-353
    • Giegerich, R.1    Kurtz, S.2
  • 10
    • 38549119256 scopus 로고    scopus 로고
    • Webpage (last accessed October 20, 2004)
    • Graham-Cummings, J. (2004). Spammers compendium. Webpage (last accessed October 20, 2004): http://www.jgc.org/tsc/.
    • (2004) Spammers Compendium
    • Graham-Cummings, J.1
  • 12
    • 0033227559 scopus 로고    scopus 로고
    • Reducing the space requirement of suffix trees
    • Kurtz, S. (1999). Reducing the space requirement of suffix trees. Software Practice and Experience, 29(13), 1149-1171.
    • (1999) Software Practice and Experience , vol.29 , Issue.13 , pp. 1149-1171
    • Kurtz, S.1
  • 13
    • 84957069091 scopus 로고    scopus 로고
    • Naive (Bayes) at forty: The independence assumption in information retrieval
    • C. Nédellec and C. Rouveirol (Eds.), Springer Verlag, Heidelberg
    • Lewis, D. D. (1998). Naive (Bayes) at forty: The independence assumption in information retrieval. In C. Nédellec and C. Rouveirol (Eds.), Proceedings of ECML-98, 10th European Conference on Machine Learning. (pp. 4-15). Springer Verlag, Heidelberg.
    • (1998) Proceedings of ECML-98, 10th European Conference on Machine Learning , pp. 4-15
    • Lewis, D.D.1
  • 15
    • 0032274556 scopus 로고    scopus 로고
    • Classification of text documents
    • Li, Y. H., & Jain, A. K. (1998). Classification of text documents. Comput. J., 41(8), 537-546.
    • (1998) Comput. J. , vol.41 , Issue.8 , pp. 537-546
    • Li, Y.H.1    Jain, A.K.2
  • 16
    • 84859283992 scopus 로고    scopus 로고
    • Webpage (last accessed October 20, 2004)
    • Lloyd, A. (2000). Suffix trees. Webpage (last accessed October 20, 2004): http://www.csse.monash. edu.au/~lloyd/tildeAlgDS/Tree/Suffix/.
    • (2000) Suffix Trees
    • Lloyd, A.1
  • 17
    • 10244268784 scopus 로고    scopus 로고
    • A suffix tree approach to the interpretation of tandem mass spectra: Applications to peptides of non-specific digestion and post-translational modifications
    • Lu, B., & Chen, T. (2003). A suffix tree approach to the interpretation of tandem mass spectra: Applications to peptides of non-specific digestion and post-translational modifications. Bioinformatics, 1990(02), 113ii-121.
    • (2003) Bioinformatics , vol.1990 , Issue.2
    • Lu, B.1    Chen, T.2
  • 20
    • 13944276290 scopus 로고    scopus 로고
    • SpamBayes: Effective open-source, Bayesian based, email classification system
    • Mountain View, CA.
    • Meyer, T., & Whateley, B. (2004). SpamBayes: Effective open-source, Bayesian based, email classification system. In Proceedings of the First Conference on Email and Anti-Spam (CEAS). Mountain View, CA. Available online: http://www.ceas.cc/papers-2004/136.pdf.
    • (2004) Proceedings of the First Conference on Email and Anti-Spam (CEAS)
    • Meyer, T.1    Whateley, B.2
  • 22
    • 0000582788 scopus 로고    scopus 로고
    • An algorithm for suffix stripping
    • Morgan Kaufmann Publishers Inc.
    • Porter, M. F. (1997). An algorithm for suffix stripping. In Readings in information retrieval, (pp. 313-316), Morgan Kaufmann Publishers Inc.
    • (1997) Readings in Information Retrieval , pp. 313-316
    • Porter, M.F.1
  • 26
    • 0002442796 scopus 로고    scopus 로고
    • Machine learning in automated text categorization
    • Sebastiani, F. (2002). Machine learning in automated text categorization. ACM Computing Surveys, 34(1), 1-47.
    • (2002) ACM Computing Surveys , vol.34 , Issue.1 , pp. 1-47
    • Sebastiani, F.1
  • 29
    • 84859291902 scopus 로고    scopus 로고
    • Webpage (last accessed October 20, 2004)
    • unspam.com. (2004). Spam numbers and statistics. Webpage (last accessed October 20, 2004): http://www. unspam.com/fight-spam/information/spamstats.html.
    • (2004) Spam Numbers and Statistics


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