Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Best of 2016 Recommended by Editor Recommended by Reviewer Recommended by Reader
Search
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Beutel A., Xu W., Guruswami V., Palow C., Faloutsos C.  WWW 2013 (Proceedings of the 22nd International World Wide Web Conference, Rio de Janeiro, Brazil,  May 13-17, 2013) 119-130. 2013. Type: Proceedings
Date Reviewed: May 15 2014

In Web 2.0, the content is no longer static, but rather dynamically user generated. In this universe, the more interaction a product page or user profile gets, the greater the potential profits an individual or company may achieve with advertisements. Hence, fraudulent behavior has come up in some means of Web 2.0 interaction. Artificial comments, evaluations, recommendations, and likes define artificial interest that may illegitimately portray the importance of online competitors. This paper looks at one specific kind of fraud: illegitimate likes in the Facebook social network.

CopyCatch is a method that identifies artificial behavior between users and pages in Facebook. It has been designed to find what the authors call lockstep behavior, which occurs when groups of users act together, generally liking the same pages at around the same time. CopyCatch was designed for the immense scales observed nowadays, the ones produced by Facebook; to cope with this data, it works in parallel, following Hadoop’s MapReduce framework. As the problem is comparable to the subspace clustering problem, it is arguable that it is NP-hard; therefore, CopyCatch does not try to find the exact solution, but only a good one, as expected in such problems.

CopyCatch uses two heuristics to achieve a good solution: the set of users is defined to maximize the sum of likes for a given set of pages, and the set of liked pages must never shrink. The algorithm is iterative, converging when these two sets present no changes.

CopyCatch is an interesting massive processing algorithm that has proved its value in the challenging environment of Facebook (cosponsor of the research). It is also a good example of what is possible when the data scales too high: parallel optimization. The paper excludes some details of the process due to confidentiality, but nothing that would prevent its reproduction.

Reviewer:  Jose Rodrigues Review #: CR142283 (1408-0691)
Bookmark and Share
  Reviewer Selected
Editor Recommended
 
 
Clustering (I.5.3 )
 
 
Social Networking (H.3.4 ... )
 
 
Web-Based Services (H.3.5 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Clustering": Date
Scalable density-based clustering with quality guarantees using random projections
Schneider J., Vlachos M.  Data Mining and Knowledge Discovery 31(4): 972-1005, 2017. Type: Article
Oct 30 2017
A novel probabilistic clustering model for heterogeneous networks
Deng Z., Xu X.  Machine Learning 104(1): 1-24, 2016. Type: Article
Aug 31 2016
 Semi-supervised hybrid clustering by integrating Gaussian mixture model and distance metric learning
Zhang Y., Wen J., Wang X., Jiang Z.  Journal of Intelligent Information Systems 45(1): 113-130, 2015. Type: Article
Jan 20 2016
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy