ACM Home Page
Please provide us with feedback. Feedback
Mining knowledge-sharing sites for viral marketing
Full text PdfPdf (943 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Edmonton, Alberta, Canada
SESSION: Graphs and trees table of contents
Pages: 61 - 70  
Year of Publication: 2002
ISBN:1-58113-567-X
Authors
Matthew Richardson  University of Washington, Seattle, WA
Pedro Domingos  University of Washington, Seattle, WA
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
: AAAI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 49,   Downloads (12 Months): 440,   Citation Count: 48
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775047.775057
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
3
 
4
5
 
6
M. Frauenfelder. Revenge of the know-it-alls: Inside the Web's free-advice revolution. Wired 8(7):144--158, 2000.
 
7
 
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
 
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
 
15
 
16
D. Krackhardt. Structural leverage in marketing. In D. Iacobucci, editor, Networks in Marketing, pages 50--59. Sage, Thousand Oaks, CA, 1996.
 
17
 
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
 
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
23
 
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  48

Collaborative Colleagues:
Matthew Richardson: colleagues
Pedro Domingos: colleagues