{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:34:35Z","timestamp":1773902075452,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universidad Pablo de Olavide"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Recommender Systems help users in making decision in different fields such as purchases or what movies to watch. User-Based Collaborative Filtering (UBCF) approach is one of the most commonly used techniques for developing these software tools. It is based on the idea that users who have previously shared similar tastes will almost certainly share similar tastes in the future. As a result, determining the nearest users to the one for whom recommendations are sought (active user) is critical. However, the massive growth of online commercial data has made this task especially difficult. As a result, Biclustering techniques have been used in recent years to perform a local search for the nearest users in subgroups of users with similar rating behaviour under a subgroup of items (biclusters), rather than searching the entire rating database. Nevertheless, due to the large size of these databases, the number of biclusters generated can be extremely high, making their processing very complex. In this paper we propose BinRec, a novel UBCF approach based on Biclustering. BinRec simplifies the search for neighbouring users by determining which ones are nearest to the active user based on the number of biclusters shared by the users. Experimental results show that BinRec outperforms other state-of-the-art recommender systems, with a remarkable improvement in environments with high data sparsity. The flexibility and scalability of the method position it as an efficient alternative for common collaborative filtering problems such as sparsity or cold-start.<\/jats:p>","DOI":"10.1007\/s10489-025-06725-6","type":"journal-article","created":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T01:20:23Z","timestamp":1751332823000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BinRec: addressing data sparsity and cold-start challenges in recommender systems with biclustering"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9801-9364","authenticated-orcid":false,"given":"Domingo","family":"Rodr\u00edguez-Baena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"G\u00f3mez-Vela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aurelio","family":"Lopez-Fernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Garc\u00eda-Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Divina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,1]]},"reference":[{"key":"6725_CR1","doi-asserted-by":"crossref","unstructured":"Sharma R, Singh R (2016) Evolution of recommender systems from ancient times to modern era: A survey. Indian J Sci Technol 9","DOI":"10.17485\/ijst\/2016\/v9i20\/88005"},{"key":"6725_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-012-0389-1","volume":"39","author":"E Davoodi","year":"2013","unstructured":"Davoodi E, Kianmehr K, Afsharchi M (2013) A semantic social network-based expert recommender system. Appl Intell 39:1\u201313","journal-title":"Appl Intell"},{"key":"6725_CR3","doi-asserted-by":"publisher","first-page":"4665","DOI":"10.1007\/s10489-022-03758-z","volume":"53","author":"HK Ahmad","year":"2023","unstructured":"Ahmad HK, Qi C, Wu Z, Muhammad BA (2023) Abine-crs: course recommender system in online education using attributed bipartite network embedding. Appl Intell 53:4665\u20134684","journal-title":"Appl Intell"},{"key":"6725_CR4","doi-asserted-by":"crossref","unstructured":"Khadija A, Almohsen H (2015) Recommender systems in light of big data. Int J Electric Comput Eng 5","DOI":"10.11591\/ijece.v5i6.pp1553-1563"},{"key":"6725_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s40747-020-00212-w","volume":"7","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Lu J, Jin Y (2021) Artificial intelligence in recommender systems. Complex Intell Syst 7:439\u2013457","journal-title":"Complex Intell Syst"},{"key":"6725_CR6","doi-asserted-by":"publisher","first-page":"7645","DOI":"10.1016\/j.jksuci.2021.09.014","volume":"34","author":"F Fkih","year":"2022","unstructured":"Fkih F (2022) Similarity measures for collaborative filtering-based recommender systems: Review and experimental comparison. J King Saud Univer-Comput Inf Sci 34:7645\u20137669","journal-title":"J King Saud Univer-Comput Inf Sci"},{"key":"6725_CR7","volume-title":"& Widiyaningtyas, T","author":"I Saifudin","year":"2024","unstructured":"Saifudin I (2024) & Widiyaningtyas, T. Approach, problem, evaluation techniques, datasets. IEEE Access, Systematic literature review on recommender system"},{"key":"6725_CR8","doi-asserted-by":"crossref","unstructured":"Nanthini M, Pradeep Mohan\u00a0Kumar K (2022) Cold start and data sparsity problems in recommender system: A concise review, 107\u2013118 (Springer)","DOI":"10.1007\/978-981-19-2821-5_9"},{"key":"6725_CR9","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ipm.2012.07.008","volume":"49","author":"S Ismai","year":"2013","unstructured":"Ismai S, \u00d6zlem N, \u00d6zg\u00fcr U (2013) Cluster searching strategies for collaborative recommendation systems. Inf Process Manage 49:688\u2013697","journal-title":"Inf Process Manage"},{"key":"6725_CR10","doi-asserted-by":"crossref","unstructured":"Heidari N, Moradi P, Koochari A (2022) An attention-based deep learning method for solving the cold-start and sparsity issues of recommender systems. Knowl-Based Syst 256:109835","DOI":"10.1016\/j.knosys.2022.109835"},{"key":"6725_CR11","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1007\/s11042-020-09768-8","volume":"80","author":"F Tahmasebi","year":"2021","unstructured":"Tahmasebi F, Meghdadi M, Ahmadian S (2021) A hybrid recommendation system based on profile expansion technique to alleviate cold start problem. Multimed Tools Appl 80:2339\u20132354","journal-title":"Multimed Tools Appl"},{"key":"6725_CR12","doi-asserted-by":"crossref","unstructured":"Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J (1994) Grouplens: An open architecture for collaborative filtering on netnews, 175\u2013186","DOI":"10.1145\/192844.192905"},{"key":"6725_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3390\/electronics11010141","volume":"11","author":"H Ko","year":"2022","unstructured":"Ko H, Lee S, Park Y, Choi A (2022) A survey of recommendation systems: recommendation models, techniques, and application fields. Electronics 11:141","journal-title":"Electronics"},{"key":"6725_CR14","first-page":"219","volume":"21","author":"J Shen","year":"2020","unstructured":"Shen J, Zhou T, Chen L (2020) Collaborative filtering-based recommendation system for big data. Int J Comput Sci Eng 21:219\u2013225","journal-title":"Int J Comput Sci Eng"},{"key":"6725_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-021-01628-7","volume":"64","author":"H Papadakis","year":"2022","unstructured":"Papadakis H, Papagrigoriou A, Panagiotakis C, Kosmas E, Fragopoulou P (2022) Collaborative filtering recommender systems taxonomy. Knowl Inf Syst 64:35\u201374","journal-title":"Knowl Inf Syst"},{"key":"6725_CR16","doi-asserted-by":"crossref","unstructured":"Sim K, Gopalkrishnan V, Zimek A e\u00a0a (2013) A survey on enhanced subspace clustering. Data Min Knowl Disc 26:332\u2013397","DOI":"10.1007\/s10618-012-0258-x"},{"key":"6725_CR17","doi-asserted-by":"publisher","first-page":"282","DOI":"10.26599\/BDMA.2022.9020012","volume":"5","author":"J Sun","year":"2022","unstructured":"Sun J, Zhang Y (2022) Recommendation system with biclustering. Big Data Mining Anal 5:282\u2013293","journal-title":"Big Data Mining Anal"},{"key":"6725_CR18","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S Madeira","year":"2004","unstructured":"Madeira S, Oliveira A (2004) Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans Comput Biology Bioinf 1:24\u201345","journal-title":"IEEE\/ACM Trans Comput Biology Bioinf"},{"key":"6725_CR19","doi-asserted-by":"crossref","unstructured":"Castanho E\u00a0N, Aidos H, Madeira S\u00a0C (2024) Biclustering data analysis: a comprehensive survey. Brief Bioinf 25:bbae342","DOI":"10.1093\/bib\/bbae342"},{"key":"6725_CR20","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1093\/bioinformatics\/btr464","volume":"27","author":"DS Rodriguez-Baena","year":"2011","unstructured":"Rodriguez-Baena DS, Perez-Pulido A, Aguilar-Ruiz JS (2011) A biclustering algorithm for extracting bit-patterns from binary datasets. Bioinformatics 27:2738\u20132745","journal-title":"Bioinformatics"},{"key":"6725_CR21","doi-asserted-by":"publisher","unstructured":"Silva G, Madeira C, Rui S (2024) A comprehensive survey on biclustering-based collaborative filtering. ACM Comput Surv 56. https:\/\/doi.org\/10.1145\/3674723","DOI":"10.1145\/3674723"},{"key":"6725_CR22","doi-asserted-by":"crossref","unstructured":"de\u00a0Castro P, de\u00a0Franca F, Ferreira H, Von\u00a0Zuben F (2007) Applying biclustering to perform collaborative filtering, 421\u2013426","DOI":"10.1109\/ISDA.2007.91"},{"key":"6725_CR23","doi-asserted-by":"crossref","unstructured":"Symeonidis P, Nanopoulos A, Papadopoulos A, Manolopoulos Y (2008) Nearest-biclusters collaborative filtering based on constant and coherent values. Inf Retrieval 11","DOI":"10.1007\/s10791-007-9038-4"},{"key":"6725_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TETC.2013.2283233","volume":"2","author":"D Zhang","year":"2014","unstructured":"Zhang D et al (2014) Cold-start recommendation using bi-clustering and fusion for large-scale social recommender systems. IEEE Trans Emerg Topics Comput 2:239\u2013250","journal-title":"IEEE Trans Emerg Topics Comput"},{"key":"6725_CR25","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10115-014-0771-x","volume":"44","author":"F Alqadah","year":"2015","unstructured":"Alqadah F, Reddy C, Hu J, Alqadah H (2015) Biclustering neighborhood-based collaborative filtering method for top-n recommender systems. Knowl Inf Syst 44:475\u2013491","journal-title":"Knowl Inf Syst"},{"key":"6725_CR26","doi-asserted-by":"crossref","unstructured":"Desai T, et\u00a0al (2016) An enterprise-friendly book recommendation system for very sparse data, 211\u2013215","DOI":"10.1109\/CAST.2016.7914968"},{"key":"6725_CR27","doi-asserted-by":"crossref","unstructured":"Elnabarawy I, Wunsch D, Abdelbar A (2016) Biclustering artmap collaborative filtering recommender system, 2986\u20132991","DOI":"10.1109\/IJCNN.2016.7727578"},{"key":"6725_CR28","first-page":"18","volume":"142","author":"M Chandralekha","year":"2016","unstructured":"Chandralekha M, Saranya K, Sudha-Sadasivam G (2016) Biclustering based collaborative filtering algorithm for personalized web service recommendation. Int J Comput Appl 142:18\u201324","journal-title":"Int J Comput Appl"},{"key":"6725_CR29","unstructured":"Virnala S, Vivekanandan K (2018) A novel biclustering with mean absolute difference similarity measure for collaborative filtering recommender system. Int J Pure Appl Math 118"},{"key":"6725_CR30","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.jocs.2017.03.018","volume":"25","author":"S Kant","year":"2018","unstructured":"Kant S, Mahara T (2018) Nearest biclusters collaborative filtering framework with fusion. J Comput Sci 25:204\u2013212","journal-title":"J Comput Sci"},{"key":"6725_CR31","unstructured":"Choi S, et\u00a0al (2018) Reinforcement learning based recommender system using biclustering technique"},{"key":"6725_CR32","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.eswa.2018.06.001","volume":"113","author":"M Singh","year":"2018","unstructured":"Singh M, Mehrotra M (2018) Impact of biclustering on the performance of biclustering based collaborative filtering. Expert Syst Appl 113:443\u2013456","journal-title":"Expert Syst Appl"},{"key":"6725_CR33","doi-asserted-by":"crossref","unstructured":"Yoldar M, \u00d6zcan U (2019) Collaborative targeting: Biclustering-based online ad recommendation. Electron Commerce Res Appl 35","DOI":"10.1016\/j.elerap.2019.100857"},{"key":"6725_CR34","doi-asserted-by":"crossref","unstructured":"Bansal S, Baliyan N (2020) Bi-mars: A bi-clustering based memetic algorithm for recommender systems. Appl Soft Comput 97","DOI":"10.1016\/j.asoc.2020.106785"},{"key":"6725_CR35","doi-asserted-by":"crossref","unstructured":"Wu H, Ke G, Wang Y, Chang Y (2022) Prediction on recommender system based on bi-clustering and moth flame optimization. Appl Soft Comput 120","DOI":"10.1016\/j.asoc.2022.108626"},{"key":"6725_CR36","doi-asserted-by":"publisher","first-page":"2204","DOI":"10.17485\/IJST\/v16i29.597","volume":"16","author":"S Kataria","year":"2023","unstructured":"Kataria S, Batra U (2023) Implementation of nearest co-cluster collaborative filtering using a novel similarity index. Indian J Sci Technol 16:2204\u20132216","journal-title":"Indian J Sci Technol"},{"key":"6725_CR37","doi-asserted-by":"crossref","unstructured":"Preli\u0107 A, et\u00a0al (2006) A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 1","DOI":"10.1093\/bioinformatics\/btl060"},{"key":"6725_CR38","doi-asserted-by":"crossref","unstructured":"Li G, Ma Q, Tang H, Paterson A, Xu Y (2009) QUBIC: a qualitative biclustering algorithm for analyses of gene expression data. Nucleic Acids Res 37","DOI":"10.1093\/nar\/gkp491"},{"key":"6725_CR39","first-page":"77","volume":"8","author":"T Murali","year":"2003","unstructured":"Murali T, Kasif S (2003) Extracting conserved gene expression motifs from gene expression data 8:77\u201388","journal-title":"Extracting conserved gene expression motifs from gene expression data"},{"key":"6725_CR40","doi-asserted-by":"crossref","unstructured":"Abbass H\u00a0A, Sarker R\u00a0A, Newton C\u00a0S (2001) ainet: An artificial immune network for data analysis, 231\u2013260","DOI":"10.4018\/978-1-930708-25-9.ch012"},{"key":"6725_CR41","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.neunet.2011.03.020","volume":"24","author":"X Rui","year":"2011","unstructured":"Rui X, Donald C (2011) Bartmap: A viable structure for biclustering. Neural Netw 24:709\u2013716","journal-title":"Neural Netw"},{"key":"6725_CR42","doi-asserted-by":"crossref","unstructured":"Wu H-H, Ke G, Wang Y, Chang Y-T (2022) Prediction on recommender system based on bi-clustering and moth flame optimization. Appl Soft Comput 120:108626","DOI":"10.1016\/j.asoc.2022.108626"},{"key":"6725_CR43","doi-asserted-by":"publisher","unstructured":"Saravanan S, Britto A, Prabin S (2023) Novel k means biclustering fusion based collaborative recommender system. Cloud Data Sci 124:607\u2013616. https:\/\/doi.org\/10.4028\/p-510vfd","DOI":"10.4028\/p-510vfd"},{"key":"6725_CR44","doi-asserted-by":"crossref","unstructured":"Arta I, et\u00a0al (2024) A reinforcement learning recommender system using bi-clustering and markov decision process. Expert Syst Appl 237","DOI":"10.1016\/j.eswa.2023.121541"},{"key":"6725_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-024-06682-w","volume":"81","author":"S Ga","year":"2025","unstructured":"Ga S, Cho PH, Moon GE, Jung S (2025) Efficient gnn-based social recommender systems through social graph refinement. The J Supercomput 81:1\u201324","journal-title":"The J Supercomput"},{"key":"6725_CR46","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.3390\/electronics13101927","volume":"13","author":"J Peng","year":"2024","unstructured":"Peng J et al (2024) Kgcfrec: Improving collaborative filtering recommendation with knowledge graph. Electronics 13:1927","journal-title":"Electronics"},{"key":"6725_CR47","doi-asserted-by":"crossref","unstructured":"Yang H, Yang C (2024) Graph convolutional recommendation system based on bilateral attention mechanism. J Eng","DOI":"10.1155\/2024\/2978680"},{"key":"6725_CR48","doi-asserted-by":"crossref","unstructured":"Park J, Shin Y, Shin W (2024) Turbo-cf: Matrix decomposition-free graph filtering for fast recommendation, 1234\u20131243 (ACM)","DOI":"10.1145\/3626772.3657916"},{"key":"6725_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3728464","volume":"43","author":"Y Qin","year":"2025","unstructured":"Qin Y, Ju W, Gu Y, Zhang M (2025) Polycf: Towards optimal spectral graph filters for collaborative filtering. ACM Trans Inf Syst (TOIS) 43:1\u201325","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"6725_CR50","doi-asserted-by":"crossref","unstructured":"Roy D, Dutta M (2022) A systematic review and research perspective on recommender systems. J Big Data 9","DOI":"10.1186\/s40537-022-00592-5"},{"key":"6725_CR51","doi-asserted-by":"crossref","unstructured":"Feng J, Xia Z, Feng X, Peng J (2021) Rbpr: A hybrid model for the new user cold start problem in recommender systems. Knowl-Based Syst 214","DOI":"10.1016\/j.knosys.2020.106732"},{"key":"6725_CR52","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1007\/s11042-020-09768-8","volume":"80","author":"T Faryad","year":"2021","unstructured":"Faryad T, Majid M, Sajad A (2021) A hybrid recommendation system based on profile expansion technique to alleviate cold start problem. Multimed Tools Appl 80:2339\u20132354","journal-title":"Multimed Tools Appl"},{"key":"6725_CR53","doi-asserted-by":"crossref","unstructured":"Cai D, Qian S, Fang Q, Hu J, Xu C (2023) User cold-start recommendation via inductive heterogeneous graph neural network. ACM Trans Inf Syst 41","DOI":"10.1145\/3560487"},{"key":"6725_CR54","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jpdc.2020.09.009","volume":"147","author":"A Lopez-Fernandez","year":"2021","unstructured":"Lopez-Fernandez A, Rodriguez-Baena D, Gomez-Vela F, Divina F, Garcia-Torres M (2021) A multi-gpu biclustering algorithm for binary datasets. J Parallel Distrib Comput 147:209\u2013219","journal-title":"J Parallel Distrib Comput"},{"key":"6725_CR55","doi-asserted-by":"crossref","unstructured":"Sciarrone F, Yadav U, Duhan N, Bhatia K (2020) Dealing with pure new user cold-start problem in recommendation system based on linked open data and social network features. Mobile Inf Syst 2020","DOI":"10.1155\/2020\/8912065"},{"key":"6725_CR56","doi-asserted-by":"crossref","unstructured":"Harper F, Konstan J (2015) The movielens datasets: History and context. ACM Trans Interact Intell Syst 5","DOI":"10.1145\/2827872"},{"key":"6725_CR57","doi-asserted-by":"crossref","unstructured":"Guo G, Zhang J, Thalmann D, Yorke-Smith N (2014) Etaf: An extended trust antecedents framework for trust prediction, 540\u2013547","DOI":"10.1109\/ASONAM.2014.6921639"},{"key":"6725_CR58","doi-asserted-by":"crossref","unstructured":"Desai M, Ansari N (2023) An innovative method to increase agricultural productivity using machine learning-based crop recommendation systems, IEEE, 645\u2013651","DOI":"10.1109\/ICAISS58487.2023.10250531"},{"key":"6725_CR59","doi-asserted-by":"publisher","first-page":"90847","DOI":"10.1109\/ACCESS.2020.2994222","volume":"8","author":"M Hasnain","year":"2020","unstructured":"Hasnain M et al (2020) Evaluating trust prediction and confusion matrix measures for web services ranking. Ieee Access 8:90847\u201390861","journal-title":"Ieee Access"},{"key":"6725_CR60","first-page":"393","volume":"46","author":"M Kuanr","year":"2021","unstructured":"Kuanr M, Mohapatra P (2021) Assessment methods for evaluation of recommender systems: a survey. Found Comput Dec Sci 46:393\u2013421","journal-title":"Found Comput Dec Sci"},{"key":"6725_CR61","doi-asserted-by":"publisher","first-page":"2174","DOI":"10.21105\/joss.02174","volume":"5","author":"N Hug","year":"2020","unstructured":"Hug N (2020) Surprise: A python library for recommender systems. J Open Source Softw 5:2174","journal-title":"J Open Source Softw"},{"key":"6725_CR62","doi-asserted-by":"publisher","first-page":"629","DOI":"10.3390\/s23020629","volume":"23","author":"N Ukey","year":"2023","unstructured":"Ukey N et al (2023) Survey on exact knn queries over high-dimensional data space. Sensors 23:629","journal-title":"Sensors"},{"key":"6725_CR63","doi-asserted-by":"crossref","unstructured":"Jain K, Jindal R (2023) Sampling and noise filtering methods for recommender systems: A literature review. Eng Appl Artif Intell 122:106129","DOI":"10.1016\/j.engappai.2023.106129"},{"key":"6725_CR64","doi-asserted-by":"crossref","unstructured":"Yan Y, Moreau C, Wang Z, Fan W, Fu C (2024) Transforming movie recommendations with advanced machine learning: A study of nmf, svd, and k-means clustering, IEEE, 178\u2013181.","DOI":"10.1109\/ISCTIS63324.2024.10698876"},{"key":"6725_CR65","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1016\/j.procs.2023.01.096","volume":"218","author":"S Airen","year":"2023","unstructured":"Airen S, Agrawal J (2023) Movie recommender system using parameter tuning of user and movie neighbourhood via co-clustering. Procedia Comput Sci 218:1176\u20131183","journal-title":"Procedia Comput Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06725-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T15:55:29Z","timestamp":1758297329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06725-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":65,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6725"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06725-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,1]]},"assertion":[{"value":"13 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest or ethics. The data used in the document are public and accessible for research purposes.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}},{"value":"The authors declare that they have no conflicts of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"830"}}