Identifying Key Users for Targeted Marketing by Mining Online Social Network

• Published in: 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops pp. 644 - 649
• Main Authors: Yu Zhang, Zhaoqing Wang, Chaolun Xia
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.04.2010
• Subjects: Algorithm design and analysis; Approximation algorithms; Complexity theory; Greedy algorithms; Heuristic algorithms; key users; online social network; Social network services; targeted marketing; web of trust
• ISBN: 9781424467013; 1424467012
• DOI: 10.1109/WAINA.2010.137

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.