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.
Keywords
Affiliated Institutions
Related Publications
Mining the network value of customers
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...
Finding community structure in very large networks
The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsui...
A model, analysis, and protocol framework for soft state-based communication
"Soft state" is an often cited yet vague concept in network protocol design in which two or more network entities intercommunicate in a loosely coupled, often anonymous fashion....
Developing a framework to assess the costeffectiveness of COMPARE – a global platform for the exchange of sequence-based pathogen data
Analysing the genomic data of pathogens with the help of next-generation sequencing (NGS) is an increasingly important part of disease outbreak investigations and helps guide re...
Translating embeddings for modeling multi-relational data
We consider the problem of embedding entities and relationships of multi-relational data in low-dimensional vector spaces. Our objective is to propose a canonical model which is...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 61-70
- Citations
- 1612
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1145/775047.775057