skip to main content
research-article
Open Access

Measuring Temporal Patterns in Dynamic Social Networks

Published:22 July 2015Publication History
Skip Abstract Section

Abstract

Given social networks over time, how can we measure network activities across different timesteps with a limited number of metrics? We propose two classes of dynamic metrics for assessing temporal evolution patterns of agents in terms of persistency and emergence. For each class of dynamic metrics, we implement it using three different temporal aggregation models ranging from the most commonly used Average Aggregation Model to more the complex models such as the Exponential Aggregation Model. We argue that the problem of measuring temporal patterns can be formulated using Recency and Primacy effect, which is a concept used to characterize human cognitive processes. Experimental results show that the way metrics model Recency--Primacy effect is closely related to their abilities to measure temporal patterns. Furthermore, our results indicate that future network agent activities can be predicted based on history information using dynamic metrics. By conducting multiple experiments, we are also able to find an optimal length of history information that is most relevant to future activities. This optimal length is highly consistent within a dataset and can be used as an intrinsic metric to evaluate a dynamic social network.

References

  1. R. Albert and A. L. Barabási. 2002. Statistical mechanics of complex networks. Reviews of Modern Physics 74, 1, 49--52.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. M. Anthonisse. 1971. The rush in a directed graph. Vol. Technical Report BN 9/71. Stichting Mathematisch Centrum, Amsterdam.Google ScholarGoogle Scholar
  3. A. L. Barabási and R. Albert. 1999. Emergence of scaling in random networks. Science 286, 5439, 509--512.Google ScholarGoogle Scholar
  4. L. Bian and R. Butler. 1999. Comparing effects of aggregation methods on statistical and spatial properties of simulated spatial data. Photogrammetric Engineering and Remote Sensing 65, 73--84.Google ScholarGoogle Scholar
  5. P. Bonacich. 1972. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2, 1, 113--120. DOI:citeulike-article-id:3333118Google ScholarGoogle ScholarCross RefCross Ref
  6. S. P. Borgatti. 2003. The Key Player Problem. In Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers. National Academies Press, 241.Google ScholarGoogle Scholar
  7. K. M. Carley. 1990. Group stability: A socio-cognitive approach. Advances in Group Processes 7, 1--44.Google ScholarGoogle Scholar
  8. W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincon, and Y. Yuan. 2011. Influence maximization in social networks when negative opinions may emerge and propagate. In SDM. Vol. 11, 379--390.Google ScholarGoogle Scholar
  9. J. Deese and R. A. Kaufman. 1957. Serial effects in recall of unorganized and sequentially organized verbal material. Journal of Experimental Psychology 54, 3, 180--187.Google ScholarGoogle ScholarCross RefCross Ref
  10. D. M. Dunlavy, T. G. Kolda, and E. Acar. 2011. Temporal link prediction using matrix and tensor factorizations. ACM Transactions on Knowledge Discovery from Data 5, 2, 1--27. DOI:10.1145/1921632.1921636 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Erdős and A. Rényi. 1960. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5, 17--61.Google ScholarGoogle Scholar
  12. M. Faloutsos, P. Faloutsos, and C. Faloutsos. 1999. On power-law relationships of the internet topology. In ACM SIGCOMM Computer Communication Review. Vol. 29, ACM, 251--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. L. C. Freeman. 1979. Centrality in social networks conceptual clarification. Social Networks 1, 3, 215--239.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. Friedman, T. Hastie, and R. Tibshirani. 2010. Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software 33, 1, 1--22.Google ScholarGoogle ScholarCross RefCross Ref
  15. T. Hastie, R. Tibshirani, J. Friedman, and J. Franklin. 2005. The elements of statistical learning: data mining, inference and prediction. The Mathematical Intelligencer 27, 2, 83--85.Google ScholarGoogle ScholarCross RefCross Ref
  16. A. E. Hoerl and R. W. Kennard. 1970. Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12, 1, 55--67.Google ScholarGoogle ScholarCross RefCross Ref
  17. C. I. Hovland. 1957. The order of presentation in persuasion. Yale University Press, Inc.Google ScholarGoogle Scholar
  18. M. Kas, K. M. Carley, and L. R. Carley. 2013. Incremental Closeness Centrality for Dynamically Changing Social Networks. Workshop on the Semantic and Dynamic Analysis of Information Networks (SDAIN'13). In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), August 25--28, 2013, Niagara Falls, Canada. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Kas, K. M. Carley, and L. R. Carley. 2015. An incremental algorithm for updating betweenness centrality and k-betweenness centrality and its performance on realistic dynamic social network data. Social Network Analysis and Mining (SNAM). SpringerGoogle ScholarGoogle Scholar
  20. D. Kempe, J. Kleinberg, and E. Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. B. Klimt and Y. Yang. 2004. The enron corpus: A new dataset for email classification research. Machine Learning: ECML 2004, 217--226.Google ScholarGoogle Scholar
  22. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. 2008. Microscopic evolution of social networks. Paper presented at the Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, Las Vegas, Nevada, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Leskovec, J. Kleinberg, and C. Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1, 1, 2. DOI: 10.1145/1217299.1217301 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng. 2009. Analyzing communities and their evolutions in dynamic social networks. ACM Transactions on Knowledge Discovery from Data 3, 2, 1--31. DOI: 10.1145/1514888.1514891 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. N. Miller and D. T. Campbell. 1959. Recency and primacy in persuasion as a function of the timing of speeches and measurements. The Journal of Abnormal and Social Psychology 59, 1, 1--9.Google ScholarGoogle ScholarCross RefCross Ref
  26. B. B. Murdock Jr. 1962. The serial position effect of free recall. Journal of Experimental Psychology; Journal of Experimental Psychology 64, 5, 482--488.Google ScholarGoogle ScholarCross RefCross Ref
  27. T. N. Newcomb. 1961. The acquaintance process. New York: Holt, Rinehart and Winston.Google ScholarGoogle Scholar
  28. M. E. J. Newman. 2001a. Clustering and preferential attachment in growing networks. Physical Review E 64, 2, 025102.Google ScholarGoogle ScholarCross RefCross Ref
  29. M. E. J. Newman. 2001b. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences 98, 2, 404--409.Google ScholarGoogle ScholarCross RefCross Ref
  30. M. E. J. Newman. 2004. Coauthorship networks and patterns of scientific collaboration. Proceedings of the National Academy of Sciences of the United States of America 101, Suppl 1, 5200--5205.Google ScholarGoogle ScholarCross RefCross Ref
  31. M. E. J. Newman. 2005. Power laws, Pareto distributions and Zipf's law. Contemporary Physics 46, 5, 323--351.Google ScholarGoogle ScholarCross RefCross Ref
  32. L. A. Palinkas, J. C. Johnson, J. S. Boster, and M. Houseal. 1998. Longitudinal studies of behavior and performance during a winter at the South Pole. Aviation, Space, and Environmental Medicine 69, 1, 73--77.Google ScholarGoogle Scholar
  33. A. K. Romney. 1988. Quantitative models, science and cumulative knowledge. School of Social Sciences, University of California, Irvine.Google ScholarGoogle Scholar
  34. S. F. Sampson. 1968. A Novitiate in a Period of Change: An Experimental and Case Study of Social Relationships. Ph.D dissertation. Cornell University.Google ScholarGoogle Scholar
  35. A. Sanil, D. Banks, and K. Carley. 1995. Models for evolving fixed node networks: Model fitting and model testing. Social Networks 17, 1, 65--81. DOI: 10.1016/0378-8733(94)00249-a.Google ScholarGoogle ScholarCross RefCross Ref
  36. R. Tibshirani. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 267--288.Google ScholarGoogle ScholarCross RefCross Ref
  37. D. J. Watts and S. H. Strogatz. 1998. Collective dynamics of ‘small-world’ networks. Nature 393, 6684, 440--442. DOI: citeulike-article-id:99 DOI: 10.1038/30918.Google ScholarGoogle Scholar
  38. W. Wei, J. Pfeffer, J. Reminga, and K. M. Carley. 2011. Handling Weighted, Asymmetric, Self-Looped, and Disconnected Networks in ORA. Technical Report No. CMU-ISR-11-113. Institute of Software Research, Carnegie Mellon University Pittsburgh, PA.Google ScholarGoogle Scholar
  39. O. R. Zaiane, J. Chen, and R. Goebel. 2007. DBconnect: Mining research community on DBLP data. In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis. ACM, 74--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. H. Zou and T. Hastie. 2005. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67, 2, 301--320.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Measuring Temporal Patterns in Dynamic Social Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Knowledge Discovery from Data
      ACM Transactions on Knowledge Discovery from Data  Volume 10, Issue 1
      July 2015
      321 pages
      ISSN:1556-4681
      EISSN:1556-472X
      DOI:10.1145/2808688
      Issue’s Table of Contents

      Copyright © 2015 Owner/Author

      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 July 2015
      • Accepted: 1 March 2015
      • Revised: 1 November 2014
      • Received: 1 May 2013
      Published in tkdd Volume 10, Issue 1

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader