Social network discovery based on sensitivity analysis

Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, ASONAM 2009

Volumn , Issue , 2009, Pages 107-112

  Crnovrsanin, Tarik ^a   Correa, Carlos D ^a   Ma, Kwan Liu ^a  

^a University of California   (United States)

Author keywords

Markov centrality; Network visualization; Sensitivity analysis; Social networks

Indexed keywords

ANALYTIC TOOLS; COMPLEX NETWORKS; EFFECTIVE MECHANISMS; MARKOV CENTRALITY; NETWORK VISUALIZATION; NODE IMPORTANCE; NOVEL METHODOLOGY; RANDOM WALK; SENSITIVITY COEFFICIENT; SENSITIVITY PARAMETERS; SOCIAL NETWORKS; SOCIAL STRUCTURE; SUBNETWORKS;

ELECTRIC NETWORK ANALYSIS; VISUALIZATION;

SENSITIVITY ANALYSIS;

EID: 70349843487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2009.56     Document Type: Conference Paper

References (20)

1. S. White and P. Smyth, "Algorithms for estimating relative importance in networks," International Conference on Knowledge Discovery and Data Mining, vol.Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, no.2, pp. 266 - 275, 2003.
2. http://www.cs.umd.edu/hcil/VASTchallenge08/, "IEEE VAST 2008 challenge," 2008.
3. http://reality.media.mit.edu, "MIT reality mining," 2008.
4. M. Newman, "The structure and function of complex networks," SIAMReview, vol.45, no.2, pp. 167 - 256, 2003.
5. S. Wasserman, K. Faust, and M. Granovetter, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
6. L. Freeman, "Visualizing social networks," Journal of Social Structure, vol.1, no.1, 2000.
7. J. P. Scott, Social Network Analysis: A Handbook. SAGE Publications, January 2000.
8. L. C. Freeman, "Centrality in social networks: Conceptual clarification," Social Networks, vol.1, no.3, pp. 215 -239, 1979.
9. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer Networks and ISDN Systems, vol.30, no.1, pp. 1-7, 107-117, April 1998.
10. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," J. ACM, vol.46, no.5, pp. 604-632, 1999.
11. J. Kemeny and J. Snell, Finite Markov Chains. Springer Verlag, 1976.
12. D. Liben-Nowell and J. Kleinberg, "The link prediction problem for social networks," in CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management, 2003, pp. 556-559.
13. D. S. Goldberg and F. P. Roth, "Assessing experimentally derived interactions in a small world." Proc Natl Acad Sci U S A, vol.100, no.8, pp. 4372-4376, April 2003.
14. M. Garland and G. Kumar, "Visual exploration of complex time-varying graphs," IEEE Transactions on Visualization and Computer Graphics, vol.12, no.5, pp. 805-812, 2006. (Pubitemid 44955607)
15. G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Upper Saddle River, NJ: Prentice Hall PTR, 1998.
16. T. Dwyer, S.-H. Hong, D. Koschützki, F. Schreiber, and K. Xu, "Visual analysis of network centralities," in APVis '06: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation. Darlinghurst, Australia, Australia: Australian Computer Society, Inc., 2006, pp. 189-197.
17. F. van Ham and M. Wattenberg, "Centrality based visualization of small world graphs." Comput. Graph. Forum, vol.27, no.3, pp. 975-982, 2008.
18. U. Brandes and T. Erlebach, Network Analysis : Methodological Foundations (Lecture Notes in Computer Science). Springer, March 2005.
19. B. Haverkort and A. Meeuwissen, "Sensitivity and uncertainty analysis of markov-reward models," IEEE Transactions on Reliability, vol.44, no.1, pp. 147-154, Mar 1995.
20. G. Grinstein, C. Plaisant, S. Laskowski, T. O'Connell, J. Scholtz, and M. Whiting, "VAST 2008 challenge: Introducing mini-challenges," Visual Analytics Science and Technology, 2008. VAST '08. IEEE Symposium on, pp. 195-196, Oct. 2008.