[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2939672.2939758acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

When Social Influence Meets Item Inference

Published: 13 August 2016 Publication 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.
[2]
When social influence meets association rule learning. In CoRR (1502.07439), 2016.
[3]
R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In SIGMOD, 1993.
[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.
[5]
S. Bourigault, S. Lamprier, and P. Gallinari. Representation learning for information diffusion through social networks: an embedded cascade model. In WSDM, 2016.
[6]
S. Chen, J. Fan, G. Li, J. Feng, K. Tan, and J. Tang. Online topic-aware influence maximization. In VLDB, 2015.
[7]
W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, 2010.
[8]
E. Cho, S. A. Myers, and J. Leskovec. Friendship and mobility: user movement in location-based social networks. In KDD, 2011.
[9]
P. Domingos and M. Richardson. Mining the network value of customers. In KDD, 2001.
[10]
A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010.
[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.
[12]
J. Han, M. Kamber, and J. Pei. Data Mining: Concepts and Techniques. Morgan Kaufmann, 3rd Edition, 2011.
[13]
N. L. Hjort and M. C. Jones. Locally parametric nonparametric density estimation. In The Annals of Statistics, 1996.
[14]
R. V. Hogg and E. A. Tanis. Probability and statistical inference. Prentice Hall, 7th Edition, 2005.
[15]
R. Jones and K. Klinkner. Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In CIKM, 2008.
[16]
R. J. B. Jr. Efficiently mining long patterns from databases. In SIGMOD, 1998.
[17]
D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
[18]
H. Li, T. Cao, and Z. Li. Learning the information diffusion probabilities by using variance regularized em algorithm. In ASONAM, 2014.
[19]
J. Nail. The consumer advertising backlash, 2004. Forrester Research and Intelliseek Market Research Report.
[20]
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, 1999.
[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.
[22]
J. Tang, H. Gao, H. Liu, and A. D. Sarma. etrust: Understanding trust evolution in an online world. In KDD, 2012.
[23]
J. Tang, S. Wu, and J. Sun. Confluence: conformity influence in large social networks. In KDD, 2013.
[24]
Y. Tang, X. Xiao, and Y. Shi. Influence maximization: near-optimal time complexity meets practical efficiency. In SIGMOD, 2014.
[25]
H. Vahabi, I. K. F. Gullo, and M. Halkidi. Difrec: A social-diffusion-aware recommender system. In CIKM, 2015.
[26]
Z. Wen and C.-Y. Lin. On the quality of inferring interests from social neighbors. In KDD, 2010.
[27]
J. Yang and J. Leskovec. Modeling information diffusion in implicit networks. In ICDM, 2010.

Cited By

View all
  • (2022)Epidemic Spread Optimization for Disease Containment with NPIs and Vaccination2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00258(2845-2858)Online publication date: May-2022
  • (2021)Influence Maximization Based on Dynamic Personal Perception in Knowledge Graph2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00132(1488-1499)Online publication date: Apr-2021
  • (2021)Learning diffusion model-free and efficient influence function for influence maximization from information cascadesKnowledge and Information Systems10.1007/s10115-021-01556-6Online publication date: 19-Mar-2021
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

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
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 August 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. frequent pattern
  2. product recommendation
  3. viral marketing

Qualifiers

  • Research-article

Conference

KDD '16
Sponsor:

Acceptance Rates

KDD '16 Paper Acceptance Rate 66 of 1,115 submissions, 6%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)11
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Epidemic Spread Optimization for Disease Containment with NPIs and Vaccination2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00258(2845-2858)Online publication date: May-2022
  • (2021)Influence Maximization Based on Dynamic Personal Perception in Knowledge Graph2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00132(1488-1499)Online publication date: Apr-2021
  • (2021)Learning diffusion model-free and efficient influence function for influence maximization from information cascadesKnowledge and Information Systems10.1007/s10115-021-01556-6Online publication date: 19-Mar-2021
  • (2021)Activity Organization Queries for Location-Aware Heterogeneous Information NetworkDatabase Systems for Advanced Applications. DASFAA 2021 International Workshops10.1007/978-3-030-73216-5_20(283-304)Online publication date: 6-Apr-2021
  • (2020)Joint Topic-Semantic-aware Social Matrix Factorization for online voting recommendationKnowledge-Based Systems10.1016/j.knosys.2020.106433210(106433)Online publication date: Dec-2020
  • (2019)Non-Submodularity and Approximability: Influence Maximization in Online Social Networks2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)10.1109/WoWMoM.2019.8793017(1-9)Online publication date: Jun-2019
  • (2019)Social Influence Maximization in Hypergraph in Social NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28737596:4(801-811)Online publication date: 1-Oct-2019
  • (2019)Group Influence Maximization Problem in Social NetworksIEEE Transactions on Computational Social Systems10.1109/TCSS.2019.29385756:6(1156-1164)Online publication date: Dec-2019
  • (2019)Adopter Community Formation Accelerated by Repeaters of Product Advertisement CampaignsIEEE Transactions on Computational Social Systems10.1109/TCSS.2018.28836146:1(56-72)Online publication date: Feb-2019
  • (2019)Seed Selection and Social Coupon Allocation for Redemption Maximization in Online Social Networks2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00044(410-421)Online publication date: Apr-2019
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media