Identifying Key Users for Targeted Marketing by Mining Online Social Network

Published 1 January 2010

Yu Zhang, Zhaoqing Wang, Chaolun Xia

DOI10.1109/waina.2010.137

Citations56

TL;DR

This paper proposes a method for identifying key users with great influence, based on mining of online social networks, and proposes an approximation searching algorithm based on the heuristics information from the above methods.

Abstract

The popularity of online shopping highlights the need for targeted marketing. Instead of broadcasting advertisement to an entire online community, targeted marketing aims at key users, namely, influential reviewers whose reviews may affect a large group of his friends, acquaintances or other online customers to buy the product. This paper proposes a method for identifying key users, based on mining of online social networks. We represent social networks as a directed graph of potential customers, which incorporates "web of trust" and "review rating network" on Epinions, and moreover, has a weight associated with each edge to represent the influence of one user on another. We then test a set of algorithms, including general greedy, hill-climbing and centrality-based algorithms, on the real-world social network to identify key users with great influence. We also propose an approximation searching algorithm based on the heuristics information from the above methods. Experimental results showed that if the social network was properly built and associated with sufficient related information, a relatively simple measure was as good as more complex algorithms.

Keywords

Social SciencesComputer SciencePhysics and Astronomy

Maximizing the spread of influence through a social network

7,314 Citations2003David Kempe, Jon Kleinberg +1 more

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.

Mining the network value of customers

2,868 Citations2001Pedro Domingos, Matt Richardson

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.

Mining knowledge-sharing sites for viral marketing

1,635 Citations2002Matthew Richardson, Pedro Domingos

This research optimize the amount of marketing funds spent on each customer, rather than just making a binary decision on whether to market to him, and takes into account the fact that knowledge of the network is partial, and that gathering that knowledge can itself have a cost.

Lecture notes in computer scienceInfluential Nodes in a Diffusion Model for Social Networks

940 Citations2005David Kempe, Jon Kleinberg +1 more

A natural and general model of influence propagation that is generalizing models used in the sociology and economics communities, and shows that in the decreasing cascade model, a natural greedy algorithm is a 1-1/ e-e approximation for selecting a target set of size k.

Expertise networks in online communities

795 Citations2007Jun Zhang, Mark S. Ackerman +1 more

This study analyzes the Java Forum, a large online help-seeking community, using social network analysis methods and tests a set of network-based ranking algorithms on this large size social network in order to identify users with high expertise.

The Faculty Digital Archive (New York University)Network-Based Marketing: Identifying Likely Adopters Via Consumer Networks

462 Citations2006Shawndra Hill, Foster Provost +1 more

Statistical ScienceNetwork-Based Marketing: Identifying Likely Adopters via Consumer Networks

386 Citations2006Shawndra Hill, Foster Provost +1 more

A new data set that represents the adoption of a new telecommunications service is used, and very strong support is shown for the hypothesis that network linkage can directly affect product/service adoption is shown.

View PDF

Social Psychology QuarterlyInfluence and Similarity Among Friends: An Integrative Model Applied to Incarcerated Adolescents

242 Citations1989Lee Jussim, Debora L. Osgood

Data Mining and Knowledge DiscoveryExtracting influential nodes on a social network for information diffusion

193 Citations2009Masahiro Kimura, Kazumi Saito +2 more

This paper addresses the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models and proposes a method of efficiently finding a good approximate solution to the problem under the greedy algorithm on the basis of bond percolation and graph theory.

The American SurgeonExtracting influential nodes for information diffusion on a social network

180 Citations2007Masahiro Kimura, Kazumi Saito +1 more

This paper proposes a method of efficiently estimating all those quantities on the basis of bond percolation and graph theory, and applies it to approximately solving the optimization problem under the greedy algorithm, and demonstrates that it can outperform the conventional method, and achieve a large reduction in computational cost.