Efficient social network approximate analysis on blogosphere based on network structure characteristics

Proceedings of the 3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09

Volumn , Issue , 2009, Pages

  Tang, Jintao ^a   Wang, Ting ^a   Wang, Ji ^b   Wei, Dengping ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

Approximate algorithm; Blogosphere; Complex network; Social network analysis; Structural characteristics

Indexed keywords

APPROXIMATE ALGORITHMS; BLOGOSPHERES; COMPLEX NETWORKS; SOCIAL NETWORK ANALYSIS; STRUCTURAL CHARACTERISTICS;

ALGORITHMS; BLOGS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; INTERNET; SOCIAL NETWORKING (ONLINE); TECHNICAL PRESENTATIONS;

STRUCTURAL ANALYSIS;

EID: 77951468668     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1731011.1731018     Document Type: Conference Paper

References (36)

1. Mayfield A. What is social media? Spannerworks. Updated Jan 22, 2007.
2. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computing, 1990, 9:251-280.
3. S. Milgram, "The small world problem", Psychology Tody 2, 60-67, 1967.
4. A-L. Barabási and R. Albert, "Emergence of scaling in random networks", Science, vol.286, pp. 509-512, Oct.1999.
5. M. E. J. Newman,The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America, Vol. 98, No. 2 (Jan. 16, 2001), pp. 404-409
6. J. Scot. Social Network Analysis: A Handbook, 2nd ed. Sage Publications, 1991
7. K. Lerman and Laurie Jones. Social browsing on flickr. In Proc. of International Conference on Weblogs and Social Media (ICWSM-07), 2007.
8. K. Lerman. Social networks and social information filtering on digg. In Proc. of International Conference on Weblogs and Social Media (ICWSM-07),
9. Merelo-Geurvos, J. J., Prieto, B., Rateb, F., & Tricas, F. Mapping weblog communities. Submitted to Computer Networks, 2004
10. R. Kumar, J. Novak, P. Raghavan, and A. Tomkins. On the bursty evolution of blogspace. In Proceedings of the 12th International Conference on World Wide Web (WWW), pages 568-576, 2003.
11. K. Ishida. Extracting latent weblog communities: A partitioning algorithm for bipartite graphs. In Proceedings of 2nd Annual Workshop on the Weblogging Ecosystem, 2005
12. L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks 1:215-239, 1979.
13. Kaufman, L., & Rousseeuw, P. Finding groups in data. an introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics, New York: Wiley, 1990.
14. M. Girvan and M. Newman. Community structure in social and biological networks. Proc. Natl. Acad. Sci., 99(12):7821-7826, 2002.
15. Dijkstra, E.W. A Note on Two Problems in Connection with Graphs. Numeriche Mathematik, 1959, 1:269-271.
16. R. W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 1962, 5(6): 345.
17. BELLMAN, R. E., "On a Routing Problem," Q. Applied Math. 16, 87-90 (1958)
18. LR Ford and D R Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962
19. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths in graphs. IEEE Trans. Syst. Sci. and Cybernetics, 1968, SSC-4(2):100-107
20. Fredman, Michael L. et al. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM. Vol.34: 596-615, 1987 (Pubitemid 17653423)
21. Cherkassky B.V, Goldberg A.V & Radzik T. Shortest Paths Algorithms: Theory and Experimental Evaluation [J]. Mathematical Programming, 1996,73:129-217
22. E. Chow. A graph search heuristic for shortest distance paths. Technical Report UCRL-JRNL-202894, Lawrence Livermore National Laboratory, 2004.
23. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2005.
24. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A lightweight network location service without virtual coordinates.In Proceedings of SIGCOMM, 2005.
25. 2 polylog n) time. Theoretical Computer Science Theoretical Computer Science, 410(1): 84-93, 2009
26. Rattigan,M., Maier, M., and Jensen, D. Using structure indices for efficient approximation of network properties. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 357-366,2006
27. Rattigan, M., Maier, M., & Jensen, D. Graph Clustering with Network Structure Indices. Proceedings of the 24th International Conference on Machine Learning(ICML), Corvallis, OR, 2007
28. M.E.J.Newman, The Structure and Function of Complex Networks. SIAM Review, Vol. 45, No. 2, pp. 167-256. 2003.
29. Mark Granovetter. The Strength of Weak Ties. American Journal of Sociology, May 1973, Vol. 78, No. 6: 1360-1380.
30. Neminen,V. On Centrality in a Graph. Scandinavian Journal of Psychology, 1974, 15.
31. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 2001, 25:163-177.
32. M.Newman. Detecting community structure in networks. The European Physical Journal B-Condensed Matter, 38, 321-330
33. McCallum, A. Nigam, K. Rennie, J. & Seymore, K. A machine learning approach to building domain-specific search engines. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999, 662-667.
34. Bearman PS, Moody J & Stovel K.Chains of affection: The structure of adolescent romantic and sexual networks. American Journal of Sciology, Vol.110, No.1, 2004. (Pubitemid 39427380)
35. P. Erdös & A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci.5, 17-61. 1960.
36. Watts, Duncan J. Strogatz, Steven H. Collective dynamics of 'small-world' networks". Nature 393: 440-442. 1998