Proceedings Article10.1145/502512.502525
Mining the network value of customers
Pedro Domingos,Matthew Richardson +1 more
- 26 Aug 2001
- pp 57-66
TL;DR: It is proposed to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively, taking advantage of the availability of large relevant databases.
read more
Abstract: 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 executed. So far, work in this area has considered only the intrinsic value of the customer (i.e, the expected profit from sales to her). We propose to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively. Instead of viewing a market as a set of independent entities, we view it as a social network and model it as a Markov random field. We show the advantages of this approach using a social network mined from a collaborative filtering database. Marketing that exploits the network value of customers---also known as viral marketing---can be extremely effective, but is still a black art. Our work can be viewed as a step towards providing a more solid foundation for it, taking advantage of the availability of large relevant databases.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Methods for Finding Interesting Nodes in Weighted Graphs
Laura Langohr
- 30 Jun 2014
TL;DR: This thesis proposes to consider nodes as interesting based on their relevance and non-redundancy or representativeness w.r.t. the graph topology, as well asbased on their characterisation for a class, such as a given node attribute value.
12
Identifying multiple influential spreaders based on maximum connected component decomposition method
TL;DR: The maximum connected component decomposition method (MCCD) is proposed to identify influential spreaders in complex networks and can identify initial spreaders that are not the highest ranking but have great impacts on the network, including the spreading speed, propagation range, and distribution range of initial spreader.
12
Spotting trendsetters: Inference for network games
Randall A. Berry,Vijay G. Subramanian +1 more
- 01 Oct 2012
TL;DR: This work considers the problem of inferring early adopters or first movers given a snap shot of the adoption state at a given time in an underlying network model and presents some results on solving this problem in the low temperature regime.
•Dissertation
Towards a Data-driven Approach for Agent-Based Modelling: Simulating Spanish Postmodernisation
Samer Hassan
- 19 Jan 2010
TL;DR: This methodology attempts to guide the injection of empirical data into the simulation, bringing them closer to the real phenomenon under study, while acknowledging the important role of theory in the whole process.
12
Beyond worst-case (In)approximability of nonsubmodular influence maximization
Grant Schoenebeck,Biaoshuai Tao +1 more
- 17 Dec 2017
TL;DR: This paper studies whether this worst-case hardness result can be circumvented by making assumptions about either the underlying network topology or the cascade model, motivated by many real life social network cascades.
12
References
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Stuart Geman,Donald Geman +1 more
TL;DR: The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
•Book
Social Network Analysis: Methods and Applications
Stanley Wasserman,Katherine Faust +1 more
- 25 Nov 1994
TL;DR: This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of Dyadic and Triadic Interaction Models, which describes the relationships between actor and group measures and the structure of networks.
18.9K
The anatomy of a large-scale hypertextual Web search engine
Sergey Brin,Lawrence Page +1 more
- 01 Apr 1998
TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
•Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
13.3K
Related Papers (5)
David Kempe,Jon Kleinberg,Éva Tardos +2 more
- 24 Aug 2003
Wei Chen,Yajun Wang,Siyu Yang +2 more
- 28 Jun 2009