491
Views
0
CrossRef citations to date
0
Altmetric
Articles

Collaborative Filtering With Awareness of Social Networks

, ORCID Icon, &

References

  • Ahn, K., Lee, K., Cha, H., and Suh, C. (2018), “Binary Rating Estimation With Graph Side Information,” in Advances in Neural Information Processing Systems, eds. S. Bengio and H. Wallach and H. Larochelle and K. Grauman and N. Cesa-Bianchi and R. Garnett, Red Hook, NY: Curran Associates, Inc., pp. 4272–4283.
  • Bi, X., Qu, A., Wang, J., and Shen, X. (2017), “A Group-Specific Recommender System,” Journal of the American Statistical Association, 112, 1344–1353. DOI: 10.1080/01621459.2016.1219261.
  • Cai, D., He, X., Han, J., and Huang, T. S. (2010), “Graph Regularized Nonnegative Matrix Factorization for Data Representation,” IEEE transactions on Pattern Analysis and Machine Intelligence, 33, 1548–1560.
  • Cai, J.-F., Candès, E. J., and Shen, Z. (2010), “A Singular Value Thresholding Algorithm for Matrix Completion,” SIAM Journal on Optimization, 20, 1956–1982. DOI: 10.1137/080738970.
  • Candès, E. J., and Plan, Y. (2010), “Matrix Completion With Noise,” Proceedings of the IEEE, 98, 925–936. DOI: 10.1109/JPROC.2009.2035722.
  • Candès, E. J., and Recht, B. (2009), “Exact Matrix Completion Via Convex Optimization,” Foundations of Computational Mathematics, 9, 717. DOI: 10.1007/s10208-009-9045-5.
  • Candès, E. J., and Tao, T. (2010), “The Power of Convex Relaxation: Near-Optimal Matrix Completion,” IEEE Transactions on Information Theory, 56, 2053–2080. DOI: 10.1109/TIT.2010.2044061.
  • Chiang, K.-Y., Hsieh, C.-J., and Dhillon, I. S. (2015), “Matrix Completion With Noisy Side Information,” in Advances in Neural Information Processing Systems, eds. C. Cortes and N. Lawrence and D. Lee and M. Sugiyama and R. Garnett, Red Hook, NY: Curran Associates, Inc. pp. 3447–3455.
  • Dang, Q.-V., and Ignat, C.-L. (2017), “dtrust: A Simple Deep Learning Approach for Social Recommendation,” in 2017 IEEE 3rd International Conference on Collaboration and Internet Computing (CIC), San Jose, CA, Los Alamitos, CA, IEEE, pp. 209–218. DOI: 10.1109/CIC.2017.00036.
  • Fan, W., Ma, Y., Li, Q., He, Y., Zhao, E., Tang, J., and Yin, D. (2019), “Graph Neural Networks for Social Recommendation,” in The World Wide Web Conference, San Francisco, CA, pp. 417–426. DOI: 10.1145/3308558.3313488.
  • Guo, G., Zhang, J., and Yorke-Smith, N. (2015), “Trustsvd: Collaborative Filtering With Both the Explicit and Implicit Influence of User Trust and of Item Ratings,” in Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX.
  • Hastie, T., and Mazumder, R. (2015), “softimpute: Matrix Completion Via Iterative Soft-Thresholded SVD,” R package version 1.
  • Hastie, T., Mazumder, R., Lee, J. D., and Zadeh, R. (2015), “Matrix Completion and low-Rank SVD Via Fast Alternating Least Squares,” Journal of Machine Learning Research, 16, 3367–3402.
  • Jamali, M., and Ester, M. (2010), “A Matrix Factorization Technique With Trust Propagation for Recommendation in Social Networks,” in Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 135–142. ACM.
  • Ji, K., Tan, J., Xu, J., and Chi, Y. (2020), “Learning Latent Features With Pairwise Penalties in Low-Rank Matrix Completion,” in 2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM), Piscataway, NJ, pp. 1–5. IEEE.
  • Kalofolias, V., Bresson, X., Bronstein, M., and Vandergheynst, P. (2014), “Matrix Completion on Graphs,” arXiv:1408.1717 .
  • Lange, K. (2004), Optimization, Springer Texts in Statistics, New York: Springer.
  • Li, W.-J., and Yeung, D.-Y. (2009), “Relation Regularized Matrix Factorization,” in Twenty-First International Joint Conference on Artificial Intelligence, Pasadena, CA.
  • Ma, H., Yang, H., Lyu, M. R., and King, I. (2008), “Sorec: Social Recommendation Using Probabilistic Matrix Factorization,” in Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940.
  • Ma, H., Zhou, D., Liu, C., Lyu, M. R., and King, I. (2011), “Recommender Systems With Social Regularization,” In Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 287–296. ACM.
  • Mazumder, R., Hastie, T., and Tibshirani, R. (2010), “Spectral Regularization Algorithms for Learning Large Incomplete Matrices,” Journal of Machine Learning Research, 11, 2287–2322.
  • Rao, N., Yu, H.-F., Ravikumar, P. K., and Dhillon, I. S. (2015), “Collaborative Filtering With Graph Information: Consistency and Scalable Methods,” In Advances in Neural Information Processing Systems, eds. C. Cortes and N. Lawrence and D. Lee and M. Sugiyama and R. Garnett, Red Hook, NY: Curran Associates, Inc., pp. 2107–2115.
  • Salah, A., and Lauw, H. W. (2018), “Probabilistic Collaborative Representation Learning for Personalized Item Recommendation,” in Proceedings of Uncertainty in Artificial Intelligence, eds. A. Globerson and R. Silva, Monterey, CA, Corvallis, OR: AUAI Press, pp. 998–1008.
  • Tang, J., Hu, X., Gao, H., and Liu, H. (2013), “Exploiting Local and Global Social Context for Recommendation,” in Twenty-Third International Joint Conference on Artificial Intelligence, Beijing, China.
  • Yang, B., Lei, Y., Liu, J., and Li, W. (2016), “Social Collaborative Filtering by Trust,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 39, 1633–1647. DOI: 10.1109/TPAMI.2016.2605085.
  • Zhao, Z., Zhang, L., He, X., and Ng, W. (2014), “Expert Finding for Question Answering Via Graph Regularized Matrix Completion,” IEEE Transactions on Knowledge and Data Engineering, 27, 993–1004. DOI: 10.1109/TKDE.2014.2356461.
  • Zhou, T., Shan, H., Banerjee, A., and Sapiro, G. (2012), “Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information,” in Proceedings of the 2012 SIAM International Conference on Data Mining, eds. J. Ghosh, H. Liu, I. Davidson, C. Domeniconi, C. Kamath, Philadelphia, PA, pp. 403–414. SIAM.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.