Unsupervised spam detection based on string alienness measures

Kazuyuki Narisawa; Hideo Bannai; Kohei Hatano; Masayuki Takeda

doi:10.1007/978-3-540-75488-6_16

Unsupervised spam detection based on string alienness measures

Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

Abstract

We propose an unsupervised method for detecting spam documents from a given set of documents, based on equivalence relations on strings. We give three measures for quantifying the alienness (i.e. how different they are from others) of substrings within the documents. A document is then classified as spam if it contains a substring that is in an equivalence class with a high degree of alienness. The proposed method is unsupervised, language independent, and scalable. Computational experiments conducted on data collected from Japanese web forums show that the method successfully discovers spams.

Original language	English
Title of host publication	Discovery Science - 10th International Conference, DS 2007, Proceedings
Publisher	Springer Verlag
Pages	161-172
Number of pages	12
ISBN (Print)	9783540754879
DOIs	https://doi.org/10.1007/978-3-540-75488-6_16
Publication status	Published - 2007
Event	10th International Conference on Discovery Science, DS 2007 - Sendai, Japan Duration: Oct 1 2007 → Oct 4 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4755 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Conference on Discovery Science, DS 2007
Country/Territory	Japan
City	Sendai
Period	10/1/07 → 10/4/07

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-75488-6_16

Cite this

Narisawa, K., Bannai, H., Hatano, K., & Takeda, M. (2007). Unsupervised spam detection based on string alienness measures. In Discovery Science - 10th International Conference, DS 2007, Proceedings (pp. 161-172). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4755 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-75488-6_16

Unsupervised spam detection based on string alienness measures. / Narisawa, Kazuyuki; Bannai, Hideo; Hatano, Kohei et al.

Discovery Science - 10th International Conference, DS 2007, Proceedings. Springer Verlag, 2007. p. 161-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4755 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Narisawa, K, Bannai, H, Hatano, K & Takeda, M 2007, Unsupervised spam detection based on string alienness measures. in Discovery Science - 10th International Conference, DS 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4755 LNAI, Springer Verlag, pp. 161-172, 10th International Conference on Discovery Science, DS 2007, Sendai, Japan, 10/1/07. https://doi.org/10.1007/978-3-540-75488-6_16

Narisawa K, Bannai H, Hatano K , Takeda M. Unsupervised spam detection based on string alienness measures. In Discovery Science - 10th International Conference, DS 2007, Proceedings. Springer Verlag. 2007. p. 161-172. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-75488-6_16

@inproceedings{a699ea7e00d94562ab74fe39c670a142,

title = "Unsupervised spam detection based on string alienness measures",

abstract = "We propose an unsupervised method for detecting spam documents from a given set of documents, based on equivalence relations on strings. We give three measures for quantifying the alienness (i.e. how different they are from others) of substrings within the documents. A document is then classified as spam if it contains a substring that is in an equivalence class with a high degree of alienness. The proposed method is unsupervised, language independent, and scalable. Computational experiments conducted on data collected from Japanese web forums show that the method successfully discovers spams.",

author = "Kazuyuki Narisawa and Hideo Bannai and Kohei Hatano and Masayuki Takeda",

year = "2007",

doi = "10.1007/978-3-540-75488-6_16",

language = "English",

isbn = "9783540754879",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "161--172",

booktitle = "Discovery Science - 10th International Conference, DS 2007, Proceedings",

address = "Germany",

note = "10th International Conference on Discovery Science, DS 2007 ; Conference date: 01-10-2007 Through 04-10-2007",

}

TY - GEN

T1 - Unsupervised spam detection based on string alienness measures

AU - Narisawa, Kazuyuki

AU - Bannai, Hideo

AU - Hatano, Kohei

AU - Takeda, Masayuki

PY - 2007

Y1 - 2007

N2 - We propose an unsupervised method for detecting spam documents from a given set of documents, based on equivalence relations on strings. We give three measures for quantifying the alienness (i.e. how different they are from others) of substrings within the documents. A document is then classified as spam if it contains a substring that is in an equivalence class with a high degree of alienness. The proposed method is unsupervised, language independent, and scalable. Computational experiments conducted on data collected from Japanese web forums show that the method successfully discovers spams.

AB - We propose an unsupervised method for detecting spam documents from a given set of documents, based on equivalence relations on strings. We give three measures for quantifying the alienness (i.e. how different they are from others) of substrings within the documents. A document is then classified as spam if it contains a substring that is in an equivalence class with a high degree of alienness. The proposed method is unsupervised, language independent, and scalable. Computational experiments conducted on data collected from Japanese web forums show that the method successfully discovers spams.

UR - http://www.scopus.com/inward/record.url?scp=38149047603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149047603&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75488-6_16

DO - 10.1007/978-3-540-75488-6_16

M3 - Conference contribution

AN - SCOPUS:38149047603

SN - 9783540754879

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

SP - 161

EP - 172

BT - Discovery Science - 10th International Conference, DS 2007, Proceedings

PB - Springer Verlag

T2 - 10th International Conference on Discovery Science, DS 2007

Y2 - 1 October 2007 through 4 October 2007

ER -

Unsupervised spam detection based on string alienness measures

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this