Reconstruction of a social network graph from incomplete call detail records

Proceedings of the 2011 International Conference on Computational Aspects of Social Networks, CASoN'11

Volumn , Issue , 2011, Pages 136-140

  Kamola, Mariusz ^a,b   Niewiadomska Szynkiewicz, Ewa ^a,b   Piech, Bartłomiej Cezary ^b  

^a RESEARCH AND ACADEMIC COMPUTER NETWORK NASK   (Poland)

^b WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

affiliation graph; bipartite graph; CDR; cliques; parallel processing; social network

Indexed keywords

AFFILIATION GRAPH; BIPARTITE GRAPHS; CDR; CLIQUES; PARALLEL PROCESSING; SOCIAL NETWORKS;

COMPUTER NETWORKS; INFORMATION SYSTEMS;

SOCIAL NETWORKING (ONLINE);

EID: 84055190753     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASON.2011.6085932     Document Type: Conference Paper

References (16)

1. Gartner Identifies the Top 10 Strategic Technologies for 2011, http://www.gartner.com/it/page.jsp?id=1454221, Accessed 2011.06.30
2. G. Simmel, The Sociology of Georg Simmel. The Free Press, New York, 1908/1950
3. D. Lam, D.C. Cox and J. Widom, "Teletraffic Modeling for Personal Communications Services"IEEE Communications Magazine, Feb. 1997, pp. 79-87 (Pubitemid 127641962)
4. Azul Systems, http://www.azulsystems.com, Accessed 2011.06.30
5. J. O'Madadhain, D. Fisher, P. Smyth, S. White, Y.-B. Boey, "Analysis and Visualization of Network Data using JUNG", unpublished, http://jung.sourceforge.net/doc/JUNG-journal.pdf, Accessed 2011.06.30
6. S. Milgram, "The Small World Problem", Psychology Today, vol. 1, pp. 60-67, 1967
7. A.-L. Barabási and R. Albert, "Emergence of Scaling in Random Networks", Science, vol. 286, pp. 509-512, 1999
8. G.K. Zipf, Human Behavior and the Principle of Least Effort, Addison-Wesley, 1949
9. K.-I. Goh, E. Oh, H. Jeong, B. Kahng and D. Kim, "Classification of Scale-Free Networks", Proceedings of the National Academy of Sciences of the United States, vol. 99, 2002
10. A.A. Nanavati et al., "Analyzing the Structure and Evolution of Massive Telecom Graphs", IEEE Transactions on Knowledge and Data Engineering, vol. 20, pp.703-718, 2008
11. C.-P. Wei, I-T. Chiu, "Turning Telecommunication Call Details to Churn Prediction: a Data Mining Approach", Expert Systems with Applications, vol. 23, pp. 103-112, 2002
12. N.N. Krishna, M. Saravannan, "Formation of Triads in Mobile Telecom Networks", Proceedings of the Third Internatinal Conference on Advances in Databases, Knowledge, and Data Applications, 2011, http://www.thinkmind.org/ download.php?articleid=dbkda-2011-7-4 0-30100, Accessed 2011.08.24
13. N. Eagle, A. Pentland, D. Lazer, "Inferring Friendship Network Structure by Using Mobile Phone Data", Proceedings of the National Academy of Sciences, vol. 136, pp. 15274-15278, 2009
14. J.-P. Onnela et al., "Structure and Tie Strengths in Mobile Communication Networks", Proceedings of the National Academy of Sciences, vol. 104, pp. 7332-7336, 2007 (Pubitemid 47185905)
15. M.S. Granovetter, "The Strength of Weak Ties", The American Journal of Sociology, vol. 78, pp. 1360-1380, 1973, http://sociology.stanford. edu/people/mgranovetter/documents/granstr engthweakties.pdf, Accessed 2011.08.24
16. A. Narayannan, V. Shmatikov, "De-anonymizing Social Networks", Proceedings of the 30th IEEE Symposium on Security and Privacy, pp. 173-187, 2009, http://www.cs.utexas.edu/~shmat/shmat-oak09.pdf, Accessed 2011.08.24