skip to main content
10.1145/2939672.2939758acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

When Social Influence Meets Item Inference

Published:13 August 2016Publication History

ABSTRACT

Research issues and data mining techniques for product recommendation and viral marketing have been widely studied. Existing works on seed selection in social networks do not take into account the effect of product recommendations in e-commerce stores. In this paper, we investigate the seed selection problem for viral marketing that considers both effects of social influence and item inference (for product recommendation). We develop a new model, Social Item Graph (SIG), that captures both effects in the form of hyperedges. Accordingly, we formulate a seed selection problem, called Social Item Maximization Problem (SIMP), and prove the hardness of SIMP. We design an efficient algorithm with performance guarantee, called Hyperedge-Aware Greedy (HAG), for SIMP and develop a new index structure, called SIG-index, to accelerate the computation of diffusion process in HAG. Moreover, to construct realistic SIG models for SIMP, we develop a statistical inference based framework to learn the weights of hyperedges from data. Finally, we perform a comprehensive evaluation on our proposals with various baselines. Experimental result validates our ideas and demonstrates the effectiveness and efficiency of the proposed model and algorithms over baselines.

References

  1. The Douban dataset download. http://arbor.ee.ntu.edu.tw/~hhshuai/Douban.tar.bz2.Google ScholarGoogle Scholar
  2. When social influence meets association rule learning. In CoRR (1502.07439), 2016.Google ScholarGoogle Scholar
  3. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In SIGMOD, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. M. Bond, C. J. Fariss, J. J. Jones, A. D. Kramer, C. Marlow, J. E. Settle, and J. H. Fowler. A 61-million-person experiment in social influence and political mobilization. Nature, 2012.Google ScholarGoogle Scholar
  5. S. Bourigault, S. Lamprier, and P. Gallinari. Representation learning for information diffusion through social networks: an embedded cascade model. In WSDM, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Chen, J. Fan, G. Li, J. Feng, K. Tan, and J. Tang. Online topic-aware influence maximization. In VLDB, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. E. Cho, S. A. Myers, and J. Leskovec. Friendship and mobility: user movement in location-based social networks. In KDD, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Domingos and M. Richardson. Mining the network value of customers. In KDD, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Goyal, W. Lu, and L. V. S. Lakshmanan. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model. In ICDM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Han, M. Kamber, and J. Pei. Data Mining: Concepts and Techniques. Morgan Kaufmann, 3rd Edition, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. L. Hjort and M. C. Jones. Locally parametric nonparametric density estimation. In The Annals of Statistics, 1996.Google ScholarGoogle Scholar
  14. R. V. Hogg and E. A. Tanis. Probability and statistical inference. Prentice Hall, 7th Edition, 2005.Google ScholarGoogle Scholar
  15. R. Jones and K. Klinkner. Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In CIKM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. J. B. Jr. Efficiently mining long patterns from databases. In SIGMOD, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Li, T. Cao, and Z. Li. Learning the information diffusion probabilities by using variance regularized em algorithm. In ASONAM, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  19. J. Nail. The consumer advertising backlash, 2004. Forrester Research and Intelliseek Market Research Report.Google ScholarGoogle Scholar
  20. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. B. W. Silverman, M. C. Jones, J. D. Wilson, and D. W. Nychka. A smoothed em approach to indirect estimation problems, with particular, reference to stereology and emission tomography. Journal of the Royal Statistical Society. Series B (Methodological), 1990.Google ScholarGoogle Scholar
  22. J. Tang, H. Gao, H. Liu, and A. D. Sarma. etrust: Understanding trust evolution in an online world. In KDD, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Tang, S. Wu, and J. Sun. Confluence: conformity influence in large social networks. In KDD, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Y. Tang, X. Xiao, and Y. Shi. Influence maximization: near-optimal time complexity meets practical efficiency. In SIGMOD, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. H. Vahabi, I. K. F. Gullo, and M. Halkidi. Difrec: A social-diffusion-aware recommender system. In CIKM, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Z. Wen and C.-Y. Lin. On the quality of inferring interests from social neighbors. In KDD, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. J. Yang and J. Leskovec. Modeling information diffusion in implicit networks. In ICDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. When Social Influence Meets Item Inference

      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
      • Published in

        cover image ACM Conferences
        KDD '16: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
        August 2016
        2176 pages
        ISBN:9781450342322
        DOI:10.1145/2939672

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 August 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        KDD '16 Paper Acceptance Rate66of1,115submissions,6%Overall Acceptance Rate1,133of8,635submissions,13%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader