Advertisement

Big Data Analytics of Social Network Data: Who Cares Most About You on Facebook?

  • Carson K. LeungEmail author
  • Fan Jiang
  • Tik Wai Poon
  • Paul-Émile Crevier
Chapter
First Online:
Part of the Studies in Big Data book series (SBD, volume 27)

Abstract

In recent years, many people are connected with each other via social networking sites such as Facebook, Google+, LinkedIn, Twitter, and Weibo. Many users on these social networking sites actively add posts or tweets so that they share their activities with their friends or connections. This leads to big social network data. For many of these creators of social network data (i.e., users on the social networking sites), it is not unusual for them to have hundreds or even thousands of friends or connections. Among these friends or connections, some of them care about the users by responding to the users’ posts or tweets (e.g., like these posts, add comments to the posts, or retweet the tweets) while some other are lurkers who just observe do not actively participate in any social network activities. How to distinguish those who care about you from those lurkers? To answer this question, we present in this book chapter big data management and analytics techniques on social network data. Specifically, our techniques help users discover friends or connections who cares most about them on social networking sites such as Facebook.

Keywords

Social Network Data Primary Users Frequent Pattern Mining Association Rules Friendly Interaction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

This project is partially supported by Natural Sciences and Engineering Research Council of Canada (NSERC) and University of Manitoba.

