CopyCatch: Stopping group attacks by spotting lockstep behavior in social networks

WWW 2013 - Proceedings of the 22nd International Conference on World Wide Web

Volumn , Issue , 2013, Pages 119-129

  Beutel, Alex ^a   Xu, Wanhong ^b   Guruswami, Venkatesan ^a   Palow, Christopher ^b   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b FACEBOOK   (United States)

Author keywords

Anomaly detection; Bipartite cores; Social networks

Indexed keywords

ANOMALY DETECTION; BIPARTITE CORES; EDGE CONSTRAINTS; GRAPH STRUCTURES; ITERATIVE ALGORITHM; PROBLEM FORMULATION; USER-GENERATED CONTENT; ZARANKIEWICZ PROBLEMS;

ALGORITHMS; LOCKS (FASTENERS); WEB SERVICES;

SOCIAL NETWORKING (ONLINE);

EID: 84893095820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Apache Hadoop. http://hadoop.apache.org/, 2012.
2. L. Akoglu, M. Mcglohon, and C. Faloutsos. RTM: Laws and a recursive generator for weighted time-evolving graphs. In International Conference on Data Mining, December 2008.
3. A. Anagnostopoulos, A. Dasgupta, and R. Kumar. Approximation algorithms for co-clustering. In Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '08, pages 201-210, New York, NY, USA, 2008. ACM.
4. A. Banerjee, I. Dhillon, J. Ghosh, S. Merugu, and D. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. The Journal of Machine Learning Research, 8:1919-1986, October 2007.
5. Y. Cheng. Mean shift, mode seeking, and clustering. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 17(8):790-799, aug 1995.
6. K. Crammer and G. Chechik. A needle in a haystack: local one-class optimization. In Proceedings of the twenty-first international conference on Machine learning, ICML '04, pages 26-, New York, NY, USA, 2004. ACM.
7. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI'04, Dec. 2004.
8. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In Conference of the ACM Special Interest Group on Knowledge Discovery and Data Mining, New York, NY, 2003. ACM Press.
9. Facebook. Better Security through Software. blog.facebook.com/blog.php? post=248766257130. 2010.
10. Facebook. Working Together to Keep You Secure. blog.facebook.com/blog. php?post=68886667130, 2009.
11. Facebook. Staying in Control of Your Facebook Logins. blog.facebook.com/blog.php?post=389991097130, 2010.
12. Facebook. Improvements to our Site Integrity Systems. facebook.com/10151005934870766, 2012.
13. Z. Füredi. An upper bound on Zarankiewicz' Problem. Combinatorics, Probability and Computing, 5(01):29-33, 1996.
14. T. George and S. Merugu. A scalable collaborative filtering framework based on co-clustering. In Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM '05, pages 625-628, Washington, DC, USA, 2005. IEEE Computer Society.
15. G. Gupta and J. Ghosh. Robust one-class clustering using hybrid global and local search. In Proceedings of the 22nd international conference on Machine learning, ICML '05, pages 273-280, New York, NY, USA, 2005. ACM.
16. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. Knowl. Discov. Data, 3(1):1:1-1:58, Helen Martin 2009.
17. K. Maruhashi, F. Guo, and C. Faloutsos. Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis. In Proceedings of the Third International Conference on Advances in Social Network Analysis and Mining, 2011.
18. S. Pandit, D. Chau, S. Wang, and C. Faloutsos. Netprobe: a fast and scalable system for fraud detection in online auction networks. In Proceedings of the 16th international conference on World Wide Web, pages 201-210. ACM, 2007.
19. S. Papadimitriou and J. Sun. Disco: Distributed co-clustering with map-reduce: A case study towards petabyte-scale end-to-end mining. In Data Mining, 2008. ICDM '08. Eighth IEEE International Conference on, pages 512 -521, dec. 2008.
20. E. Papalexakis, A. Beutel, and P. Steenkiste. Network anomaly detection using co-clustering. In 2012 International Conference on Advances in Social Network Analysis and Mining, ASONAM 2012, 2012.
21. E. Papalexakis and N. Sidiropoulos. Co-clustering as multilinear decomposition with sparse latent factors. In Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on, pages 2064-2067. IEEE, 2011.
22. R. Peeters. The maximum edge biclique problem is np-complete. Discrete Appl. Math., 131(3):651-654, Sept. 2003.
23. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, KDD '05, pages 228-238, New York, NY, USA, 2005. ACM.
24. B. A. Prakash, M. Seshadri, A. Sridharan, S. Machiraju, and C. Faloutsos. Eigenspokes: Surprising patterns and scalable community chipping in large graphs. PAKDD 2010, 21-24 June 2010.
25. T. Stein, E. Chen, and K. Mangla. Facebook immune system. In Proceedings of the 4th Workshop on Social Network Systems, SNS '11, pages 8:1-8:8, New York, NY, USA, 2011. ACM.
26. A. Thusoo, Z. Shao, S. Anthony, D. Borthakur, N. Jain, J. Sen Sarma, R. Murthy, and H. Liu. Data warehousing and analytics infrastructure at facebook. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, SIGMOD '10, pages 1013-1020, New York, NY, USA, 2010. ACM.
27. K. Zarankiewicz. Problem p 101. In Colloq. Math, volume 2, page 301, 1951.