496
Views
38
CrossRef citations to date
0
Altmetric
Original Articles

Interactive Mining of Strong Friends from Social Networks and Its Applications in E-Commerce

, &

REFERENCES

  • Agarwal, N. and H. Liu. 2009. Modeling and Data Mining in Blogosphere. San Hafael, CA: Morgan and Claypool Publishers.
  • Agrawal, R., T. Imieliński, and A. Swami. 1993. “Mining association rules between sets of items in large databases. ” In Proc. ACM SIGMOD 1993 (pp.207–216).
  • Arnaboldi, V., M. Conti, A. Passarella, and F. Pezzoni. 2012. “Analysis of ego network structure in online social networks. ” In Proc. ASE/IEEE SocialCom and PASSAT 2012 (pp.31–40).
  • Bródka, P., S. Saganowski, and P. Kazienko. 2013. “GED: The method for group evolution discovery in social networks. ”Social Network Analysis and Mining 3(1):1–14.
  • Cameron, J. J., C. K. Leung, and S. K. Tanbeer. 2011. “Finding strong groups of friends among friends in social networks. ” In Proc. IEEE DASC (SCA) 2011 (pp.824–831).
  • Carrington, P. J., J. Scott, and S. Wasserman, Eds. 2005. Models and Methods in Social Network Analysis. Cambridge, UK: Cambridge University Press.
  • Chang, Y., X. Wang, Q. Mei, and Y. Liu. 2013. “Towards Twitter context summarization with user influence models. ” In Proc. ACM WSDM 2013 (pp.527–536).
  • Dai, B. T., A. T. Kwee, and E.-P. Lim. 2013. “ViStruclizer: A structural visualizer for multi-dimensional social networks.” In Proc. PAKDD 2013, Part I. LNAI 7818 (pp.49–60).
  • Du, J., F. Zhu, and E.-P. Lim. 2013. “Dynamic label propagation in social networks.” In Proc. DASFAA 2013, Part II. LNCS 7826 (pp.194–209).
  • Gonzalez, R., R. Cuevas, R. Motamedi, R. Rejaie, and Á. Cuevas. 2013. “Google+ or Google–?: Dissecting the evolution of the new OSN in its first year.” In Proc. WWW 2013 (pp.483–494).
  • Han, J., J. Pei, and Y. Yin. 2000. “Mining frequent patterns without candidate generation. ” In Proc. ACM SIGMOD 2000 (pp.1–12).
  • Hemsley, J. and R. M. Mason. 2013. “Knowledge and knowledge management in the social media age. ”Journal of Organizational Computing and Electronic Commerce 23(1–2):138–167.
  • Jiang, F., C. K. Leung, and S. K. Tanbeer. 2012a. “Finding popular friends in social networks. ” In Proc. CGC (SCA) 2012 (pp.501–508).
  • Jiang, L., L. Ding, J. Liu, and J. Chen. 2012b. “Reputation rating modeling for open environment lack of communication by using online social cognition. ”Journal of Network and Computer Applications 35(3):881–891.
  • Lee, W., C. K. Leung, J. J. Song, and C. S.-H. Eom. 2012. “A network-flow based influence propagation model for social networks. ” In Proc. CGC (SCA) 2012 (pp.601–608).
  • Leung, C. K. and C. L. Carmichael. 2010. “Exploring social networks: A frequent pattern visualization approach.” In Proc. IEEE SocialCom and IEEE PASSAT 2010 (pp.419–424).
  • Leung, C. K., C. L. Carmichael, and E. W. Teh. 2011. “Visual analytics of social networks: Mining and visualizing co-authorship networks.” In Proc. HCII (FAC) 2011. LNAI 6780 (pp.335–345).
  • Leung, C. K. and S. K. Tanbeer. 2012. “Mining social networks for significant friend groups.” In Proc. DASFAA Workshops (SNSM) 2012. LNCS 7240 (pp.180–192).
  • Li, Y.-C., J.-S., Yeh, and C.-C., Chang. 2005a. “A fast algorithm for mining share-frequent itemsets.” In Proc. APWeb 2005. LNCS 3399 (pp.417–428).
  • Li, Y.-C., J.-S., Yeh, and C.-C., Chang. 2005b. “Direct candidates generation: A novel algorithm for discovering complete share-frequent itemsets.” In Proc. FSKD 2005, Part II. LNAI 3614 (pp.551–560).
  • Liu, H., P. S. Yu, N. Agarwal, and T. Suel. 2010. “Guest editors’ introduction: Social computing in the blogosphere. ” IEEE Internet Computing 14(2):12–14.
  • Meng, Q. and P. J. Kennedy. 2012. “ Using field of research codes to discover research groups from co-authorship networks. ” In Proc. IEEE/ACM ASONAM 2012 (pp.289–293).
  • Negi, S. and S. Chaudhury. 2012. “Predicting user-to-content links in Flickr groups. ” In Proc. IEEE/ACM ASONAM 2012 (pp.124–131).
  • Paul, T., M. Stopczynski, D. Puscher, M. Volkamer, and T. Strufe. 2012. “C4PS—Helping Facebookers manage their privacy settings.” In Proc. SocInfo 2012. LNCS 7710 (pp.188–201).
  • Sumbaly, R., J. Kreps, and S. Shah. 2013. “The big data ecosystem at LinkedIn. ” In Proc. ACM SIGMOD 2013 (pp.1125–1134).
  • Sun, S., H. Liu, J. He, and X. Du. 2013. “Detecting event rumors on Sina Weibo automatically.” In Proc. APWeb 2013. LNCS 7808 (pp.120–131).
  • Talukdera, M. and A. Quazia. 2011. “The impact of social influence on individuals’ adoption of innovation. ”Journal of Organizational Computing and Electronic Commerce 21(2):111–135.
  • Tanbeer, S. K., F. Jiang, C. K. Leung, R. K. MacKinnon, and I. J. M. Medina. 2013. “Finding groups of friends who are significant across multiple domains in social networks. ” In Proc. CASoN 2013 (pp.21–26).
  • Tanbeer, S. K. and C. K. Leung. 2013. “Finding diverse friends in social networks.” In Proc. APWeb 2013. LNCS 7808 (pp.301–309).
  • Tanbeer, S. K., C. K. Leung, and J. J. Cameron. 2012. “DIFSoN: Discovering influential friends from social networks.” In Proc. CASoN 2012 (pp.120–125).
  • Tang, J. and H. Liu. 2012. “Unsupervised feature selection for linked social media data. ” In Proc. ACM KDD 2012 (pp.904–912).
  • Turban, E., N. Bolloju, and T.-P. Liang. 2011. “Enterprise social networking: Opportunities, adoption, and risk mitigation. ” Journal of Organizational Computing and Electronic Commerce 21(3):202–220.
  • van Laere, O., S. Schockaert, and B. Dhoedt. 2013. “Georeferencing Flickr resources based on textual meta-data. ” Information Sciences 238:52–74.
  • Wasserman, S. and K. Faust. 1994. Social Network Analysis: Methods and Applications. Cambridge, UK: Cambridge University Press.
  • Xu, H., Y. Yang, L. Wang, and W. Liu. 2013. “Node classification in social network via a factor graph model.” In Proc. PAKDD 2013, Part I. LNAI 7818 (pp.213–224).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.