{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:37Z","timestamp":1725493477278},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75488-6_16","type":"book-chapter","created":{"date-parts":[[2007,8,31]],"date-time":"2007-08-31T07:13:45Z","timestamp":1188544425000},"page":"161-172","source":"Crossref","is-referenced-by-count":13,"title":["Unsupervised Spam Detection Based on String Alienness Measures"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Narisawa","sequence":"first","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Jansen, B.J.: Adversarial information retrieval aspects of sponsored search. In: AIRWeb. Proceedings of the First International Workshop on Adversarial Information Retrieval on the Web (2006), \n                    \n                      http:\/\/airweb.cse.lehigh.edu\/2006\/"},{"key":"16_CR2","unstructured":"CNETNEWS.COM: Tempted by blogs, spam becomes \u2019splog\u2019 (2005), \n                    \n                      http:\/\/news.com.com\/2100-1032_3-5903409.html"},{"key":"16_CR3","unstructured":"CNETNEWS.COM: Spim, splog on the rise (2006), \n                    \n                      http:\/\/news.com.com\/2100-7349_3-6091123.html"},{"key":"16_CR4","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Library Working Paper (1998)"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/S0304-3975(02)00185-8","volume":"292","author":"M. Takeda","year":"2003","unstructured":"Takeda, M., Matsumoto, T., Fukuda, T., Nanri, I.: Discovering characteristic expressions in literary works. Theoretical Computer Science\u00a0292(2), 525\u2013546 (2003)","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","unstructured":"Narisawa, K., Yamada, Y., Ikeda, D., Takeda, M.: Detecting blog spams using the vocabulary size of all substrings in their copies. In: Proceedings of the 3rd Annual Workshop on Weblogging Ecosystem (at the 15th World Wide Web Conference) (2006)"},{"key":"16_CR7","unstructured":"Bencz\u00fa, A.A., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Link-based similarity search to fight web spam. In: AIRWeb. Proceedings of the First International Workshop on Adversarial Information Retrieval on the Web (2006), \n                    \n                      http:\/\/airweb.cse.lehigh.edu\/2006\/"},{"key":"16_CR8","unstructured":"Becchetti, L., Castillo, C., Donato, D., Leonardi, S., Baeza-Yates, R.: Link-based characterization and detection of web spam. In: AIRWeb. Proceedings of the First International Workshop on Adversarial Information Retrieval on the Web (2006), \n                    \n                      http:\/\/airweb.cse.lehigh.edu\/2006\/"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"da Costa Carvalho, A.L., Chirita, P.A., de Moura, E.S., Calado, P., Nejdl, W.: Site level noise removal for search engines. In: Proceedings of the 15th World Wide Web Conference (2006)","DOI":"10.1145\/1135777.1135793"},{"key":"16_CR10","unstructured":"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), \n                    \n                      ftp:\/\/ftp.research.microsoft.com\/pub\/ejh\/junkfilter.pdf"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Yoshida, K., Adachi, F., Washio, T., Motoda, H., Homma, T., Nakashima, A., Fujikawa, H., Yamazaki, K.: Density-based spam detector. In: KDD, pp. 486\u2013493 (2004)","DOI":"10.1145\/1014052.1014107"},{"key":"16_CR12","volume-title":"Human Behavior and the Principle of Least Effort","author":"G.K. Zipf","year":"1949","unstructured":"Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading (1949)"},{"key":"16_CR13","unstructured":"Zipf, G.K.: The Psycho-Biology of Language: An Introduction to Dynamic Philology. Houghton Mifflin (1935)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science\u00a040, 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-540-73437-6_34","volume-title":"CPM 2007","author":"K. Narisawa","year":"2007","unstructured":"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.\u00a04580, pp. 340\u2013351. Springer, Heidelberg (2007)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Proceeding of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM)","author":"T. Kasai","year":"2001","unstructured":"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.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"16_CR18","unstructured":"Technorati: The state of the live web (2007), \n                    \n                      http:\/\/technorati.com\/weblog\/2007\/04\/328.html"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75488-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:21:49Z","timestamp":1619504509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75488-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754879"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75488-6_16","relation":{},"subject":[]}}