More Web Proxy on the site http://driver.im/

Article

Mining knowledge-sharing sites for viral marketing

Authors:

Matthew Richardson,

Pedro DomingosAuthors Info & Claims

KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining

Pages 61 - 70

https://doi.org/10.1145/775047.775057

Published: 23 July 2002 Publication History

Abstract

Viral marketing takes advantage of networks of influence among customers to inexpensively achieve large changes in behavior. Our research seeks to put it on a firmer footing by mining these networks from data, building probabilistic models of them, and using these models to choose the best viral marketing plan. Knowledge-sharing sites, where customers review products and advise each other, are a fertile source for this type of data mining. In this paper we extend our previous techniques, achieving a large reduction in computational cost, and apply them to data from a knowledge-sharing site. We optimize the amount of marketing funds spent on each customer, rather than just making a binary decision on whether to market to him. We take into account the fact that knowledge of the network is partial, and that gathering that knowledge can itself have a cost. Our results show the robustness and utility of our approach.

References

[1]

A.L. Barabási, R. Albert, and H. Jong. Scale-free characteristics of random networks: The topology of the World Wide Web. Physica A, 281:69--77, 2000.]]

[2]

S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the Seventh International World Wide Web Conference, Brisbane, Australia, 1998. Elsevier.]]

Digital Library

[3]

D.M. Chickering and D. Heckerman. A decision theoretic approach to targeted advertising. In Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence, Stanford, CA, 2000. Morgan Kaufmann.]]

Digital Library

[4]

P. Domingos and M. Pazanni. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29:103--130, 1997.]]

Digital Library

[5]

P. Domingos and M. Richardson. Mining the Network Value of Customers. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pages 57--66, San Francisco, CA, 2001. ACM Press.]]

Digital Library

[6]

M. Frauenfelder. Revenge of the know-it-alls: Inside the Web's free-advice revolution. Wired 8(7):144--158, 2000.]]

[7]

K. Gelbrich and R. Nakhaeizadeh. Value Miner: A data mining environment for the calculation of the customer lifetime value with application to the automotive industry. In Proceedings of the Eleventh European Conference on Machine Learning, pages 154--161, Barcelona, Spain, 2000. Springer.]]

Digital Library

[8]

R. A. Howard. Information value theory. IEEE Transactions on Systems Science and Cybernetics, SSC-2:22--26. 1966]]

[9]

A. M. Hughes. The Complete Database Marketer: Second- Generation Strategies and Techniques for Tapping the Power of you Customer Database. Irwin, Chicago, IL, 1996.]]

[10]

D. Iacobucci, editor. Networks in Marketing. Sage, Thousand Oaks, CA, 1996.]]

[11]

C. L. Isbell, Jr., M. Kearns, D. Korman, S. Singh, and P. Stone. Cobot in LambdaMOO: A social statistics agent. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 36--41, Austin, TX, 2000. AAAI Press.]]

Digital Library

[12]

D. R. Jackson. Strategic application of customer lifetime value in direct marketing. Journal of Targeting, Measurement and Analysis for Marketing, 1:9--17, 1994.]]

[13]

S. Jurvetson. What exactly is viral marketing? Red Herring, 78:110--112, 2000.]]

[14]

H. Kautz, B. Selman, and M. Shah. ReferralWeb: Combining social networks and collaborative filtering. Communications of the ACM, 40(3):63--66, 1997.]]

Digital Library

[15]

J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 668--677, Baltimore, MD, 1998. ACM Press.]]

Digital Library

[16]

D. Krackhardt. Structural leverage in marketing. In D. Iacobucci, editor, Networks in Marketing, pages 50--59. Sage, Thousand Oaks, CA, 1996.]]

[17]

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the Web. In Proceedings of the Twenty-Fifth International Conference on Very Large Databases, pages 639--650, Edinburgh, Scotland, 1999. Morgan Kaufmann.]]

Digital Library

[18]

C. X. Ling and C. Li. Data mining for direct marketing: Problems and solutions. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 73--79, New York, NY, 1998. AAAI Press.]]

[19]

D. R. Mani, J. Drew, A. Betz, and P. Datta. Statistics and data mining techniques for lifetime value modeling. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 94--103, New York, NY, 1999. ACM Press.]]

Digital Library

[20]

S. Milgram. The small world problem. Psychology Today, 2:60--67, 1967.]]

[21]

L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical Report, Stanford University, Stanford, CA. 1998.]]

[22]

G. Piatetsky-Shapiro and B. Masand. Estimating campaign benefits and modeling lift. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 185--193, San Diego, CA, 1999. ACM Press.]]

Digital Library

[23]

M. F. Schwartz and D. C. M. Wood. Discovering shared interests using graph analysis. Communications of the ACM, 36(8):78--80, 1993.]]

Digital Library

[24]

S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, UK, 1994.]]

[25]

G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, Boston, MA, 1949.]]

Cited By

