A viewpoint-based approach for interaction graph analysis

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 79-87

  Asur, Sitaram ^a   Parthasarathy, Srinivasan ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Activation functions; Interaction networks; Neighborhood analysis

Indexed keywords

ACTIVATION FUNCTIONS; CRITICAL EVENTS; DYNAMIC GRAPH; INTERACTION GRAPHS; INTERACTION NETWORKS; NEIGHBORHOOD ANALYSIS; SOCIAL NETWORKS; VIDEO SHARING;

ACTIVATION ANALYSIS; ACTIVE NETWORKS;

DYNAMIC ANALYSIS;

EID: 70350666219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557035     Document Type: Conference Paper

References (20)

1. F. Alkemade and C. Castaldi. Strategies for the diffusion of innovations on social networks. Computational Economics, 25(1-2), 2005.
2. S. Amer-Yahia, M. Benedikt, and P. Bohannon. Challenges in searching online communities. IEEE Data Eng. Bull., 30(2):23-31, 2007.
3. S. Asur and S. Parthasarathy. On the use of viewpoint neighborhoods for dynamic graph analysis. Technical Report Sept 2008 OSU-CISRC-9/08-TR50, 2008.
4. S. Asur, S. Parthasarathy, and D. Ucar. An event based framework for characterizing the evolutionary behavior of interaction graphs. SIGKDD, 2007.
5. L. Backstrom, D. P. Huttenlocher, and J. M. Kleinberg. Group formation in large social networks: membership, growth, and evolution. SIGKDD, 2006.
6. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
7. G. Buehrer and S. Parthasarathy and Y. Chen. Adaptive Parallel Graph Mining for CMP Architectures ICDM, 2006.
8. R. Cowan and N. Jonard. Network structure and the diffusion of knowledge. Journal of Economic Dynamics and Control, 28:1557-1575, 2004.
9. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In SIGKDD, 2004.
10. C. L. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
11. V. Kacholia, S. Pandit et al. Bidirectional expansion for keyword search on graph databases. VLDB, 2005.
12. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. SIGKDD, 2003.
13. D. Kempe, J. Kleinberg, and E. Tardos. Influential nodes in a diffusion model for social networks. ICALP, 2005.
14. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. SIGKDD, 2006.
15. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In SIGKDD, 2006.
16. P. Resnik. Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. Journal of Artifical Intelligence Research, 11:95-130, 1999.
17. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In SIGKDD, 2007.
18. C. Tantipathananandh, T. Y. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. SIGKDD, 2007.
19. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. SIGKDD, 2006.
20. H. Yang, I. King, and M. R. Lyu. Diffusionrank: a possible penicillin for web spamming. In SIGIR, 2007.