An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
IEEE Transactions on Knowledge and Data Engineering
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness
ACM Transactions on Internet Technology (TOIT)
Addressing cold-start problem in recommendation systems
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Optimal marketing strategies over social networks
Proceedings of the 17th international conference on World Wide Web
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Recommender Systems Handbook
A market-based approach to address the new item problem
Proceedings of the fifth ACM conference on Recommender systems
Maximizing product adoption in social networks
Proceedings of the fifth ACM international conference on Web search and data mining
When power users attack: assessing impacts in collaborative recommender systems
Proceedings of the 7th ACM conference on Recommender systems
Accuracy and robustness impacts of power user attacks on collaborative recommender systems
Proceedings of the 7th ACM conference on Recommender systems
iGSLR: personalized geo-social location recommendation: a kernel density estimation approach
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
In recent times, collaborative filtering based Recommender Systems (RS) have become extremely popular. While research in recommender systems has mostly focused on improving the accuracy of recommendations, in this paper, we look at the "flip" side of a RS. That is, instead of improving existing recommender algorithms, we ask whether we can use an existing operational RS to launch a targeted marketing campaign. To this end, we propose a novel problem called RecMax that aims to select a set of "seed" users for a marketing campaign for a new product, such that if they endorse the product by providing relatively high ratings, the number of other users to whom the product is recommended by the underlying RS algorithm is maximum. We motivate RecMax with real world applications. We show that seeding can make a substantial difference, if done carefully. We prove that RecMax is not only NP-hard to solve optimally, it is NP-hard to even approximate within any reasonable factor. Given this hardness, we explore several natural heuristics on 3 real world datasets - Movielens, Yahoo! Music and Jester Joke and report our findings. We show that even though RecMax is hard to approximate, simple natural heuristics may provide impressive gains, for targeted marketing using RS.