Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

DANI: Fast Diffusion Aware Network Inference with Preserving Topological Structure Property (2310.01696v1)

Published 2 Oct 2023 in cs.SI, cs.CY, cs.IR, and cs.LG

Abstract: The fast growth of social networks and their data access limitations in recent years has led to increasing difficulty in obtaining the complete topology of these networks. However, diffusion information over these networks is available, and many algorithms have been proposed to infer the underlying networks using this information. The previously proposed algorithms only focus on inferring more links and ignore preserving the critical topological characteristics of the underlying social networks. In this paper, we propose a novel method called DANI to infer the underlying network while preserving its structural properties. It is based on the Markov transition matrix derived from time series cascades, as well as the node-node similarity that can be observed in the cascade behavior from a structural point of view. In addition, the presented method has linear time complexity (increases linearly with the number of nodes, number of cascades, and square of the average length of cascades), and its distributed version in the MapReduce framework is also scalable. We applied the proposed approach to both real and synthetic networks. The experimental results showed that DANI has higher accuracy and lower run time while maintaining structural properties, including modular structure, degree distribution, connected components, density, and clustering coefficients, than well-known network inference methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Inferring networks of diffusion and influence. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’10, pages 1019–1028, New York, NY, USA, 2010. ACM.
  2. Information diffusion modeling and analysis for socially interacting networks. Social Network Analysis and Mining, 11:1–18, 2021.
  3. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
  4. Information cascade at group scale. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’13, pages 401–409, New York, NY, USA, 2013. ACM.
  5. Interest clustering coefficient: a new metric for directed networks like Twitter. Journal of Complex Networks, 10(1), 12 2021.
  6. What is twitter, a social network or a news media? In Proceedings of the 19th international conference on World wide web, pages 591–600, 2010.
  7. Pairwise-interactions-based bayesian inference of network structure from information cascades. In Proceedings of the ACM Web Conference 2023, WWW ’23, page 102–110, New York, NY, USA, 2023. Association for Computing Machinery.
  8. Overlapping community detection in networks: the state of the art and comparative study. ACM Computing Surveys (CSUR), 45(4):43:1–43:35, 2013.
  9. Weidong Chen. Discovering communities by information diffusion. In Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on, volume 2, pages 1123–1132, July 2011.
  10. Node roles and community structure in networks. In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, WebKDD/SNA-KDD ’07, pages 26–35, New York, NY, USA, 2007. ACM.
  11. The role of social networks in information diffusion. In Proceedings of the 21st International Conference on World Wide Web, WWW ’12, pages 519–528, New York, NY, USA, 2012. ACM.
  12. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters, 12:211–223, 2001.
  13. Cascade-based community detection. In Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, and Aristides Gionis, editors, WSDM, pages 33–42. ACM, 2013a.
  14. Capturing dynamics of information diffusion in sns: A survey of methodology and techniques. ACM Computing Surveys (CSUR), 55(1):1–51, 2021.
  15. Network structure inference, a survey: Motivations, methods, and applications. ACM Computing Surveys (CSUR), 51(2):1–39, 2018.
  16. A survey of information cascade analysis: Models, predictions, and recent advances. ACM Computing Surveys (CSUR), 54(2):1–36, 2021.
  17. Fastinf: A fast algorithm to infer social networks from cascades, 2011.
  18. Submodular inference of diffusion networks from multiple trees. In Proceedings of the 29th International Conference on Machine Learning, pages 489–496, New York, NY, USA, 2012. Omnipress.
  19. On the convexity of latent social network inference. In John D. Lafferty, Christopher K. I. Williams, John Shawe-Taylor, Richard S. Zemel, and Aron Culotta, editors, NIPS, pages 1741–1749. Curran Associates, Inc., 2010.
  20. Uncovering the temporal dynamics of diffusion networks. In Lise Getoor and Tobias Scheffer, editors, Twenty-eighth International Conference on Machine Learning, Bellevue, Washington, pages 561–568. Omnipress, 2011.
  21. Structure and dynamics of information pathways in online media. In Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, and Aristides Gionis, editors, WSDM, pages 23–32. ACM, 2013.
  22. Motif-aware diffusion network inference. International Journal of Data Science and Analytics, 9(4):375–387, 2020.
  23. Statistical estimation of diffusion network topologies. In 2020 IEEE 36th International Conference on Data Engineering (ICDE), pages 625–636. IEEE, 2020.
  24. Dne: A method for extracting cascaded diffusion networks from social networks. In SocialCom/PASSAT, pages 41–48. IEEE, 2011.
  25. Bayesian inference of network structure from information cascades. IEEE Transactions on Signal and Information Processing over Networks, 6:371–381, 2020.
  26. Dani: A fast diffusion aware network inference algorithm. arXiv preprint arXiv:1706.00941, 2017.
  27. Clustering embedded approaches for efficient information network inference. Data Science and Engineering, 1(1):29–40, 2016.
  28. Model-free inference of diffusion networks using rkhs embeddings. Data Mining and Knowledge Discovery, 33(2):499–525, 2019.
  29. Refine: representation learning from diffusion events. In Machine Learning, Optimization, and Data Science: 4th International Conference, pages 141–153. Springer, 2019.
  30. A Poissonian explanation for heavy tails in e-mail communication. Proceedings of the National Academy of Sciences, 105(47):18153–18158, Nov 2008.
  31. Markov chains and mixing times. American Mathematical Soc., 2009.
  32. Influence-based network-oblivious community detection. In ICDM, pages 955–960, 2013b.
  33. Paul Jaccard. Étude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin del la Société Vaudoise des Sciences Naturelles, 37:547–579, 1901.
  34. Community detection in large-scale social networks. In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, WebKDD/SNA-KDD ’07, pages 16–25, New York, NY, USA, 2007. ACM.
  35. Virality prediction and community structure in social networks. Scientific reports, 3, 2013.
  36. S.Y. Bhat and M. Abulaish. Overlapping social network communities and viral marketing. In Computational and Business Intelligence (ISCBI), 2013 International Symposium on, pages 243–246, Aug 2013.
  37. Bayesian overlapping community detection in dynamic networks. arXiv preprint arXiv:1605.02288, 2016.
  38. Spatialhadoop: A mapreduce framework for spatial data. In 2015 IEEE 31st international conference on Data Engineering, pages 1352–1363. IEEE, 2015.
  39. Finding statistically significant communities in networks. PloS one, 6(4):e18961, 2011.
  40. Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK, 2008.
  41. A bayesian framework for community detection integrating content and link. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pages 615–622, 2009.
  42. Community detection with edge content in social media networks. In Anastasios Kementsietsidis and Marcos Antonio Vaz Salles, editors, ICDE, pages 534–545. IEEE Computer Society, 2012.
  43. Lazyfox: fast and parallelized overlapping community detection in large graphs. PeerJ Computer Science, 9:e1291, 2023.
  44. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80(1):016118, jul 2009.
  45. Snap: A general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol., 8(1), jul 2016.
  46. Memetracker: tracking news phrases over the web, 2008. URL http://memetracker.org/.
  47. Phantom cascades: The effect of hidden nodes on information diffusion. Computer Communications, 73:12 – 21, 2016.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now