{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T13:46:08Z","timestamp":1784036768671,"version":"3.55.0"},"reference-count":25,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"2","license":[{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>This research aims to explore precision marketing methodologies and strategies within the domain of big data, with a specific focus on the recommendation algorithm. The initial phase involves an in-depth analysis of the system prerequisites for a user-centric personalized recommendation system rooted in big data. Following this, the study introduces the Latent Factor-Based Matrix Factorization Completion Based Hybrid Weighted Recommendation Method (LF-WMC). Moreover, considering the neighbor information set of customer and item, the above two prediction results are mixed to get a new prediction result according to the local and global impact of customer and item core. Finally, the weighted average is conducted based on the root mean squared error (RMSE) of the three prediction results. The LF-WMC proves to be a robust solution for addressing challenges like cold start and high data sparseness in big data precision marketing systems. It significantly enhances the accuracy of the system\u2019s predictive recommendations. Experimental results demonstrate that, compared to other methods using the same dataset, LF-WMC consistently achieves lower root mean squared error (RMSE). Furthermore, LF-WMC exhibits superior accuracy, especially in scenarios with substantial data sparsity across multiple datasets.<\/jats:p>","DOI":"10.1177\/14727978241299637","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T03:15:24Z","timestamp":1745896524000},"page":"1382-1393","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Methods and strategies of precision marketing complex system for big data using recommendation algorithm"],"prefix":"10.66113","volume":"25","author":[{"given":"Chunming","family":"Yu","sequence":"first","affiliation":[{"name":"College of Information Management, Shanghai Lixin University of Accounting and Finance, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Jin","sequence":"additional","affiliation":[{"name":"Marketing Department, Aiways Automobile Co., Ltd, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Material, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"55691","published-online":{"date-parts":[[2024,11,14]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.046"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3370082"},{"issue":"08","key":"e_1_3_3_4_2","first-page":"16","article-title":"A guideline-based approach for assisting with the reproducibility of experiments in recommender systems evaluation","volume":"28","author":"Polatidis N","year":"2019","unstructured":"Polatidis N, Pimenidis E, Fish A, et al. A guideline-based approach for assisting with the reproducibility of experiments in recommender systems evaluation. Int J Artif Intell Tool 2019; 28(08): 16.","journal-title":"Int J Artif Intell Tool"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-019-03946-z"},{"issue":"04","key":"e_1_3_3_6_2","first-page":"12","article-title":"Investigating recommendation algorithms for escape rooms","volume":"06","author":"Sagi B","year":"2019","unstructured":"Sagi B, Guy S. Investigating recommendation algorithms for escape rooms. Vietnam J Com Sci 2019; 06(04): 12.","journal-title":"Vietnam J Com Sci"},{"issue":"12","key":"e_1_3_3_7_2","first-page":"394","article-title":"Social media data analysis using recommendation algorithms","volume":"8","author":"Sathyavathi S","year":"2019","unstructured":"Sathyavathi S, Baskaran KR, Kavitha S. Social media data analysis using recommendation algorithms. Int J Innovative Technol Explor Eng 2019; 8(12): 394\u2013397.","journal-title":"Int J Innovative Technol Explor Eng"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1616-7"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.4018\/IJDSST.2019070103"},{"issue":"6","key":"e_1_3_3_10_2","first-page":"203","article-title":"Analysis of defective causes in real time and prediction of facility replacement cycle based on big data","volume":"19","author":"Yeon HS","year":"2019","unstructured":"Yeon HS, Kwak K, Jin SD, et al. Analysis of defective causes in real time and prediction of facility replacement cycle based on big data. J Insti Int, Broad & Com 2019; 19(6): 203\u2013212.","journal-title":"J Insti Int, Broad & Com"},{"issue":"4","key":"e_1_3_3_11_2","first-page":"113","article-title":"Relations between paprika consumption and unstructured big data, and paprika consumption prediction","volume":"15","author":"Yongbeen C","year":"2019","unstructured":"Yongbeen C, Eunhwa O, Wan-Sup C, et al. Relations between paprika consumption and unstructured big data, and paprika consumption prediction. International Journal of Contents 2019; 15(4): 113\u2013119.","journal-title":"International Journal of Contents"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1096-7192(21)00608-9"},{"key":"e_1_3_3_13_2","first-page":"52","article-title":"Tiktok recommendation algorithms","volume":"2","author":"Abby O","year":"2021","unstructured":"Abby O. Tiktok recommendation algorithms. MIT Technology Review 2021; 2: 52\u201353.","journal-title":"MIT Technology Review"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1108\/IJIS-09-2020-0155"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0245485"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.08.106"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.10.008"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106771"},{"key":"e_1_3_3_19_2","first-page":"1","article-title":"Simple and effective neural-free soft-cluster embeddings for item cold-start recommendations","volume":"34","author":"Puthiya Parambath SA","year":"2020","unstructured":"Puthiya Parambath SA, Chawla S. Simple and effective neural-free soft-cluster embeddings for item cold-start recommendations. Data Min Knowl Discov 2020; 34: 1\u201329.","journal-title":"Data Min Knowl Discov"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijmedinf.2020.104175"},{"issue":"3","key":"e_1_3_3_21_2","first-page":"1374","article-title":"P1374development of hemoglobin prediction and erythrocyte stimulating agent recommendation algorithm (hpera) using recurrent neural network in end-stage kidney disease patients","volume":"35","author":"Yoo TH","year":"2020","unstructured":"Yoo TH, Yun HR, Chang JH. P1374development of hemoglobin prediction and erythrocyte stimulating agent recommendation algorithm (hpera) using recurrent neural network in end-stage kidney disease patients. Nephrol Dial Transplant 2020; 35(3): 1374.","journal-title":"Nephrol Dial Transplant"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3728-2"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.3390\/math9020197"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-0807-6"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2994-9"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.35806\/ijoced.v2i1.100"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978241299637","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978241299637","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978241299637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:05:57Z","timestamp":1776809157000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978241299637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,14]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1177\/14727978241299637"],"URL":"https:\/\/doi.org\/10.1177\/14727978241299637","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,14]]}}}