ShatterPlots: Fast tools for mining large graphs

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 798-809

  Appel, Ana Paula ^a   Chakrabarti, Deepayan ^b   Faloutsos, Christos ^c   Kumar, Ravi ^b   Leskovec, Jure ^d   Tomkins, Andrew ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b YAHOO RESEARCH   (United States)

^c Carnegie Mellon University ^*  (United States)

^d Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; COMPUTER COMMUNICATION NETWORKS; FAST TOOL; LARGE GRAPHS; RECOMMENDATION SYSTEMS; SCALABLE DESIGN; SOCIAL NETWORKS; STRIKING PATTERNS; SYNTHETIC GRAPHS;

BEHAVIORAL RESEARCH;

GRAPH THEORY;

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

References (48)

1. Google programming contest. http://www. google.com/programming-contest/, 2002.
2. C. Aggarwal and P. Yu. Outlier detection for high-dimensional data. In SIGMOD, pages 37-46, 2001.
3. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002.
4. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks. Nature, 406:378-381, 2000.
5. N. T. J. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 2nd edition, 1975.
6. P. Bak. How nature works : The science of self-organized criticality, Sept. 1996.
7. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, pages 509-512, 1999.
8. V. Batagelj and M. Zaversnik. Generalized cores. ArXiv, (cs.DS/0202039), Feb 2002.
9. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In WWW Conf., 2000.
10. J. M. Carlson and J. Doyle. Highly optimized tolerance: A mechanism for power laws in designed systems. Physics Review E, 60(2): 1412-1427, 1999.
11. D. Chakrabarti. AutoPart: Parameter-free graph partitioning and outlier detection. In PKDD, 2004.
12. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos. Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur., 10(4):1-26, 2008.
13. A. Clauset, M. Newman, and C. Moore. Finding community structure in very large networks, August 2004.
14. A. H. Dekker and B. D. Colbert. Network robustness and graph topology. In ACSC '04: Proceedings of the 27th Australasian conference on Computer science, pages 359-368, Darlinghurst, Australia, Australia, 2004. Australian Computer Society, Inc.
15. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 03), Washington, DC, August 24-27 2003.
16. R. Durrett. Random Graph Dynamics. Cambridge University Press, Cambridge, 2007.
17. A. Engel. On large deviation properties of erdos-renyi random graphs. Journal of Statistical Physics, 117:387-426(40), November 2004.
18. P. Erdös and A. Rényi. On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Acadamy of Science, 5:17-61, 1960.
19. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou. Heuristically Optimized Trade-offs: A new paradigm for power laws in the Internet (extended abstract), 2002.
20. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In SIGCOMM, pages 251-262, 1999.
21. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3):66-71, 2002.
22. J. Gehrke, P. Ginsparg, and J. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD Explorations, 5(2):149-151, 2003.
23. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc. Natl. Acad. Sci. USA, volume 99, 2002.
24. R. Kannan, S. Vempala, and A. Vetta. On clusterings - good, bad and spectral. In FOCS, 2000.
25. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput., 48:96-129, 1998.
26. H. Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communications in Mathematical Physics, 74:41-59, Feb. 1980.
27. J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models and methods. In Proceedings of the International Conference on Combinatorics and Computing, 1999.
28. B. Klimt and Y. Yang. Introducing the enron corpus. In CEAS, 2004.
29. J. S. Kong, B. A. Rezaei, N. Sarshar, V. P. Roychowdhury, and P. O. Boykin. Collaborative spam filtering using e-mail networks. Computer, 39(8):67-73, 2006.
30. R. Kumar, A. Tomkins, and E. Vee. Connectivity structure of bipartite graphs via the knc-plot. In WSDM '08: Proceedings of the international conference on Web search and web data mining, pages 129-138, New York, NY, USA, 2008. ACM.
31. J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1):2, 2007.
32. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05: Proceeding of the 11th ACM SIGKDD international conference on Knowledge discovery in data mining, pages 177-187, 2005.
33. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1), 2007.
34. J. Leskovec, M. McGlohon, C. Faloutsos, N. Glance, and M. Hurst. Cascading behavior in large blog graphs. In SDM '07: Proceedings of the XXXth SIAM Conference on Data Mining, 2007.
35. M. Mihail and C. Papadimitriou. On the eigenvalue power law. In RANDOM, Harvard, MA, 2002.
36. S. Milgram. The small-world problem. Psychology Today, 2:60-67, 1967.
37. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
38. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs. In SIGKDD, Edmonton, AB, Canada, 2002.
39. D. M. Pennock, G. W. Flake, S. Lawrence, E. J. Glover, and C. L. Giles. Winners don't take all: Characterizing the competition for links on the Web. Proceedings of the National Academy of Sciences, 99(8):5207-5211, 2002.
40. E. Ravasz and A.-L. Barabási. Hierarchical organization in complex networks. Physical Review E, September 2002.
41. S. Redner. How popular is your paper? an empirical study of the citation distribution. European Physical Journal B, 4:131-134, 1998.
42. M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In ISWC, 2003.
43. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 6(1), 2002.
44. M. Schroeder. Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W.H. Freeman and Company, New York, 1991.
45. R. Sole and B. Goodwin. Signs of Life: How Complexity Pervades Biology. Perseus Books Group, New York, NY, 2000.
46. S. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the Internet topology. In Global Internet, San Antonio, Texas, 2001.
47. C. Tsourakakis. Fast counting of triangles in large real networks, without counting: Algorithms and laws. In ICDM, 2008.
48. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.