Personalized Recommendation using Similarity Powered Pairwise Amplifier Network

Online advertising, one typical application of recommendation system, calls for effective and accurate recommendations of keywords. Extreme sparse and large scale data makes online advertising a challenging problem. To achieve better performance and accuracy of the recommendation, a better model with a short turnaround time is needed. In this paper, we address the problem of personalized online advertising for extreme sparse and large scale data. We develop a novel machine learning model (Similarity Powered Pairwise Amplifier Network, SPPAN for short). The complexity of this model (a.k.a. the number of parameters) grows with the amount of observed data, which makes it suitable to extremely sparse data. The training algorithm based on gradient descent makes it easy to parallelize. The similarity model combines the user neighborhood and item neighborhood ideas in collaborative filtering smartly, obtaining a cost-effective way to handle large scale data. The proposed framework is evaluated on a large set of real-world data set from a large internet company (expressed by "Company A"). The experiment results demonstrate that the proposed SPPAN model can greatly improve the prediction and recommendation accuracy on that extreme sparse data set compared with existing approaches.