The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
On Deep Learning for Trust-Aware Recommendations in Social Networks
Abstract
With the emergence of online social networks, the social network-based recommendation approach is popularly used. The major benefit of this approach is the ability of dealing with the problems with cold-start users. In addition to social networks, user trust information also plays an important role to obtain reliable recommendations. Although matrix factorization (MF) becomes dominant in recommender systems, the recommendation largely relies on the initialization of the user and item latent feature vectors. Aiming at addressing these challenges, we develop a novel trust-based approach for recommendation in social networks. In particular, we attempt to leverage deep learning to determinate the initialization in MF for trust-aware social recommendations and to differentiate the community effect in user's trusted friendships. A two-phase recommendation process is proposed to utilize deep learning in initialization and to synthesize the users' interests and their trusted friends' interests together with the impact of community effect for recommendations. We perform extensive experiments on real-world social network data to demonstrate the accuracy and effectiveness of our proposed approach in comparison with other state-of-the-art methods.
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
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“Detection: The notion of n-clique is a typical concept for cliques in social science [32] , which is defined as follows.”
BackgroundAbdi, H., & Williams, L. J. (2010) · WIREs Computational Statistics · doi:10.1002/wics.101 · Cited by 11,104
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
Restricted 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
A matrix factorization technique with trust propagation for recommendation in social networks
Jamali, M., & Ester, M. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864736 · Cited by 1,632
Trust-aware recommender systems
Massa, P., & Avesani, P. (2007) · Proceedings of the 2007 ACM conference on Recommender systems · doi:10.1145/1297231.1297235 · Cited by 1,190
Computing and applying trust in web-based social networks
Golbeck, J., & Hendler, J. (2005) · University Libraries (University of Maryland) · Cited by 939
The Isomap Algorithm and Topological Stability
Balasubramanian, M., & Schwartz, E. L. (2002) · Science · doi:10.1126/science.295.5552.7a · Cited by 839
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Jamali, M., & Ester, M. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557067 · Cited by 771
Factor in the neighbors: Scalable and accurate collaborative filtering
Koren, Y. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1644873.1644874 · Cited by 718
Trust and nuanced profile similarity in online social networks
Golbeck, J. (2009) · ACM Transactions on the Web · doi:10.1145/1594173.1594174 · Cited by 374
Circle-based recommendation in online social networks
Yang, X., Steck, H., & Liu, Y. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339728 · Cited by 346
Online Nonnegative Matrix Factorization With Robust Stochastic Approximation
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197827 · Cited by 287
Gu, Q., Zhou, J., & Ding, C. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.18 · Cited by 235
Trust Metrics on Controversial Users: Balancing Between Tyranny of the Majority
Massa, P., & Avesani, P. (2007) · International Journal on Semantic Web and Information Systems · doi:10.4018/jswis.2007010103 · Cited by 173
Trust Metrics in Recommender Systems
Massa, P., & Avesani, P. (2009) · Human-computer interaction series · doi:10.1007/978-1-84800-356-9_10 · Cited by 163
Feature Extraction With Deep Neural Networks by a Generalized Discriminant Analysis
Stuhlsatz, A., Lippel, J., & Zielke, T. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2183645 · Cited by 151
Learning to recommend with explicit and implicit social relations
Ma, H., King, I., & Lyu, M. R.-T. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961201 · Cited by 150
Victor, P., Cock, M. D., & Chris Cornelis, A. (2010) · Springer eBooks · doi:10.1007/978-0-387-85820-3_20 · Cited by 128
A probabilistic model to resolve diversity–accuracy challenge of recommendation systems
Javari, A., & Jalili, M. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-014-0779-2 · Cited by 103
Exploring user emotion in microblogs for music recommendation
Deng, S., Wang, D., Li, X., & Xu, G. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.08.029 · Cited by 102
Self-citationBiclustering neighborhood-based collaborative filtering method for top-n recommender systems
Alqadah, F., Reddy, C. K. A., Hu, J., & Alqadah, H. F. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-014-0771-x · Cited by 72
Latent Feature Kernels for Link Prediction on Sparse Graphs
Nguyen, C. H., & Mamitsuka, H. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2215337 · Cited by 28
Cited by
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
Graph Neural Networks for Social Recommendation
Fan, W., Ma, Y., Li, Q., He, Y., Zhao, E., Tang, J., & Yin, D. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313488 · Cited by 1,984
Deep Learning based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.07435 · Cited by 635
A review on deep learning for recommender systems: challenges and remedies
Batmaz, Z., Yurekli, A., Bilge, A., & Kaleli, C. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-018-9654-y · Cited by 504
Recommendation system based on deep learning methods: a systematic review and new directions
Da’u, A., & Salim, N. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09744-1 · Cited by 402
Metadata
- Authors
- Deng, S., Huang, L., Xu, G., Wu, X., & Wu, Z.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-05
- Volume
- 28
- Issue
- 5
- Pages
- 1164-1177
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2343644403
- Cited by
- 309
- References
- 26
- FWCI
- 77.29
- Type
- journal article
- 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.