Skip to main content
SpringerLink
Log in

Diffusion Algorithms in Multimedia Social Networks: A Novel Model

  • Chapter
  • First Online:
Influence and Behavior Analysis in Social Networks and Social Media (ASONAM 2018)

Part of the book series: Lecture Notes in Social Networks ((LNSN))

Abstract

Online social network (OSN) is quickly becoming a promising field of interest for big data analytics and for a number of real applications, ranging from marketing to user profiling and recommendation. Anyway, although OSNs are naturally formed by heterogeneous data, in the recent past, only a few works have considered an explicit use of multimedia in their models. In this paper, we explicitly take into account the intrinsic characteristics of multimedia, having the awareness that in this way, both the models and the analysis algorithms will enormously benefit from such kind of information. In particular, we describe a multimedia data model for OSN, in order to provide, in a unique framework, novel mechanisms for effective management of multimedia information supporting several classic applications, such as influence analysis and maximization. Experiments have been carried out on Flickr Creative Commons Y FCC100M dataset containing about 100 million images, showing that the proposed approach combines both time and efficacy performances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Sometimes, they are generated by automatic analysis of annotations, tags, keywords, comments, reviews, and so on. Of course, they are not always available for every kind of application.

  2. 2.

    https://webscope.sandbox.yahoo.com.

  3. 3.

    https://www.databricks.com/.

