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
An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions
Mehdi Azaouzi,Lotfi Ben Romdhane +1 more
TL;DR: Experiments conducted on large-scale real-world and synthetic social networks reveal the good performance of the proposed Social Action-Based Influence Maximization Model SAIM in computing, in acceptable time scales, a minimal set of influential nodes allowing the maximum spreading of information.
24
•Journal Article
Combining social-based data mining techniques to extract collective trends from twitter
TL;DR: This work is focused on how clustering and classification techniques can be combined to extract collective knowledge from Twitter.
23
•Dissertation
Sur les traces du futur : entre comprendre et predire
Armelle Brun
- 10 Apr 2018
TL;DR: La modelisation empirique, reposant sur des donnees de realisation ou de traces, est une approche de modelisation de phenomenes, systemes ou objets, et a la caracteristique de s’interesser a la “realite” de ces derniers.
23
Understanding WeChat User Preferences and “Wow” Diffusion
Fanjin Zhang,Jie Tang,Xueyi Liu,Zhenyu Hou,Yuxiao Dong,Jing Zhang,Xiao Liu,Ruobing Xie,Zhuang Kai,Xu Zhang,Leyu Lin,Philip S. Yu +11 more
TL;DR: A hierarchical graph representation learning based model ProHENE is presented, which is capable of capturing the structured based social observations discovered above and can significantly improve the prediction performance compared with alternative methods.
23
Interests Diffusion in Social Networks
Gregorio D'Agostino,Gregorio D'Agostino,Fulvio D'Antonio,Antonio De Nicola,Antonio De Nicola,Salvatore Tucci +5 more
TL;DR: A framework to gather information about the members of the social networks; methods to perform some semantic analysis of the Domain of Interest; a procedure to infer members' interests; and an interests evolution theory to predict how the interests propagate in the network are tested.
23
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