메뉴 건너뛰기




Volumn 4755 LNAI, Issue , 2007, Pages 161-172

Unsupervised spam detection based on string alienness measures

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION RETRIEVAL SYSTEMS; SPAMMING; UNSUPERVISED LEARNING; WEB SERVICES;

EID: 38149047603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75488-6_16     Document Type: Conference Paper
Times cited : (18)

References (18)
  • 2
    • 38149031102 scopus 로고    scopus 로고
    • CNETNEWS.COM: Tempted by blogs, spam becomes 'splog' (2005), http://news.com.com/2100-1032_3-5903409.html
    • CNETNEWS.COM: Tempted by blogs, spam becomes 'splog' (2005), http://news.com.com/2100-1032_3-5903409.html
  • 3
    • 38149002434 scopus 로고    scopus 로고
    • CNETNEWS.COM: Spim, splog on the rise (2006), http://news.com.com/2100- 7349.3-6091123.html
    • CNETNEWS.COM: Spim, splog on the rise (2006), http://news.com.com/2100- 7349.3-6091123.html
  • 10
    • 38149043648 scopus 로고    scopus 로고
    • Sahami, M., Dumais, S., Heckerman, D., Horvitz, E.: A Bayesian approach to filtering junk e-mail. In:AAAI Workshop on Learning for Text Categorization (1998), ftp://ftp.research.microsoft.com/pub/ejh/junkfilter.pdf
    • Sahami, M., Dumais, S., Heckerman, D., Horvitz, E.: A Bayesian approach to filtering junk e-mail. In:AAAI Workshop on Learning for Text Categorization (1998), ftp://ftp.research.microsoft.com/pub/ejh/junkfilter.pdf
  • 15
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935-948 (1993)
    • (1993) SIAM Journal on Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 16
    • 37849015556 scopus 로고    scopus 로고
    • Narisawa, K., Inenaga, S., Bannai, H., Takeda, M.: Efficient computation of substring equivalence classes with suffix arrays. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, 4580, pp. 340-351. Springer, Heidelberg (2007)
    • Narisawa, K., Inenaga, S., Bannai, H., Takeda, M.: Efficient computation of substring equivalence classes with suffix arrays. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 340-351. Springer, Heidelberg (2007)
  • 17
    • 84956976999 scopus 로고    scopus 로고
    • Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, 2089, pp. 181-192. Springer, Heidelberg (2001)
    • Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidelberg (2001)


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