Content-driven detection of campaigns in social media

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 551-556

  Lee, Kyumin ^a   Caverlee, James ^a   Cheng, Zhiyuan ^a   Sui, Daniel Z ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

campaign detection; social media

Indexed keywords

ADVERTISING CAMPAIGN; EXPERIMENTAL STUDIES; FREE TEXTS; GRAPH MINING; HIGH PRECISION; SOCIAL MEDIA; SOCIAL SYSTEMS; SPAM MESSAGES; TALKING POINT;

INTERNET;

KNOWLEDGE MANAGEMENT;

EID: 83055187614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063658     Document Type: Conference Paper

References (11)

1. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Comput. Netw. ISDN Syst., 29(8-13):1157-1166, 1997.
2. A. Chowdhury, O. Frieder, D. Grossman, and M. C. McCabe. Collection statistics for fast duplicate document detection. ACM Trans. Inf. Syst., 20(2):171-191, 2002. (Pubitemid 44642301)
3. L. Films. (astro)turf wars. www.astroturfwars.com, 2011.
4. H. Gao, J. Hu, C. Wilson, Z. Li, Y. Chen, and B. Y. Zhao. Detecting and characterizing social spam campaigns. In Proceedings of the 10th annual conference on Internet measurement (IMC), 2010.
5. N. J. Hurley, M. P. O'Mahony, and G. C. M. Silvestre. Attacking Recommender Systems: A Cost-Benefit Analysis. Intelligent Systems, IEEE, 22(3):64-68, 2007.
6. S. K. Lam and J. Riedl. Shilling recommender systems for fun and profit. In WWW, 2004.
7. E. P. Lim, V. A. Nguyen, N. Jindal, B. Liu, and H. W. Lauw. Detecting product review spammers using rating behaviors. In CIKM, 2010.
8. M. Theobald, J. Siddharth, and A. Paepcke. Spotsigs: robust and efficient near duplicate detection in large web collections. In SIGIR, 2008.
9. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci., 363:28-42, 2006. (Pubitemid 44486521)
10. N. Wang, S. Parthasarathy, K.-L. Tan, and A. K. H. Tung. Csv: visualizing and mining cohesive subgraphs. In SIGMOD, 2008.
11. B. Wu, S. Yang, H. Zhao, and B. Wang. A distributed algorithm to enumerate all maximal cliques in mapreduce. In Proceedings of the Fourth International Conference on Frontier of Computer Science and Technology, 2009.