Wang SLiu WChen LZong S(2025)Influence maximization based on discrete particle swarm optimization on multilayer networkInformation Systems10.1016/j.is.2024.102466127(102466)Online publication date: Jan-2025
https://doi.org/10.1016/j.is.2024.102466
Ferreira VPessoa AVidal T(2025)Influence optimization in networks: New formulations and valid inequalitiesComputers & Operations Research10.1016/j.cor.2024.106857173(106857)Online publication date: Jan-2025
https://doi.org/10.1016/j.cor.2024.106857
Zehmakan AZhou XZhang ZDastani MSichman JAlechina NDignum V(2024)Viral Marketing in Social Networks with Competing ProductsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663069(2047-2056)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663069
Show More Cited By

Index Terms

Mining knowledge-sharing sites for viral marketing

Recommendations

Mining the network value of customers
KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining

One of the major applications of data mining is in helping companies determine which potential customers to market to. If the expected profit from a customer is greater than the cost of marketing to her, the marketing action for that customer is ...
Mining customer knowledge for direct selling and marketing

Research highlights Direct marketing is an effective marketing method. Direct marketing could provide exclusive products and services for specific consumers. This study analyzes consumer adumbration, lifestyle habits and purchasing behavior using data ...
Research Note Consumer Addressability and Customized Pricing

The increasing availability of customer information is giving many firms the ability to reach and customize price and other marketing efforts to the tastes of the individual consumer. This ability is labeled as consumer addressability. Consumer ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining

July 2002

719 pages

ISBN:158113567X

DOI:10.1145/775047

Conference Chair:
Osmar R. Zaïane
University of Alberta, Canada
,
General Chair:
Randy Goebel
University of Alberta, Canada
,
Program Chairs:
David Hand
Imperial College, UK
,
Daniel Keim
AT&T
,
Raymond Ng
University of British Columbia, Canada

Copyright © 2002 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

KDD02

Sponsor:

KDD02: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

July 23 - 26, 2002

Alberta, Edmonton, Canada

Acceptance Rates

KDD '02 Paper Acceptance Rate 44 of 307 submissions, 14%;

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Sponsor:
sigkdd
sigkdd

The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 3 - 7, 2025

Toronto , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,111
Total Citations
View Citations
7,255
Total Downloads

Downloads (Last 12 months)109
Downloads (Last 6 weeks)11

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang SLiu WChen LZong S(2025)Influence maximization based on discrete particle swarm optimization on multilayer networkInformation Systems10.1016/j.is.2024.102466127(102466)Online publication date: Jan-2025
https://doi.org/10.1016/j.is.2024.102466
Ferreira VPessoa AVidal T(2025)Influence optimization in networks: New formulations and valid inequalitiesComputers & Operations Research10.1016/j.cor.2024.106857173(106857)Online publication date: Jan-2025
https://doi.org/10.1016/j.cor.2024.106857
Zehmakan AZhou XZhang ZDastani MSichman JAlechina NDignum V(2024)Viral Marketing in Social Networks with Competing ProductsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663069(2047-2056)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663069
ARASAWA KMATSUKAWA SSUGIO NTAKAHARA MHATTORI S(2024)Bookmarking Forecast and its Factor Analysis of Social Network Users Based on Gradient Boosting Decision Tree勾配ブースティング決定木に基づくソーシャルネットワーク利用者のお気に入り登録予測およびその要因分析Transactions of Japan Society of Kansei Engineering10.5057/jjske.TJSKE-D-24-00018Online publication date: 2024
https://doi.org/10.5057/jjske.TJSKE-D-24-00018
Agra ASamuco J(2024)A New Algorithm Framework for the Influence Maximization Problem Using Graph ClusteringInformation10.3390/info1502011215:2(112)Online publication date: 14-Feb-2024
https://doi.org/10.3390/info15020112
Han ZShi LLiu LJiang LFang JLin FZhang JPanneerselvam JAntonopoulos N(2024)A Survey on Event Tracking in Social Media Data StreamsBig Data Mining and Analytics10.26599/BDMA.2023.90200217:1(217-243)Online publication date: Mar-2024
https://doi.org/10.26599/BDMA.2023.9020021
Rajeh SCherifi H(2024)On the role of diffusion dynamics on community-aware centrality measuresPLOS ONE10.1371/journal.pone.030656119:7(e0306561)Online publication date: 18-Jul-2024
https://doi.org/10.1371/journal.pone.0306561
Wang ZZhao JSun CRui XYu P(2024)A General Concave Fairness Framework for Influence Maximization Based on Poverty RewardACM Transactions on Knowledge Discovery from Data10.1145/370173719:1(1-23)Online publication date: 28-Oct-2024
https://dl.acm.org/doi/10.1145/3701737
Xie JZhang SLiu CZhan X(2024)Fair Influence Maximization in HypergraphsProceedings of the Third International Workshop on Social and Metaverse Computing, Sensing and Networking10.1145/3698387.3699995(8-14)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3698387.3699995
Zareie ASakellariou R(2024)Fuzzy Influence Maximization in Social NetworksACM Transactions on the Web10.1145/365017918:3(1-28)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1145/3650179
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents