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
Influence maximization through exploring structural information
TL;DR: Wang et al. as discussed by the authors proposed a layered gravity bridge algorithm (LGB) to address the influence maximization problem, which emphasizes the local structural information of networks and combines community detection algorithms with an improved gravity model.
30
•Book
On Uncertain Graphs
Arijit Khan,Yuan Ye,Lei Chen +2 more
- 23 Jul 2018
TL;DR: This work has shown that large-scale, highly interconnected networks, which are often modeled as graphs, pervade both the authors' society and the natural world around us.
30
Influence maximization through adaptive seeding
TL;DR: This monograph surveys the adaptive seeding methodology for influence maximization, a two-stage stochastic optimization framework, designed to leverage the friendship paradox to seed high influential nodes, which encompasses a rich set of algorithmic challenges at the intersection of stochastically optimization and submodular optimization.
30
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
TL;DR: Efficient and practical heuristics for inhibiting undesirable contagions in social networks where nodes may have thresholds larger than 1 are developed and their performance on well known social networks is studied.
30
•Posted Content
Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach
TL;DR: This paper proposes hopbased algorithms that can easily scale to millions of nodes and billions of edges and can provide certain theoretical guarantees in relation to influence Maximization.
30
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