Crawling social internetworking systems

Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012

Volumn , Issue , 2012, Pages 506-510

  Buccafurri, Francesco ^a   Lax, Gianluca ^a   Nocera, Antonino ^a   Ursino, Domenico ^a  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

Author keywords

Crawling strategies; Social internetworking systems; Social networks

Indexed keywords

CRAWLING STRATEGY; INTERNETWORKING; SOCIAL INTERNETWORKING SYSTEMS; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS; TOPOLOGICAL FEATURES; UNDERLYING GRAPHS;

COMPUTER NETWORKS; INFORMATION SYSTEMS;

SOCIAL NETWORKING (ONLINE);

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

References (25)

1. FriendFeed. http://friendfeed.com/2012.
2. Gathera. http://www.gathera.com/, 2012.
3. Google Open Social. http://code.google.com/intl/it-IT/apis/opensocial/ 2012.
4. Power.com. http://power.com, 2012.
5. The Friend of a Friend (FOAF) project. http://www.foaf-project.org/2012.
6. XFN - XHTML Friends Network. http://gmpg.org/xfn, 2012.
7. Y.Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. Analysis of topological characteristics of huge online social networking services. In Proc. of the International Conference on World Wide Web (WWW'07), pages 835-844, Banff, Alberta, Canada, 2007. ACM.
8. M. Berlingerio, M. Coscia, F. Giannotti, A. Monreale, and D. Pedreschi. Towards discovery of eras in social networks. In Proc. of the Workshops of the International Conference on Data Engineering (ICDE 2010), pages 278-281, Long Beach, California, USA, 2010. IEEE.
9. F. Buccafurri, V.D. Foti, G. Lax, A. Nocera, and D. Ursino. Bridge Analysis in a Social Internetworking Scenario. Technical Report. Available at the address http://www.ursino.unirc.it/bds.html, 2012.
10. D.H Chau, S. Pandit, S. Wang, and C. Faloutsos. Parallel crawling for online social networks. In Proc. of the International Conference on World Wide Web (WWW'07), pages 1283-1284, Banff, Alberta, Canada, 2007. ACM.
11. X. Cheng, C. Dale, and J. Liu. Statistics and Social Network of Youtube Videos. In Proc. of the International Workshop on Quality of Service (IWQoS 2008), pages 229-238, Enschede, The Netherlands, 2008. IEEE.
12. A.C. Gilbert and K. Levchenko. Compressing network graphs. In Proc. of the International Workshop on Link Analysis and Group Detection (LinkKDD'04), Seattle, WA, USA, 2004. ACM.
13. M. Gjoka, M. Kurant, C.T. Butts, and A. Markopoulou. Walking in Facebook: A case study of unbiased sampling of OSNs. In Proc. of the International Conference on Computer Communications (INFOCOM' 10), pages 1-9, San Diego, CA, USA, 2010. IEEE.
14. J. Kleinberg. The convergence of social and technological networks. Communications of the ACM, 51(11):66-72, 2008.
15. B. Krishnamurthy, P. Gill, and M. Arlitt. A few chirps about Twitter. In Proc. of the First Workshop on Online Social Networks, pages 19-24, Seattle, Washington, USA, 2008.
16. V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J.H. Cui, and A. Percus. Reducing Large Internet Topologies for Faster Simulations. In Proc. of the International Conference on Networking (Networking 2005), pages 165-172, Waterloo, Ontario, Canada, 2005. Springer.
17. M. Kurant, A. Markopoulou, and P. Thiran. On the bias of BFS (Breadth First Search). In Proc. of the International Teletraffic Congress (ITC 22), pages 1-8, Amsterdam, The Netherlands, 2010. IEEE.
18. S.H. Lee, P.J. Kim, and H. Jeong. Statistical properties of sampled networks. Physical Review E, 73(1):016102, 2006.
19. J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), pages 631-636, Philadelphia, PA, USA, 2006. ACM.
20. L. Lov́asz. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2(1):1-46, 1993.
21. A. Mislove, H.S. Koppula, K.P. Gummadi, F. Druschel, and B. Bhattacharjee. Growth of the Flickr Social Network. In Proc. of the International Workshop on Online Social Networks (WOSN08), pages 25-30, Seattle, Washington, USA, 2008. ACM.
22. D. Rafiei. Effectively visualizing large networks through sampling. In Visualization, IEEE 2005 (VIS'05), pages 375-382, Minneapolis, MN, 2005. IEEE.
23. A.H. Rasti, M. Torkjazi, R. Rejaie, and D. Stutzbach. Evaluating Sampling Techniques for Large Dynamic Graphs. Univ. Oregon, Tech. Rep. CIS-TR-08-01, 2008.
24. D. Stutzback, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On unbiased sampling for unstructured peer-to-peer networks. In Proc. of the International Conference on Internet Measurements, pages 27-40, Rio De Janeiro, Brasil, 2006. ACM.
25. S. Ye, J. Lang, and F. Wu. Crawling online social graphs. In Proc. of the International Asia-Pacific Web Conference (APWeb'10), pages 236-242, Busan, Korea, 2010. IEEE.