References

  1. F. Amato, V. Moscato, A. Picariello, G. Sperlí, Multimedia social network modeling: a proposal, in 2016 IEEE Tenth International Conference on Semantic Computing (ICSC) (IEEE, New York, 2016), pp. 448–453

    Book  Google Scholar 

  2. G. Sperlì, F. Amato, V. Moscato, A. Picariello, Multimedia social network modeling using hypergraphs. Int. J. Multimed. Data Eng. Manage. 7(3), 53–77 (2016)

    Article  Google Scholar 

  3. X. Li, M. K. Ng, Y. Ye, Multicomm: finding community structure in multi-dimensional networks. IEEE Trans. Knowl. Data Eng. 26(4), 929–941 (2014)

    Article  Google Scholar 

  4. S. Jiang, H. Chen, NATERGM: a model for examining the role of nodal attributes in dynamic social media networks. IEEE Trans. Knowl. Data Eng. 28(3), 729–740 (2016)

    Article  Google Scholar 

  5. P. Domingos, M. Richardson, Mining the network value of customers, in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, 2001), pp. 57–66

    Google Scholar 

  6. D. Kempe, J. Kleinberg, É. Tardos, 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, New York, 2003), pp. 137–146

    Google Scholar 

  7. S. Wen, J. Jiang, B. Liu, Y. Xiang, W. Zhou, Using epidemic betweenness to measure the influence of users in complex networks. J. Netw. Comput. Appl. 78, 288–299 (2017)

    Article  Google Scholar 

  8. V. Sood, S. Redner, Voter model on heterogeneous graphs. Phys. Rev. Lett. 94(17), 178701 (2005)

    Google Scholar 

  9. Y. Li, W. Chen, Y. Wang, Z.-L. Zhang, Voter model on signed social networks. Internet Math. 11(2), 93–133 (2015)

    Article  Google Scholar 

  10. M. Doo, L. Liu, Probabilistic diffusion of social influence with incentives. IEEE Trans. Serv. Comput. 7(3), 387–400 (2014)

    Article  Google Scholar 

  11. Y. Hu, S. Havlin, H.A. Makse, Conditions for viral influence spreading through multiplex correlated social networks. Phys. Rev. X 4(2), 021031 (2014)

    Google Scholar 

  12. Y. Jiang, J. Jiang, Diffusion in social networks: a multiagent perspective. IEEE Trans. Syst. Man Cybern. Syst. 45(2), 198–213 (2015)

    Article  Google Scholar 

  13. W. Chen, Y. Wang, S. Yang, Efficient influence maximization in social networks, in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, 2009), pp. 199–208

    Google Scholar 

  14. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, Cost-effective outbreak detection in networks, in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, 2007), pp. 420–429

    Google Scholar 

  15. N. Ohsaka, T. Akiba, Y. Yoshida, K.-I. Kawarabayashi, Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations, in AAAI (2014), pp. 138–144

    Google Scholar 

  16. K. Jung, W. Heo, W. Chen, IRIE: scalable and robust influence maximization in social networks, in 2012 IEEE 12th International Conference on Data Mining (IEEE, New York, 2012), pp. 918–923

    Google Scholar 

  17. Y. Wang, G. Cong, G. Song, K. Xie, Community-based greedy algorithm for mining top-k influential nodes in mobile social networks, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, 2010), pp. 1039–1048

    Google Scholar 

  18. C. Borgs, M. Brautbar, J. Chayes, B. Lucier, Maximizing social influence in nearly optimal time, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, 2014), pp. 946–957

    Google Scholar 

  19. Y. Tang, Y. Shi, X. Xiao, Influence maximization in near-linear time: a martingale approach, in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (ACM, New York, 2015), pp. 1539–1554

    Google Scholar 

  20. Y. Tang, X. Xiao, Y. Shi, Influence maximization: near-optimal time complexity meets practical efficiency, in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (ACM, New York, 2014), pp. 75–86

    Google Scholar 

  21. Y. Tang, Y. Shi, X. Xiao, Influence maximization in near-linear time: a martingale approach, in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, ser. SIGMOD ’15 (ACM, New York, 2015), pp. 1539–1554 [Online]. Available: http://doi.acm.org/10.1145/2723372.2723734

  22. C.P. Sankar, S. Asharaf, K.S. Kumar, Learning from bees: an approach for influence maximization on viral campaigns. PloS One 11(12), e0168125 (2016)

    Google Scholar 

  23. W.-S. Yang, S.-X. Weng, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, Application of the ant colony optimization algorithm to the influence-maximization problem. Int. J. Swarm Intell. Evolut. Comput. 1(1), 1–8 (2012)

    Google Scholar 

  24. F. Zhou, R.J. Jiao, B. Lei, Bilevel game-theoretic optimization for product adoption maximization incorporating social network effects. IEEE Trans. Syst. Man Cybern. Syst. 46(8), 1047–1060 (2016)

    Article  Google Scholar 

  25. S. Vaswani, L. Lakshmanan, M. Schmidt, et al., Influence maximization with bandits (2015). arXiv preprint arXiv:1503.00024

    Google Scholar 

  26. D. Bucur, G. Iacca, Influence maximization in social networks with genetic algorithms, in European Conference on the Applications of Evolutionary Computation (Springer, New York, 2016), pp. 379–392

    Google Scholar 

  27. D. Bucur, G. Iacca, M. Gaudesi, G. Squillero, A. Tonda, Optimizing groups of colluding strong attackers in mobile urban communication networks with evolutionary algorithms. Appl. Soft Comput. 40, 416–426 (2016)

    Article  Google Scholar 

  28. J. Shang, S. Zhou, X. Li, L. Liu, H. Wu, Cofim: a community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117, 88–100 (2017)

    Article  Google Scholar 

  29. E. Bagheri, G. Dastghaibyfard, A. Hamzeh, An efficient and fast influence maximization algorithm based on community detection, in 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), August 2016, pp. 1636–1641

    Google Scholar 

  30. Q. Fang, J. Sang, C. Xu, Y. Rui, Topic-sensitive influencer mining in interest-based social media networks via hypergraph learning. IEEE Trans. Multimed. 16(3), 796–812 (2014)

    Article  Google Scholar 

  31. D. Williams, Probability with Martingales (Cambridge University Press, Cambridge, 1991)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Information Technology, University of Naples “Federico II”, Naples, Italy

    Flora Amato, Vincenzo Moscato, Antonio Picariello & Giancarlo Sperlí

  2. CINI - ITEM National Lab Complesso Universitario Monte Santangelo, Naples, Italy

    Flora Amato, Vincenzo Moscato, Antonio Picariello & Giancarlo Sperlí

Authors
  1. Flora Amato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vincenzo Moscato
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Picariello
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giancarlo Sperlí
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giancarlo Sperlí .

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Firat University, Elazig, Türkiye

    Mehmet Kaya

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Amato, F., Moscato, V., Picariello, A., Sperlí, G. (2019). Diffusion Algorithms in Multimedia Social Networks: A Novel Model. In: Kaya, M., Alhajj, R. (eds) Influence and Behavior Analysis in Social Networks and Social Media. ASONAM 2018. Lecture Notes in Social Networks. Springer, Cham. https://doi.org/10.1007/978-3-030-02592-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02592-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02591-5

  • Online ISBN: 978-3-030-02592-2

  • eBook Packages: Social SciencesSocial Sciences (R0)

Publish with us

Policies and ethics

Search

Navigation