{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:46:21Z","timestamp":1767707181268,"version":"3.41.2"},"reference-count":50,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2024,1,2]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>In this \u201cInfo-plosion\u201d era, recommendation systems (or recommenders) play a significant role in finding interesting items in the surge of online digital activity and e-commerce. The purpose of this paper is to model users' preference evolution to recommend potential items which users may be interested in.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>A novel recommendation system, namely evolution-learning recommendation (ELR), is developed to precisely predict user interest for making recommendations. Differing from prior related methods, the authors integrate the matrix factorization (MF) and recurrent neural network (RNN) to effectively describe the variation of user preferences over time.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>A novel cumulative factorization technique is proposed to efficiently decompose a rating matrix for discovering latent user preferences. Compared to traditional MF-based methods, the cumulative MF could reduce the utilization of computation resources. Furthermore, the authors depict the significance of long- and short-term effects in the memory cell of RNN for evolution patterns. With the context awareness, a learning model, V-LSTM, is developed to dynamically capture the evolution pattern of user interests. By using a well-trained learning model, the authors predict future user preferences and recommend related items.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>Based on the relations among users and items for recommendation, the authors introduce a novel concept, virtual communication, to effectively learn and estimate the correlation among users and items. By incorporating the discovered latent features of users and items in an evolved manner, the proposed ELR model could promote \u201cright\u201d things to \u201cright\u201d users at the \u201cright\u201d time. In addition, several extensive experiments are performed on real datasets and are discussed. Empirical results show that ELR significantly outperforms the prior recommendation models. The proposed ELR exhibits great generalization and robustness in real datasets, including e-commerce, industrial retail and streaming service, with all discussed metrics.<\/jats:p><\/jats:sec>","DOI":"10.1108\/imds-05-2023-0298","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T03:10:45Z","timestamp":1700795445000},"page":"416-441","source":"Crossref","is-referenced-by-count":4,"title":["A novel virtual-communicated\u00a0evolution learning recommendation"],"prefix":"10.1108","volume":"124","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7153-0410","authenticated-orcid":false,"given":"Yi-Cheng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yen-Liang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2023,11,28]]},"reference":[{"issue":"2","key":"key2023122714452908100_ref001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5539\/cis.v11n2p1","article-title":"Matrix factorization techniques for context-aware collaborative filtering recommender systems: a survey","volume":"11","year":"2018","journal-title":"Computer and Information Science"},{"key":"key2023122714452908100_ref002","unstructured":"Amazon review datasets (2023), available at: https:\/\/aws.amazon.com"},{"first-page":"2872","article-title":"Time-aware recommender system via continuous-time modeling","year":"2021","key":"key2023122714452908100_ref003"},{"key":"key2023122714452908100_ref004","first-page":"8","article-title":"Matrix factorization recommendation algorithm based on multiple social relationships","volume":"2021","year":"2021","journal-title":"Mathematical Problems in Engineering"},{"journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence","article-title":"An Evolving Preference-Based Recommendation System","year":"2023","key":"key2023122714452908100_ref005"},{"year":"2019","key":"key2023122714452908100_ref006","article-title":"A novel evolution-based recommendation system"},{"issue":"1","key":"key2023122714452908100_ref007","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/s11227-020-03266-2","article-title":"A collaborative filtering recommendation system with dynamic time decay","volume":"77","year":"2021","journal-title":"The Journal of Supercomputing"},{"issue":"4","key":"key2023122714452908100_ref008","doi-asserted-by":"crossref","first-page":"2453","DOI":"10.1109\/TCYB.2020.3000733","article-title":"A learning-based POI recommendation with spatio-temporal context awareness","volume":"52","year":"2022","journal-title":"IEEE Transactions on Cybernetics"},{"volume-title":"A Novel Cross-Domain Recommendation with Evolution Learning","year":"2023","key":"key2023122714452908100_ref009"},{"first-page":"91","article-title":"Modeling temporal adoptions using dynamic matrix factorization","year":"2013","key":"key2023122714452908100_ref010"},{"first-page":"1610","article-title":"Privileged matrix factorization for collaborative filtering","year":"2017","key":"key2023122714452908100_ref011"},{"first-page":"69","article-title":"Large-scale matrix factorization with distributed stochastic gradient descent","year":"2011","key":"key2023122714452908100_ref012"},{"first-page":"549","article-title":"Fast matrix factorization for online recommendation with implicit feedback","year":"2016","key":"key2023122714452908100_ref013"},{"first-page":"1571","article-title":"Active feature acquisition with supervised matrix completion","year":"2018","key":"key2023122714452908100_ref014"},{"issue":"9","key":"key2023122714452908100_ref015","doi-asserted-by":"crossref","first-page":"5853","DOI":"10.1109\/TSMC.2021.3131349","article-title":"A novel group recommendation model with two-stage deep learning","volume":"52","year":"2022","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"first-page":"2280","article-title":"Sub-matrix factorization for real-time vote prediction","year":"2020","key":"key2023122714452908100_ref016"},{"year":"2015","key":"key2023122714452908100_ref017","article-title":"Efficient Thompson sampling for online matrix-factorization recommendation"},{"key":"key2023122714452908100_ref018","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":"IEEE Computer"},{"year":"2000","key":"key2023122714452908100_ref020","article-title":"Algorithms for non-negative matrix factorization"},{"first-page":"59","article-title":"Factorization meets the item embedding: regularizing matrix factorization with item Co-occurrence","year":"2016","key":"key2023122714452908100_ref021"},{"issue":"2","key":"key2023122714452908100_ref022","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TII.2014.2308433","article-title":"An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems","volume":"10","year":"2014","journal-title":"IEEE Transactions on Industrial Informatics"},{"first-page":"97","article-title":"Local probabilistic matrix factorization for personal recommendation","year":"2017","key":"key2023122714452908100_ref023"},{"first-page":"337","article-title":"Intelligent salary benchmarking for talent recruitment: a holistic matrix factorization approach","year":"2018","key":"key2023122714452908100_ref024"},{"first-page":"756","article-title":"A comparative study of matrix factorization and random walk with restart in recommender systems","year":"2017","key":"key2023122714452908100_ref025"},{"key":"key2023122714452908100_ref026","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ins.2021.01.087","article-title":"Nonnegative matrix factorization with local similarity learning","volume":"562","year":"2021","journal-title":"Information Sciences"},{"first-page":"240","article-title":"Neural collaborative filtering vs Matrix factorization revisited","year":"2020","key":"key2023122714452908100_ref027"},{"first-page":"1257","article-title":"Probabilistic matrix factorization","year":"2007","key":"key2023122714452908100_ref028"},{"year":"2018","key":"key2023122714452908100_ref029","article-title":"dynamicMF: a matrix factorization approach to monitor resource usage in high performance computing systems"},{"issue":"5","key":"key2023122714452908100_ref030","article-title":"Price-aware matrix factorization model for personalized recommendations","volume":"60","year":"2023","journal-title":"Information and Management"},{"first-page":"687","article-title":"Regularizing matrix factorization with user and item embeddings for recommendation","year":"2018","key":"key2023122714452908100_ref031"},{"issue":"3","key":"key2023122714452908100_ref032","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2016.2554555","article-title":"A deep matrix factorization method for learning attribute representations","volume":"39","year":"2017","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"first-page":"517","article-title":"Multi-label answer aggregation based on joint matrix factorization","year":"2018","key":"key2023122714452908100_ref033"},{"first-page":"1","volume-title":"The Definitive Guide to Selling on Amazon","year":"2019","key":"key2023122714452908100_ref034"},{"first-page":"942","article-title":"Matrix factorization based on BatchNorm and preference bias","year":"2020","key":"key2023122714452908100_ref035"},{"first-page":"434","article-title":"Confidence-aware matrix factorization for recommender systems","year":"2018","key":"key2023122714452908100_ref036"},{"first-page":"1284","article-title":"Imputing structured missing values in spatial data with clustered adversarial matrix factorization","year":"2018","key":"key2023122714452908100_ref037"},{"first-page":"114","article-title":"Optimization matrix factorization recommendation algorithm based on rating centrality","year":"2018","key":"key2023122714452908100_ref038"},{"first-page":"202","article-title":"QF-RNN: QI-matrix factorization based RNN for time-aware service recommendation","year":"2019","key":"key2023122714452908100_ref039"},{"issue":"5","key":"key2023122714452908100_ref040","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/MIS.2020.3016944","article-title":"Semi-discrete matrix factorization","volume":"35","year":"2020","journal-title":"IEEE Intelligent Systems"},{"issue":"7","key":"key2023122714452908100_ref041","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1109\/TSMC.2019.2931393","article-title":"A deep latent factor model for high-dimensional and sparse matrices in recommender systems","volume":"51","year":"2021","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"1","key":"key2023122714452908100_ref042","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/TSMC.2018.2872842","article-title":"Collaborative neural social recommendation","volume":"51","year":"2021","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"first-page":"1151","article-title":"Dynamic collaborative recurrent learning","year":"2019","key":"key2023122714452908100_ref043"},{"first-page":"211","article-title":"Temporal collaborative filtering with bayesian probabilistic tensor factorization","year":"2010","key":"key2023122714452908100_ref044"},{"first-page":"1459","article-title":"Time matters: sequential recommendation with complex temporal information","year":"2020","key":"key2023122714452908100_ref045"},{"first-page":"2845","article-title":"A unified algorithm for one-cass structured matrix factorization with side information","year":"2017","key":"key2023122714452908100_ref046"},{"issue":"1","key":"key2023122714452908100_ref047","article-title":"Preliminary data-based matrix factorization approach for recommendation","volume":"58","year":"2021","journal-title":"Information Processing and Management"},{"first-page":"4017","article-title":"Matrix factorization with scale-invariant parameters","year":"2015","key":"key2023122714452908100_ref048"},{"issue":"11","key":"key2023122714452908100_ref049","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1109\/TKDE.2016.2594772","article-title":"CRATS: an LDA-based model for jointly mining latent communities, regions, activities, topics, and sentiments from Geosocial network data","volume":"28","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2023122714452908100_ref050","doi-asserted-by":"crossref","first-page":"65266","DOI":"10.1109\/ACCESS.2021.3074365","article-title":"FeatureMF: an item feature enriched matrix factorization model for item recommendation","volume":"9","year":"2021","journal-title":"IEEE Access"},{"first-page":"315","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI 2016)","year":"2016","key":"key2023122714452908100_ref051"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-05-2023-0298\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-05-2023-0298\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:52:17Z","timestamp":1753393937000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/124\/1\/416-441\/1214528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,28]]},"references-count":50,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,11,28]]},"published-print":{"date-parts":[[2024,1,2]]}},"alternative-id":["10.1108\/IMDS-05-2023-0298"],"URL":"https:\/\/doi.org\/10.1108\/imds-05-2023-0298","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2023,11,28]]}}}