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
Strategic resource allocation for competitive influence in social networks
Antonia Masucci,Alonso Silva +1 more
- 01 Sep 2014
TL;DR: Using results from game theory, this work is able to completely characterize the optimal strategic resource allocation for the voter model of social networks and prove that the price of competition of this game is unbounded.
16
Sustainable Resource Acquisition Path: A Dynamic Model of Embedded Entrepreneurial Network Governance under Uncertainty
TL;DR: This work introduces an exploratory model design by the Naïve Bayesian classification with EM (Expectation Maximization) algorithm based on SNA (Social Network Analysis) theory that is focused on filling the missing data of uncertainty, in order to describe the path of entrepreneurial network resources acquisition.
16
Exploring Community Structures for Influence Maximization in Social Networks
Yi-Cheng Chen,Su-Hua Chang,Chien-Li Chou,Wen-Chih Peng,Suh-Yin Lee +4 more
- 01 Jan 2012
TL;DR: By utilizing community structures, two efficient algorithms CDHKcut and CDH-SHRINK are developed that significantly decrease the number of candidate influential nodes and indicate that these algorithms not only significantly outperform state-of-the-art algorithms in efficiency but also possess graceful scalability.
16
A tie strength based model to socially-enhance applications and its enabling implementation: mySocialSphere
Sandra Servia-Rodriguez,Rebeca P. Díaz-Redondo,Ana Fernández-Vilas,Yolanda Blanco-Fernández,José J. Pazos-Arias +4 more
TL;DR: A user-centred model whose goal is not to infer the aforementioned interaction network, but to build users' social spheres is introduced, assessing the strength and the context of the user's ties by using signs of interaction available from social sites APIs with user's permission.
15
Who should get vaccinated? Individualized allocation of vaccines over SIR network
TL;DR: In this paper , a procedure to estimate an individualized vaccine allocation policy under limited supply, exploiting social network data containing individual demographic characteristics and health status, is developed, and a computationally attractive greedy algorithm for approximating a solution that has a theoretical performance guarantee.
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