{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:41Z","timestamp":1760596301794,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T00:00:00Z","timestamp":1565481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MAKE"],"abstract":"<jats:p>In recent years the emergence of social media has become more prominent than ever. Social networking has become the de facto tool used by people all around the world for information discovery. Consequently, the importance of recommendations in a social network setting has urgently emerged, but unfortunately, many methods that have been proposed in order to provide recommendations in social networks cannot produce scalable solutions, and in many cases are complex and difficult to replicate unless the source code of their implementation has been made publicly available. However, as the user base of social networks continues to grow, the demand for developing more efficient social network-based recommendation approaches will continue to grow as well. In this paper, following proven optimization techniques from the domain of machine learning with constrained optimization, and modifying them accordingly in order to take into account the social network information, we propose a matrix factorization algorithm that improves on previously proposed related approaches in terms of convergence speed, recommendation accuracy and performance on cold start users. The proposed algorithm can be implemented easily, and thus used more frequently in social recommendation setups. Our claims are validated by experiments on two real life data sets, the public domain Epinions.com dataset and a much larger dataset crawled from Flixster.com.<\/jats:p>","DOI":"10.3390\/make1030053","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T06:38:02Z","timestamp":1565591882000},"page":"928-944","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Matrix Factorization Algorithm for Efficient Recommendations in Social Rating Networks Using Constrained Optimization"],"prefix":"10.3390","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7238-4731","authenticated-orcid":false,"given":"Nicholas","family":"Ampazis","sequence":"first","affiliation":[{"name":"Department of Financial and Management Engineering, University of the Aegean, Kountouriotou 41, Chios 82100, Greece"}]},{"given":"Theodoros","family":"Emmanouilidis","sequence":"additional","affiliation":[{"name":"Department of Financial and Management Engineering, University of the Aegean, Kountouriotou 41, Chios 82100, Greece"}]},{"given":"Flora","family":"Sakketou","sequence":"additional","affiliation":[{"name":"Department of Financial and Management Engineering, University of the Aegean, Kountouriotou 41, Chios 82100, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,11]]},"reference":[{"key":"ref_1","unstructured":"Tak\u00e1cs, G., Pil\u00e1szy, I., N\u00e9meth, B., and Tikk, D. (2007, January 12\u201315). On the Gravity Recommendation System. Proceedings of the 13th ACM International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA."},{"key":"ref_2","unstructured":"Koren, Y. (2019, August 11). The BellKor Solution to the Netflix Grand Prize. Available online: http:\/\/www.netflixprize.com\/assets\/GrandPrize2009_BPC_BellKor.pdf."},{"key":"ref_3","unstructured":"Toscher, A., Jahrer, M., and Bell, R. (2019, August 11). The Big Chaos Solution to the Netflix Grand Prize. Available online: http:\/\/www.netflixprize.com\/assets\/GrandPrize2009_BPC_BigChaos.pdf."},{"key":"ref_4","unstructured":"Piotte, M., and Chabbert, M. (2019, August 11). The Pragmatic Theory Solution to the Netflix Grand Prize. Available online: http:\/\/www.netflixprize.com\/assets\/GrandPrize2009_BPC_PragmaticTheory.pdf."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1019240304484","article-title":"A Learning Framework for Neural Networks Using Constrained Optimization Methods","volume":"99","author":"Perantonis","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"ref_6","first-page":"221","article-title":"FALCON: A matrix factorization framework for recommender systems using constrained optimization","volume":"9","author":"Ampazis","year":"2015","journal-title":"Intell. Decis. Technol."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"He, X., Liao, L., Zhang, H., Nie, L., Hu, X., and Chua, T.S. (2017, January 3\u20137). Neural Collaborative Filtering. Proceedings of the 26th International Conference on World Wide Web, Perth, Australia.","DOI":"10.1145\/3038912.3052569"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Crandall, D., Cosley, D., Huttenlocher, D., Kleinberg, J., and Suri, S. (2008, January 24\u201327). Feedback Effects Between Similarity and Social Influence in Online Communities. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, NV, USA.","DOI":"10.1145\/1401890.1401914"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1007\/s13278-013-0141-9","article-title":"Social recommendation: A review","volume":"3","author":"Tang","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comcom.2013.06.009","article-title":"A survey of collaborative filtering based social recommender systems","volume":"41","author":"Yang","year":"2014","journal-title":"Comput. Commun."},{"key":"ref_12","unstructured":"Paterek, A. (2007, January 12). Improving regularized singular value decomposition for collaborative filtering. Proceedings of the KDD Cup and Workshop, San Jose, CA, USA."},{"key":"ref_13","unstructured":"Salakhutdinov, R., and Mnih, A. (2007, January 3\u20136). Probabilistic Matrix Factorization. Proceedings of the 20th International Conference on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Koren, Y. (2008, January 24\u201327). Factorization meets the neighborhood: A multifaceted collaborative filtering model. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, NV, USA.","DOI":"10.1145\/1401890.1401944"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Jamali, M., and Ester, M. (2010, January 26\u201330). A matrix factorization technique with trust propagation for recommendation in social networks. Proceedings of the Fourth ACM Conference on Recommender Systems, Barcelona, Spain.","DOI":"10.1145\/1864708.1864736"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix Factorization Techniques for Recommender Systems","volume":"42","author":"Koren","year":"2009","journal-title":"Computer"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Cullum, J., and Willoughby, R. (2002). Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Volume 1, Theory, Classics in Applied Mathematics, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898719192"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"27:1","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"Acm Trans. Intell. Syst. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ma, H., King, I., and Lyu, M.R. (2009, January 19\u201323). Learning to recommend with social trust ensemble. Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Boston, MA, USA.","DOI":"10.1145\/1571941.1571978"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yang, X., Steck, H., and Liu, Y. (2012, January 12\u201316). Circle-based Recommendation in Online Social Networks. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339728"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1115\/1.3640537","article-title":"A Steepest-Ascent Method for Solving optimum Programming Problems","volume":"29","author":"Bryson","year":"1962","journal-title":"J. Appl. Mech."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Tak\u00e1cs, G., Pil\u00e1szy, I., N\u00e9meth, B., and Tikk, D. (2008, January 4\u20136). A unified approach of factor models and neighbor based methods for large recommender systems. Proceedings of the 2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT), Ostrava, Czech Republic.","DOI":"10.1109\/ICADIWT.2008.4664342"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1214\/11-STS368","article-title":"Statistical Significance of the Netflix Challenge","volume":"27","author":"Feuerverger","year":"2012","journal-title":"Stat. Sci."},{"key":"ref_24","unstructured":"Bennett, J., and Lanning, S. (2007, January 12\u201315). The Netflix Prize. Proceedings of the KDD-Cup and Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0893-6080(88)90003-2","article-title":"Increased rates of convergence through learning rate adaptation","volume":"1","author":"Jacobs","year":"1988","journal-title":"Neural Netw."}],"container-title":["Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-4990\/1\/3\/53\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:10:21Z","timestamp":1760188221000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-4990\/1\/3\/53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,11]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["make1030053"],"URL":"https:\/\/doi.org\/10.3390\/make1030053","relation":{},"ISSN":["2504-4990"],"issn-type":[{"type":"electronic","value":"2504-4990"}],"subject":[],"published":{"date-parts":[[2019,8,11]]}}}