Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1458082.1458115acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Mining social networks using heat diffusion processes for marketing candidates selection

Published: 26 October 2008 Publication History

Abstract

Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social network marketing and the potential candidates that can thus be marketed to certainly offer lucrative opportunities for prospective sellers. Due to the complexity of social networks, few models exist to interpret social network marketing realistically. We propose to model social network marketing using Heat Diffusion Processes. This paper presents three diffusion models, along with three algorithms for selecting the best individuals to receive marketing samples. These approaches have the following advantages to best illustrate the properties of real-world social networks: (1) We can plan a marketing strategy sequentially in time since we include a time factor in the simulation of product adoptions; (2) The algorithm of selecting marketing candidates best represents and utilizes the clustering property of real-world social networks; and (3) The model we construct can diffuse both positive and negative comments on products or brands in order to simulate the complicated communications within social networks. Our work represents a novel approach to the analysis of social network marketing, and is the first work to propose how to defend against negative comments within social networks. Complexity analysis shows our model is also scalable to very large social networks.

References

[1]
R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, 2002.
[2]
R. Albert, H. Jeong, and A.-L. Barabási. Diameter of the world wide web. Nature, 401:130--131, 1999.
[3]
A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.
[4]
F. Bass. A new product growth model for consumer durables. Management Science, 15:215--227, 1969.
[5]
M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373--1396, 2003.
[6]
J. Brown and P. Reinegen. Social ties and word-of-mouth referral behavior. Journal of Consumer Research, 14(3):350--362, 1987.
[7]
J. Coleman, H. Menzel, and E. Katz. Medical Innovations: A Diffusion Study. Bobbs Merrill, 1966.
[8]
P. Domingos. Mining social networks for viral marketing. IEEE Intelligent Systems, 20(1):80--82, 2005.
[9]
P. Domingos and M. Richardson. Mining the network value of customers. In Proc. of the ACM SIGKDD Conf., pages 57--66, 2001.
[10]
J. Goldenberg, B. Libai, and E. Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 12(3):211--223, 2001.
[11]
R. V. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In Proc. of the ACM WWW Conf., pages 403--412, 2004.
[12]
J. D. Hartline, V. S. Mirrokni, and M. Sundararajan Optimal marketing strategies over social networks. In Proc. of the ACM WWW Conf., pages 189--198, 2008.
[13]
D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proc. of the ACM SIGKDD Conf., pages 137--146, 2003.
[14]
J. Kleinberg. Authoritative sources in a hyperlinked environment. In Proc. of the ACM-SIAM SODA Conf., pages 668--677, 1998.
[15]
J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of ACM, 46(5):604--632, 1999.
[16]
R. I. Kondor and J. D. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In Proc. of ICML Conf., pages 315--322, 2002.
[17]
J. D. Lafferty and G. Lebanon. Diffusion kernels on statistical manifolds. Journal of Machine Learning Research, 6:129--163, 2005.
[18]
J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Transactions on the Web, 1(1), 2007.
[19]
V. Mahajan, E. Muller, and F. Bass. New product diffusion models in marketing: A review and directions for research. Journal of Marketing, 54(1):1--26, 1999.
[20]
M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In Proc. of the ACM SIGKDD Conf., pages 61--70, 2002.
[21]
E. M. Rogers. Diffusion of Innovations (5th ed.). Free Press, New York, 2003.
[22]
X. Song, Y. Chi, K. Hino, and B. L. Tseng. Information flow modeling based on diffusion rate for prediction and ranking. In Proc. of the ACM WWW Conf., pages 191--200, 2007.
[23]
X. Song, B. L. Tseng, C.-Y. Lin, and M.-T. Sun. Personalized recommendation driven by information flow. In Proc. of the ACM SIGIR Conf., pages 509--516, 2006.
[24]
M. R. Subramani and B. Rajagopalan. Knowledge-sharing and influence in online social networks via viral marketing. Communications of the ACM, 46(12):300--307, 2003.
[25]
T. Valente. Network Models of the Diffusion of Innovations. Hampto Press, 1995.
[26]
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, UK, 1994.
[27]
D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440--442, 1998.
[28]
H. Yang, I. King, and M. R. Lyu. DiffusionRank: a possible penicillin for Web spamming. In Proc. of the ACM SIGIR Conf., pages 431--438, 2007.

Cited By

View all

Index Terms

  1. Mining social networks using heat diffusion processes for marketing candidates selection

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management
      October 2008
      1562 pages
      ISBN:9781595939913
      DOI:10.1145/1458082
      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: 26 October 2008

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. heat diffusion
      2. marketing
      3. social network

      Qualifiers

      • Research-article

      Conference

      CIKM08
      CIKM08: Conference on Information and Knowledge Management
      October 26 - 30, 2008
      California, Napa Valley, USA

      Acceptance Rates

      Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

      Upcoming Conference

      CIKM '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)48
      • Downloads (Last 6 weeks)5
      Reflects downloads up to 24 Dec 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Heat Kernel of Networks with Long-Range InteractionsComplexity10.1155/2024/67459052024Online publication date: 1-Jan-2024
      • (2024)Let the Information Fly: Reconstructing Social Network After a Node DeletedIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.330348836:3(1198-1209)Online publication date: 1-Mar-2024
      • (2024)OlapGN: A multi-layered graph convolution network-based model for locating influential nodes in graph networksKnowledge-Based Systems10.1016/j.knosys.2023.111163283(111163)Online publication date: Jan-2024
      • (2023)A Community-Aware Framework for Social Influence MaximizationIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2023.32513627:4(1253-1262)Online publication date: Aug-2023
      • (2023)CTL-DIFF: Control Information Diffusion in Social Network by Structure OptimizationIEEE Transactions on Computational Social Systems10.1109/TCSS.2022.316573910:3(1115-1129)Online publication date: Jun-2023
      • (2023)Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networksCAAI Transactions on Intelligence Technology10.1049/cit2.121588:3(893-913)Online publication date: 23-Jan-2023
      • (2023)Efficient community-based influence maximization in large-scale social networksMultimedia Tools and Applications10.1007/s11042-023-17025-x83:15(44397-44424)Online publication date: 18-Oct-2023
      • (2023)Local dampening: differential privacy for non-numeric queries via local sensitivityThe VLDB Journal10.1007/s00778-022-00774-w32:6(1191-1214)Online publication date: 10-Jan-2023
      • (2022)Predicting adverse drug effects: A heterogeneous graph convolution network with a multi-layer perceptron approachPLOS ONE10.1371/journal.pone.026643517:12(e0266435)Online publication date: 14-Dec-2022
      • (2022)Explainability and Graph Learning From Social InteractionsIEEE Transactions on Signal and Information Processing over Networks10.1109/TSIPN.2022.32238058(946-959)Online publication date: 2022
      • 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