References

  1. 1.
    Aggarwal R, Srikant R. Fast algorithms for mining association rules. In: VLDB 1994; 1994. p. 487–99.Google Scholar
  2. 2.
    Bayrak AE, Polat F. Examining place categories for link prediction in location based social networks. In: IEEE/ACM ASONAM 2016; 2016. p. 976–79.Google Scholar
  3. 3.
    Cuzzocrea A, Folino F, Pizzuti C. DynamicNet: an effective and efficient algorithm for supporting community evolution detection in time-evolving information networks. In: IDEAS 2013; 2013. p. 148–53.Google Scholar
  4. 4.
    Dai BT, Kwee AT, Lim EP. ViStruclizer: a structural visualizer for multi-dimensional social networks. In: PAKDD 2013, Part I. LNCS (LNAI), vol. 7818; 2013. p. 49–60.Google Scholar
  5. 5.
    del Carmen Contreras Chinchilla L, Ferreira KAR. Analysis of the behavior of customers in the social networks using data mining techniques. In: IEEE/ACM ASONAM 2016; 2016. p. 623–25.Google Scholar
  6. 6.
    Ferrara A, Genta L, Montanelli S. Linked data classification: a feature-based approach. In: EDBT/ICDT workshops 2013; 2013. p. 75–82.Google Scholar
  7. 7.
    Fowkes JM, Sutton CA. A subsequence interleaving model for sequential pattern mining. In: ACM KDD 2016; 2016. p. 835–44.Google Scholar
  8. 8.
    Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000; 2000. p. 1–12.Google Scholar
  9. 9.
    Jiang F, Leung CK. A business intelligence solution for frequent pattern mining on social networks. In: IEEE ICDM workshops 2014; 2014. p. 789–96.Google Scholar
  10. 10.
    Jiang F, Leung CK. Mining interesting “following” patterns from social networks. In: DaWaK 2014. LNCS, vol. 8646; 2014. p. 308–19.Google Scholar
  11. 11.
    Jiang F, Leung CK, Tanbeer SK. Finding popular friends in social networks. In: CGC 2012; 2012. p. 501–08.Google Scholar
  12. 12.
    Jiang F, Leung CK, Liu D, Peddle AM. Discovery of really popular friends from social networks. In: IEEE BDCloud 2014; 2014. p. 342–49.Google Scholar
  13. 13.
    Jiang F, Leung CK, Zhang H. B-mine: frequent pattern mining and its application to knowledge discovery from social networks. In: APWeb 2016, Part I. LNCS. vol. 9931; 2016. p. 316–28.Google Scholar
  14. 14.
    Leung CK, Carmichael CL. Exploring social networks: a frequent pattern visualization approach. In: IEEE SocialCom 2010; 2010. p. 419–24.Google Scholar
  15. 15.
    Leung CK, Carmichael CL, Teh EW. Visual analytics of social networks: mining and visualizing co-authorship networks. In: FAC 2011, part of HCII 2011. LNCS (LNAI), vol. 6780; 2011. p. 335–45Google Scholar
  16. 16.
    Leung CK, Jiang F. Big data analytics of social networks for the discovery of “following” patterns. In: DaWaK 2015. LNCS, vol. 9263; 2015. p. 123–35.Google Scholar
  17. 17.
    Leung CK, Medina IJM, Tanbeer SK. Analyzing social networks to mine important friends. In: Xu G, Li L, editors.Social media mining and social network analysis: emerging research. Hershey: IGI Publishing; 2013. p. 90–104.Google Scholar
  18. 18.
    Leung CK, Tanbeer SK, Cameron JJ. Interactive discovery of influential friends from social networks. Soc Netw Anal Min. 2014;4(1), art. 154:13p.Google Scholar
  19. 19.
    Leung CK, Dela Cruz EM, Cook TL, Jiang F. Mining ‘following’ patterns from big sparse social networks. In: IEEE/ACM ASONAM 2016; 2016. p. 923–30.Google Scholar
  20. 20.
    Leung CK, Jiang F, Pazdor AGM, Peddle AM. Parallel social network mining for interesting ‘following’ patterns. Concurrency Comput Pract Exp. 2016;28(15):3994–4012.CrossRefGoogle Scholar
  21. 21.
    Lin JC, Gan W, Fournier-Viger P, Hong T. Mining weighted frequent itemsets with the recency constraint. In: APWeb 2015. LNCS, vol. 9313; 2015. p. 635–46.Google Scholar
  22. 22.
    Meng Q, Kennedy PJ. Using field of research codes to discover research groups from co-authorship networks. In: IEEE/ACM ASONAM 2012; 2012. p. 289–93.Google Scholar
  23. 23.
    Mungen AA, Kaya M. Mining quad closure patterns in Instagram. In: IEEE/ACM ASONAM 2016; 2016. p. 939–44.Google Scholar
  24. 24.
    Musciotto F, Delpriori S, Castagno P, Pournaras E. Mining social interactions in privacy-preserving temporal networks. In: IEEE/ACM ASONAM 2016; 2016. p. 1103–10.Google Scholar
  25. 25.
    Nakagawa K, Suzumura S, Karasuyama M, Tsuda K, Takeuchi I. Safe pattern pruning: an efficient approach for predictive pattern mining. In: ACM KDD 2016; 2016. p. 1785–94.Google Scholar
  26. 26.
    Pei J, Han J, Lu H, Nishio S, Tang S, Yang D. H-Mine: hyper-structure mining of frequent patterns in large databases. In: IEEE ICDM 2001; 2001. p. 441–48.Google Scholar
  27. 27.
    Pernelle N, Saïs F. Classification rule learning for data linking. In: EDBT/ICDT workshops 2012; 2012, p. 136–39.Google Scholar
  28. 28.
    Schaal M, O’Donovan J, Smyth B. An analysis of topical proximity in the twitter social graph. In: SocInfo 2012. LNCS, vol. 7710; 2012. p. 232–45.Google Scholar
  29. 29.
    Shenoy P, Bhalotia JR, Bawa M, Shah D. Turbo-charging vertical mining of large databases. In: ACM SIGMOD 2000; 2000, p. 22–33.Google Scholar
  30. 30.
    Tanbeer SK, Jiang F, Leung CK, MacKinnon RK, Medina IJM. Finding groups of friends who are significant across multiple domains in social networks. In: CASoN 2013; 2013. p. 21–6.Google Scholar
  31. 31.
    Tanbeer SK, Leung CK, Cameron JJ. Interactive mining of strong friends from social networks and its applications in e-commerce. J Organ Comput Electron Commer. 2014; 24(2–3):157–73.Google Scholar
  32. 32.
    Tang J, Liu H. Unsupervised feature selection for linked social media data. In: ACM KDD 2012; 2012. p. 904–12.Google Scholar
  33. 33.
    Thovex C. Hidden social networks analysis by semantic mining of noisy corpora. In: IEEE/ACM ASONAM 2016; 2016. p. 868–75.Google Scholar
  34. 34.
    Wang K, Tang L, Han J, Liu J. Top down FP-growth for association rule mining. In: PAKDD 2002. LNCS (LNAI), vol. 2336; 2002, p. 334–40.Google Scholar
  35. 35.
    Xu H, Yang Y, Wang L, Liu W. Node classification in social network via a factor graph model. In: PAKDD 2013, Part I. LNCS (LNAI), vol. 7818; 2013. p. 213–24.Google Scholar
  36. 36.
    Xu K, Zou K, Huang Y, Yu X, Zhang X. Mining community and inferring friendship in mobile social networks. Neurocomputing. 2016; 174:605–16.CrossRefGoogle Scholar
  37. 37.
    Yang X, Ghoting A, Ruan Y, Parthasarathy S. A framework for summarizing and analyzing Twitter feeds. In: ACM KDD 2012; 2012. p. 370–78.Google Scholar
  38. 38.
    Yuan Q, Cong G, Ma Z, Sun A, Magnenat-Thalmann N. Who, where, when and what: discover spatio-temporal topics for twitter users. In: ACM KDD 2013; 2013. p. 605–13.Google Scholar
  39. 39.
    Zafarani R, Abbasi MA, Liu H. Social media mining: an introduction. New York: Cambridge University Press; 2014.CrossRefGoogle Scholar
  40. 40.
    Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans Knowl Data Eng. 2000; 12(3):372–90.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Carson K. Leung
    • 1
    Email author
  • Fan Jiang
    • 1
  • Tik Wai Poon
    • 1
  • Paul-Émile Crevier
    • 1
  1. 1.University of ManitobaWinnipegCanada

Personalised recommendations

Cite chapter

Buy options