{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T23:08:27Z","timestamp":1777158507967,"version":"3.51.4"},"reference-count":36,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T00:00:00Z","timestamp":1640304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GS"],"published-print":{"date-parts":[[2022,5,26]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>The purpose of the paper is to improve the rating prediction accuracy in recommender systems (RSs) by metric learning (ML) method. The similarity metric of user and item is calculated with gray relational analysis.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>First, the potential features of users and items are captured by exploiting ML, such that the rating prediction can be performed. In metric space, the user and item positions can be learned by training their embedding vectors. Second, instead of the traditional distance measurements, the gray relational analysis is employed in the evaluation of the position similarity between user and item, because the latter can reduce the impact of data sparsity and further explore the rating data correlation. On the basis of the above improvements, a new rating prediction algorithm is proposed. Experiments are implemented to validate the effectiveness of the algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The novel algorithm is evaluated by the extensive experiments on two real-world datasets. Experimental results demonstrate that the proposed model achieves remarkable performance on the rating prediction task.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title><jats:p>The rating prediction algorithm is adopted to predict the users' preference, and then, it provides personalized recommendations for users. In fact, this method can expand to the field of classification and provide potentials for this domain.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The algorithm can uncover the finer grained preference by ML. Furthermore, the similarity can be measured using gray relational analysis, which can mitigate the limitation of data sparsity.<\/jats:p><\/jats:sec>","DOI":"10.1108\/gs-05-2021-0073","type":"journal-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T10:11:01Z","timestamp":1640686261000},"page":"635-650","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing rating prediction for recommendation by metric learning with gray relational analysis"],"prefix":"10.1108","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7901-6969","authenticated-orcid":false,"given":"Jiangmei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6293-5093","authenticated-orcid":false,"given":"Wende","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qishan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2021,12,24]]},"reference":[{"key":"key2022052516174032800_ref001","first-page":"247","article-title":"I like it\u2026 i like it not: evaluating user ratings noise in recommender systems","year":"2009"},{"key":"key2022052516174032800_ref002","first-page":"548","article-title":"Comparing state-of-the-art collaborative filtering systems","year":"2007","journal-title":"International Workshop on Machine Learning and Data Mining in Pattern Recognition"},{"issue":"4","key":"key2022052516174032800_ref003","doi-asserted-by":"crossref","first-page":"512","DOI":"10.3390\/sym12040512","article-title":"Metric factorization with item cooccurrence for recommendation","volume":"12","year":"2020","journal-title":"Symmetry"},{"issue":"5","key":"key2022052516174032800_ref004","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/S0167-6911(82)80025-X","article-title":"Control problems of grey systems","volume":"1","year":"1982","journal-title":"Systems and Control Letters"},{"key":"key2022052516174032800_ref005","first-page":"36","article-title":"Collaborative filtering based on factorization and distance metric learning","year":"2019"},{"key":"key2022052516174032800_ref006","first-page":"10404","article-title":"A theoretically sound upper bound on the triplet loss for improving the efficiency of deep distance metric learning","year":"2019"},{"issue":"7","key":"key2022052516174032800_ref007","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"key2022052516174032800_ref008","first-page":"2619","article-title":"A novel bayesian similarity measure for recommender systems","year":"2013"},{"key":"key2022052516174032800_ref009","article-title":"Enhancing factorization machines with generalized metric learning","year":"2020","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2022052516174032800_ref010","first-page":"193","article-title":"Collaborative metric learning","year":"2017"},{"key":"key2022052516174032800_ref011","first-page":"263","article-title":"Collaborative filtering for implicit feedback datasets","year":"2008"},{"issue":"2","key":"key2022052516174032800_ref012","first-page":"93","article-title":"A fuzzy similarity measure for collaborative filtering using nonadditive grey relational analysis","volume":"27","year":"2015","journal-title":"Journal of Grey System"},{"issue":"1","key":"key2022052516174032800_ref013","first-page":"194","article-title":"Establishing grey criteria similarity measures for multi-criteria recommender systems","volume":"30","year":"2018","journal-title":"Journal of Grey System"},{"key":"key2022052516174032800_ref014","first-page":"451","article-title":"Comparisons instead of ratings: towards more stable preferences","year":"2011"},{"key":"key2022052516174032800_ref015","first-page":"426","article-title":"Factorization meets the neighborhood: a multifaceted collaborative filtering model","year":"2008"},{"issue":"8","key":"key2022052516174032800_ref016","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix factorization techniques for recommender systems","volume":"42","year":"2009","journal-title":"Computer"},{"issue":"4","key":"key2022052516174032800_ref017","first-page":"287","article-title":"Metric learning: a survey","volume":"5","year":"2012","journal-title":"Foundations and Trends in Machine Learning"},{"key":"key2022052516174032800_ref018","first-page":"1257","article-title":"Probabilistic matrix factorization","volume":"20","year":"2007","journal-title":"Advances in Neural Information Processing Systems"},{"key":"key2022052516174032800_ref019","first-page":"931","article-title":"Maximum inner-product search using cone trees","year":"2012"},{"issue":"1","key":"key2022052516174032800_ref020","first-page":"2555","article-title":"Parameter free large margin nearest neighbor for distance metric learning","volume":"31","year":"2017","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"key2022052516174032800_ref021","first-page":"4796","article-title":"Dysarthric speech recognition based on deep metric learning","year":"2020"},{"key":"key2022052516174032800_ref022","first-page":"2593","article-title":"Deep metric learning with angular loss","year":"2017"},{"issue":"1","key":"key2022052516174032800_ref023","first-page":"012037","article-title":"Improved metric factorization recommendation algorithm based on social networks and implicit feedback","volume":"1634","year":"2020","journal-title":"Journal of Physics: Conference Series"},{"key":"key2022052516174032800_ref024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.inffus.2020.05.005","article-title":"Deep feature fusion through adaptive discriminative metric learning for scene recognition","volume":"63","year":"2020","journal-title":"Information Fusion"},{"issue":"1","key":"key2022052516174032800_ref025","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"key2022052516174032800_ref026","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.neunet.2020.01.021","article-title":"Effective metric learning with co-occurrence embedding for collaborative recommendations","volume":"124","year":"2020","journal-title":"Neural Networks"},{"key":"key2022052516174032800_ref027","doi-asserted-by":"crossref","first-page":"107424","DOI":"10.1016\/j.patcog.2020.107424","article-title":"Deep features for person re-identification on metric learning","volume":"110","year":"2021","journal-title":"Patter Recognition"},{"issue":"4","key":"key2022052516174032800_ref028","first-page":"78","article-title":"A social TopN recommendation scheme based on grey forecast model","volume":"30","year":"2018","journal-title":"Journal of Grey System"},{"issue":"10","key":"key2022052516174032800_ref029","first-page":"179","article-title":"Grey forecast model for accurate recommendation in presence of data sparsity and correlation","volume":"69","year":"2014","journal-title":"Knowledge-Based Systems"},{"key":"key2022052516174032800_ref030","first-page":"1879","article-title":"From sbow to dcot marginalized encoders for text representation","year":"2012"},{"issue":"9","key":"key2022052516174032800_ref031","doi-asserted-by":"crossref","first-page":"896","DOI":"10.14778\/2311906.2311916","article-title":"Challenging the long tail recommendation","volume":"5","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"5","key":"key2022052516174032800_ref032","first-page":"21557","article-title":"A social recommender based on factorization and distance metric learning","volume":"99","year":"2017","journal-title":"IEEE Access"},{"key":"key2022052516174032800_ref033","doi-asserted-by":"crossref","first-page":"107043","DOI":"10.1016\/j.ymssp.2020.107043","article-title":"A multi-stage semi-supervised learning approach for intelligent fault diagnosis of rolling bearing using data augmentation and metric learning","volume":"146","year":"2021","journal-title":"Mechanical Systems and Signal Proceeding"},{"key":"key2022052516174032800_ref034","volume-title":"Difference Information Theory of Grey Hazy Set","year":"2002"},{"key":"key2022052516174032800_ref035","first-page":"2839","article-title":"Social regularized collaborative metric learning","year":"2019"},{"issue":"2","key":"key2022052516174032800_ref036","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/TII.2019.2947112","article-title":"Unraveling metric vector spaces with factorization for recommendation","volume":"16","year":"2020","journal-title":"IEEE Transactions on Industrial Informatics"}],"container-title":["Grey Systems: Theory and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/GS-05-2021-0073\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/GS-05-2021-0073\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:45:50Z","timestamp":1753404350000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/gs\/article\/12\/3\/635-650\/82546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,24]]},"references-count":36,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,12,24]]},"published-print":{"date-parts":[[2022,5,26]]}},"alternative-id":["10.1108\/GS-05-2021-0073"],"URL":"https:\/\/doi.org\/10.1108\/gs-05-2021-0073","relation":{},"ISSN":["2043-9377"],"issn-type":[{"value":"2043-9377","type":"print"}],"subject":[],"published":{"date-parts":[[2021,12,24]]}}}