The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A Multi-View Deep Learning Approach for Cross Domain User Modeling in Recommendation Systems
Abstract
Recent online services rely heavily on automatic personalization to recommend relevant content to a large number of users. This requires systems to scale promptly to accommodate the stream of new users visiting the online services for the first time. In this work, we propose a content-based recommendation system to address both the recommendation quality and the system scalability. We propose to use a rich feature set to represent users, according to their web browsing history and search queries. We use a Deep Learning approach to map users and items to a latent space where the similarity between users and their preferred items is maximized. We extend the model to jointly learn from features of items from different domains and user features by introducing a multi-view Deep Learning model. We show how to make this rich-feature based user representation scalable by reducing the dimension of the inputs and the amount of training data. The rich user feature representation allows the model to learn relevant user behavior patterns and give useful recommendations for users who do not have any interaction with the service, given that they have adequate search and browsing history. The combination of different domains into a single model for learning helps improve the recommendation quality across all the domains, as well as having a more compact and a semantically richer user latent feature vector. We experiment with our approach on three real-world recommendation systems acquired from different sources of Microsoft products: Windows Apps recommendation, News recommendation, and Movie/TV recommendation. Results indicate that our approach is significantly better than the state-of-the-art algorithms (up to 49% enhancement on existing users and 115% enhancement on new users). In addition, experiments on a publicly open data set also indicate the superiority of our method in comparison with transitional generative topic models, for modeling cross-domain recommender systems. Scalability analysis show that our multi-view DNN model can easily scale to encompass millions of users and billions of item entries. Experimental results also confirm that combining features from all domains produces much better performance than building separate models for each domain.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 2×
“A major approach to this task is called Collaborative Filtering (CF) [3, 19, 22, 21, 23, 6], which uses user’s previous history of interaction in the web site to predict the most relevant content for recommendation.”
BackgroundMethodAmazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
An analysis of single-layer networks in unsupervised feature learning
Coates, A., Ng, A. Y., & Lee, H. (2011) · International Conference on Artificial Intelligence and Statistics · Cited by 4,673
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Learning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009
Self-citationRestricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Methods and metrics for cold-start recommendations
Schein, A. I., Popescul, A., Ungar, L. H., & Pennock, D. M. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564421 · Cited by 1,780
Collaborative topic modeling for recommending scientific articles
Wang, C., & Blei, D. M. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020480 · Cited by 1,527
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Encyclopedia of Statistics in Behavioral Science
(2005) · Wiley eBooks · doi:10.1002/0470013192 · Cited by 1,441
Deep content-based music recommendation
van den Oord, A., Dieleman, S., & Schrauwen, B. (2013) · Ghent University Academic Bibliography (Ghent University) · Cited by 1,426
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Salakhutdinov, R., & Mnih, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390267 · Cited by 1,413
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
Content-boosted collaborative filtering for improved recommendations
Melville, P., Mooney, R. J., & Nagarajan, R. (2002) · doi:10.5555/777092.777124 · Cited by 1,084
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
A survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878
Personalized news recommendation based on click behavior
Liu, J., Dolan, P., & Pedersen, E. R. (2010) · Proceedings of the 15th international conference on Intelligent user interfaces · doi:10.1145/1719970.1719976 · Cited by 762
Very sparse random projections
Li, P., Hastie, T. J., & Church, K. W. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150436 · Cited by 621
Canonical Correlation Analysis
Thompson, B. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa068 · Cited by 457
Transfer Learning in Collaborative Filtering for Sparsity Reduction
Pan, W., Xiang, E., Liu, N., & Yang, Q. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7578 · Cited by 375
Transfer learning for collaborative filtering via a rating-matrix generative model
Li, B., Yang, Q., & Xue, X. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553454 · Cited by 340
Cross-domain collaboration recommendation
Tang, J., Wu, S., Sun, J., & Su, H. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339730 · Cited by 292
Learning preferences of new users in recommender systems: an information theoretic approach
Rashid, A. M., Karypis, G., & Riedl, J. (2008) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1540276.1540302 · Cited by 243
Improved Neighborhood-based Collaborative Filtering
Bell, R. M., & Koren, Y. (2007) · Cited by 176
Lee, J., Samy Bengio, A., Kim, S., Lebanon, G., & Singer, Y. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2567970 · Cited by 135
Tied boltzmann machines for cold start recommendations
Gunawardana, A., & Meek, C. (2008) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/1454008.1454013 · Cited by 88
Twitter-based user modeling for news recommendations
Abel, F., Gao, Q., Houben, G., & Tao, K. (2013) · International Joint Conference on Artificial Intelligence · Cited by 65
Adapting deep RankNet for personalized search
Song, Y., Wang, H., & He, X. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556234 · Cited by 62
Self-citationAhmed, A. A., Das, A., & Smola, A. J. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556264 · Cited by 42
Online Generation of Locality Sensitive Hash Signatures
Durme, B. V., & Lall, A. (2010) · Cited by 41
Cited by
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Self-citationDeep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
Deep Learning Based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2020) · ACM Computing Surveys · doi:10.1145/3285029 · Cited by 3,485
Collaborative Knowledge Base Embedding for Recommender Systems
Zhang, F., Yuan, N. J., Lian, D., Xie, X., & Ma, W.-Y. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939673 · Cited by 1,749
Neural Attentive Session-based Recommendation
Li, J., Ren, P., Chen, Z., Ren, Z., Lian, T., & Ma, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132926 · Cited by 1,501
Metadata
- Authors
- Elkahky, A. M., Song, Y., & He, X.
- Venue
- Proceedings of the 24th International Conference on World Wide Web
- Published
- 2015-05-18
- Pages
- 278-288
- OpenAlex
- W2114079787
- Cited by
- 704
- References
- 31
- FWCI
- 50.58
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.