Semi-Discrete Social Recommendation (Student Abstract)

Abstract Combining matrix factorization (MF) with network embedding (NE) has been a promising solution to social recommender systems. However, such a scheme suffers from the online predictive efficiency issue due to the ever-growing users and items. In this paper, we propose a novel hashing-based social recommendation model, called semi-discrete socially embedded matrix factorization (S2MF), which leverages the dual advantages of social information for recommendation effectiveness and hashing trick for online predictive efficiency. Experimental results demonstrate the advantages of S2MF over state-of-the-art discrete recommendation models and its real-valued competitors.