Mining (social) network graphs to detect random link attacks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 486-495

  Shrivastava, Nisheeth ^a   Majumder, Anirban ^a   Rastogi, Rajeev ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTERNET; MARKETING; MINING; NUCLEAR PROPULSION; RANDOM PROCESSES; SET THEORY; SPAMMING; TECHNOLOGY; TELECOMMUNICATION NETWORKS;

COMMUNICATION NETWORKS; DATA ENGINEERING; GRAPH TRAVERSAL; INTERNATIONAL CONFERENCES; NETWORK GRAPHS; NETWORK RESOURCES; NP-COMPLETE; PHONE CALLS; RANDOM SETS; REAL-LIFE DATA; SOCIAL NETWORKING; SOCIAL NETWORKS; SPAM E-MAILS; SPAM FILTERING; SUB-GRAPHS; USER INTERACTIONS; VIRAL MARKETING;

HEURISTIC PROGRAMMING;

EID: 52649118019     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497457     Document Type: Conference Paper

References (38)

1. "Hotel campari ad campaign. http://www.readwriteweb.com/archives/ using_social-networks_marketing_campaigns.php."
2. "Email metrics program: The network operators' perspective, messaging anti-abuse working group. report 2 - 1st quarter 2006."
3. "http://www.orkut.com/."
4. "http://www.livejournal.com/."
5. P. O. Boykin and V. P. Rowchowdhury, "Leveraging social networks to fight spam," Computer, vol. 38, no. 4, pp. 61-68, 2005.
6. V. Mahajana, E. Muller, and F. M. Bass, "New product diffusion models in marketing: A review and directions for research," Journal of Marketing, vol. 54 (1), pp. 1-26, 1990.
7. P. Domingos and M. Richardson, "Mining the network value of customers," in KDD'01.
8. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in KDD'03.
9. D. Watts and S. Strogatz, "Collective dynamics of small-scale networks'," in Nature, 1998, pp. 440-442.
10. M. Newman, D. Watts, and S. Strogatz, "Random graph models of social networks," PNAS, pp. 2566-2572, 2002.
11. J. Goodman, G. Cormack, and D. Heckerman, "Spam and the ongoing battle for the inbox," CACM, vol. 50, no. 2, pp. 24-33, 2007.
12. M. Garey and D. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1990.
13. "http://www.myspace.com/."
14. "https://www.linkedin.com/."
15. S. Milgram, "The small world problem," Psychology Today, vol. 1, pp. 61-67, 1967.
16. A. Barabasi and R. Albert, "Emergence of scaling in random networks," in Science, 1999.
17. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in STOC'00.
18. A. Curtis, "Small-worlds: Beyond social networking," Rose-Hulman Inst. of Tech. Math Journal, vol. 5, no. 2, 2004.
19. J. Douceur, "The sybil attack," in IPTPS'02.
20. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman, "Sybilguard: defending against sybil attacks via social networks," in SIGCOMM'06.
21. H. Yu, P. B. Gibbons, and M. Kaminsky, "Brief announcement: Toward an optimal social network defense against sybil attacks," in Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC'07), August 2007.
22. C. Karlof and D. Wagner, "Secure routing in wireless sensor networks: Attacks and countermeasures," in SNPA'03.
23. J. Newsome, E. Shi, D. Song, and A. Perrig, "The sybil attack in sensor networks: analysis & defenses," in IPSN'04.
24. L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore art thou r3579x? anonymized social networks, hidden patterns, and structural steganography," in WWW'07.
25. http://en.wikipedia.org/wiki/Viral_marketing.
26. M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz, "A bayesian approach to filtering junk E-mail," in AAAI Tech. Report, 1998. [Online]. Available: citeseer.ist.psu.edu/sahami98bayesian.html
27. A. Bratko, G. V. Cormack, B. Filipic, T. R. Lynam, and B. Zupan, "Spam filtering using statistical data compression models," JMLR, vol. 7, pp. 2673-2698, 2006.
28. I. Koprinska, J. Poon, J. Clark, and J. Chan, "Learning to classify email," Inf. Sci., vol. 177, pp. 2167-2187, 2007.
29. J. Goelback and J. Hendler, "Reputation network analysis for email filtering," in CEAS'04.
30. L. Gomes, R. Almeida, L. Bettencourt, V. Almeida, and J. Almeida, "Comparative graph theoretical characterization of networks of spam," in CEAS'05.
31. R.Kumar, P.Raghavan, S.Rajagopalan, and A.Tomkins, ""extracting large-scale knowledge bases from the web"," in The VLDB Journal, 1999, pp. 639-650.
32. _, ""trawling the Web for emerging cyber-communities", " "Computer Networks (Amsterdam, Netherlands: 1999)", vol. 31, pp. 1481-1493, 1999.
33. D.Gibson, R.Kumar, and A.Tomkins, "Discovering large dense subgraphs in massive graphs," in VLDB '05, 2005.
34. S. Busygin, S. Butenko, and P. Pardalos, "A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere," JCO, pp. 287-297, 2002.
35. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
36. L. Lovasz, "Random walks on graphs: A survey," Combinatorics, vol. 2, pp. 1-16, 1993.
37. P. Erdos and A. Renyi, "On random graphs," Publ. Math. Debrecen, vol. 6, pp. 290-297, 1959.
38. J. Jonasson, "On the cover time for random walks on random graphs," Combinatorics, Probability and Computing, vol. 7, no. 3, pp. 265-279, 1998.