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
A Mathematical Approach to Gauging Influence by Identifying Shifts in the Emotions of Social Media Users
Les Servi,Sara Beth Elson +1 more
TL;DR: A new quantitative approach that combines the use of a text analysis program with a mathematical algorithm to derive trends in levels of emotions expressed in social media and, more importantly, detect breakpoints when those trends changed abruptly.
28
Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model
Zaixin Lu,Wei Zhang,Weili Wu,Bin Fu,Ding-Zhu Du +4 more
- 20 Jun 2011
TL;DR: The Least Seed Set problem, which aims to find a seed set with least number of people to activate all the required people in a given social network, is discussed and a $O$-approximation is shown in the case that a people become active when one of its neighbors is activated.
P 3 -coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution
Boying Zhang,Jin Teng,Xiaole Bai,Zhimin Yang,Dong Xuan +4 more
- 21 Mar 2011
TL;DR: P3-coupon, a Prompt and Privacy-preserving electronic coupon distribution system based on a Probabilistic one-ownership forwarding algorithm, which can serve as a general framework for facilitating information propagation on mobile phones, which requires promptness and privacy protection.
Identifying Opinion Leaders on Social Networks Through Milestones Definition
TL;DR: The MilestonesRank is defined, a new measure to detect opinion leaders, an important type of influential users focused on specific topics, and shows that the new measure allows us to find relevant opinion leaders that other measures are not able to detect.
28
Maximizing influence under influence loss constraint in social networks
TL;DR: An alternative influence maximization problem which is naturally motivated by the reliability constraint of nodes in social networks is studied, aiming to find top-K influential nodes given a threshold of influence loss due to the failure of a subset of R nodes.
28
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