{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:58:29Z","timestamp":1774947509212,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Sichuan Oil and Natural Gas Development Research Center","award":["SKB20-10"],"award-info":[{"award-number":["SKB20-10"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s13042-023-01849-y","type":"journal-article","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:02:07Z","timestamp":1684368127000},"page":"3543-3560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An improved collaborative filtering model based on time weighted correlation coefficient and inter-cluster separation"],"prefix":"10.1007","volume":"14","author":[{"given":"Ruike","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianqian","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,18]]},"reference":[{"issue":"1","key":"1849_CR1","first-page":"58","volume":"14","author":"X Fan","year":"2017","unstructured":"Fan X et al (2017) CASR-TSE: context-aware web services recommendation for modeling weighted temporal-spatial effectiveness. IEEE Trans Serv Comput 14(1):58\u201370","journal-title":"IEEE Trans Serv Comput"},{"issue":"4","key":"1849_CR2","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/s13042-020-01223-2","volume":"12","author":"J Chen","year":"2021","unstructured":"Chen J et al (2021) Dynamic clustering collaborative filtering recommendation algorithm based on double-layer network. Int J Mach Learn Cybern 12(4):1097\u20131113","journal-title":"Int J Mach Learn Cybern"},{"issue":"4","key":"1849_CR3","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TSC.2020.2964552","volume":"13","author":"Z Cui","year":"2020","unstructured":"Cui Z et al (2020) Personalized recommendation system based on collaborative filtering for IoT scenarios. IEEE Trans Serv Comput 13(4):685\u2013695","journal-title":"IEEE Trans Serv Comput"},{"issue":"6","key":"1849_CR4","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.1109\/TKDE.2019.2955100","volume":"33","author":"D Li","year":"2021","unstructured":"Li D et al (2021) Mixture matrix approximation for collaborative filtering. IEEE Trans Knowl Data Eng 33(6):2640\u20132653","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"1849_CR5","doi-asserted-by":"publisher","first-page":"2363","DOI":"10.1109\/TKDE.2016.2566622","volume":"28","author":"J Bu","year":"2016","unstructured":"Bu J et al (2016) Improving collaborative recommendation via user-item subgroups. IEEE Trans Knowl Data Eng 28(9):2363\u20132375","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1849_CR6","doi-asserted-by":"crossref","unstructured":"Yeon-Chang L et al (2016) Exploiting uninteresting items for effective collaborative filtering. 2016 IEEE 32nd International Conference on Data Engineering (ICDE) pp:349-360","DOI":"10.1109\/ICDE.2016.7498253"},{"issue":"2","key":"1849_CR7","first-page":"1","volume":"35","author":"S Wang","year":"2016","unstructured":"Wang S et al (2016) Ranking-oriented collaborative filtering: a listwise approach. ACM Trans Inform Syst (TOIS) 35(2):1\u201328","journal-title":"ACM Trans Inform Syst (TOIS)"},{"issue":"3","key":"1849_CR8","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSC.2015.2479228","volume":"10","author":"X Wu","year":"2017","unstructured":"Wu X et al (2017) Collaborative filtering service recommendation based on a novel similarity computation method. IEEE Trans Serv Comput 10(3):352\u2013365","journal-title":"IEEE Trans Serv Comput"},{"issue":"1","key":"1849_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1504\/IJWMC.2019.10022319","volume":"17","author":"Q Lu","year":"2019","unstructured":"Lu Q et al (2019) User-based collaborative filtering recommendation method combining with privacy concerns intensity in mobile commerce. Int J Wireless and Mobile Comput 17(1):63\u201370","journal-title":"Int J Wireless and Mobile Comput"},{"issue":"2","key":"1849_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s13042-021-01409-2","volume":"13","author":"D Han","year":"2022","unstructured":"Han D et al (2022) Implicit social recommendation algorithm based on multilayer fuzzy perception similarity. Int J Mach Learn Cybern 13(2):357\u2013369","journal-title":"Int J Mach Learn Cybern"},{"issue":"7","key":"1849_CR11","doi-asserted-by":"publisher","first-page":"2678","DOI":"10.1109\/TCYB.2018.2841924","volume":"49","author":"CD Wang","year":"2018","unstructured":"Wang CD et al (2018) Serendipitous recommendation in e-commerce using innovator-based collaborative filtering. IEEE Trans Cybern 49(7):2678\u20132692","journal-title":"IEEE Trans Cybern"},{"key":"1849_CR12","doi-asserted-by":"crossref","unstructured":"Zhang Q et al (2018) Coupledcf: Learning explicit and implicit user-item couplings in recommendation for deep collaborative filtering. IJCAI International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2018\/509"},{"issue":"7","key":"1849_CR13","first-page":"3566","volume":"13","author":"F Xue","year":"2019","unstructured":"Xue F et al (2019) Task allocation of intelligent warehouse picking system based on multi-robot coalition. KSII Trans Internet and Inform Syst (TIIS) 13(7):3566\u20133582","journal-title":"KSII Trans Internet and Inform Syst (TIIS)"},{"key":"1849_CR14","doi-asserted-by":"crossref","unstructured":"Zhang W, Wang J (2015) A collective bayesian poisson factorization model for cold-start local event recommendation. Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining pp:1455-1464","DOI":"10.1145\/2783258.2783336"},{"key":"1849_CR15","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s13042-021-01451-0","volume":"13","author":"L Long","year":"2022","unstructured":"Long L et al (2022) Multi-task learning for collaborative filtering. Int J Mach Learn Cybern 13:1355\u20131368","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"1849_CR16","first-page":"116","volume":"65","author":"S Xiao","year":"2022","unstructured":"Xiao S et al (2022) Lecf: recommendation via learnable edge collaborative filtering. Sci China (Inform Sci) 65(1):116\u2013130","journal-title":"Sci China (Inform Sci)"},{"key":"1849_CR17","doi-asserted-by":"crossref","unstructured":"Lian D et al (2016) Regularized content-aware tensor factorization meets temporal-aware location recommendation. 2016 IEEE 16th international conference on data mining (ICDM) pp:1029-1034","DOI":"10.1109\/ICDM.2016.0131"},{"key":"1849_CR18","doi-asserted-by":"publisher","first-page":"0950","DOI":"10.1016\/j.knosys.2020.106732","volume":"214","author":"J Feng","year":"2021","unstructured":"Feng J et al (2021) RBPR: a hybrid model for the new user cold start problem in recommender systems. Knowl-Based Syst 214:0950\u20137051","journal-title":"Knowl-Based Syst"},{"key":"1849_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ins.2018.01.019","volume":"426","author":"G Guo","year":"2018","unstructured":"Guo G et al (2018) PCCF: periodic and continual temporal co-factorization for recommender systems. Inform Sci 426:56\u201373","journal-title":"Inform Sci"},{"issue":"2","key":"1849_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5447","volume":"32","author":"S Meng","year":"2020","unstructured":"Meng S et al (2020) Temporal-aware and sparsity-tolerant hybrid collaborative recommendation method with privacy preservation. Concurr Comput Pract Exp 32(2):e5447","journal-title":"Concurr Comput Pract Exp"},{"key":"1849_CR21","doi-asserted-by":"crossref","unstructured":"Li, Bin and et al (2011) Cross-domain collaborative filtering over time. Twenty-Second International Joint Conference on Artificial Intelligence","DOI":"10.1109\/ICTAI.2011.184"},{"issue":"1","key":"1849_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TSC.2016.2542805","volume":"11","author":"Z Zhou","year":"2016","unstructured":"Zhou Z et al (2016) Scientific workflow clustering and recommendation leveraging layer hierarchical analysis. IEEE Trans Serv Comput 11(1):169\u2013183","journal-title":"IEEE Trans Serv Comput"},{"issue":"2","key":"1849_CR23","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0219622020500108","volume":"19","author":"P Shanmuga Sundari","year":"2020","unstructured":"Shanmuga Sundari P et al (2020) Integrating sentiment analysis on hybrid collaborative filtering method in a big data environments. Int J Inform Technol Decis Mak 19(2):385\u2013412","journal-title":"Int J Inform Technol Decis Mak"},{"issue":"9","key":"1849_CR24","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1142\/S0218194021500418","volume":"31","author":"AAM Al-Sabaawiand","year":"2021","unstructured":"Al-Sabaawiand AAM et al (2021) A novel overlapping method to alleviate the cold-start problem in recommendation systems. Int J Softw Eng Knowl Eng 31(9):1277\u20131297","journal-title":"Int J Softw Eng Knowl Eng"},{"issue":"2","key":"1849_CR25","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1007\/s11042-020-09768-8","volume":"80","author":"T Faryad","year":"2021","unstructured":"Faryad T et al (2021) A hybrid recommendation system based on profile expansion technique to alleviate cold start problem. Multimed Tools Appl 80(2):2339\u20132354","journal-title":"Multimed Tools Appl"},{"key":"1849_CR26","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.neucom.2015.10.050","volume":"175","author":"A Salah","year":"2016","unstructured":"Salah A et al (2016) A dynamic collaborative filtering system via a weighted clustering approach. Neurocomputing 175:206\u2013215","journal-title":"Neurocomputing"},{"issue":"1","key":"1849_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2007.07.024","volume":"178","author":"HJ Ahn","year":"2008","unstructured":"Ahn HJ (2008) A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem. Inform Sci 178(1):37\u201351","journal-title":"Inform Sci"},{"key":"1849_CR28","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.knosys.2013.11.006","volume":"56","author":"H Liu","year":"2014","unstructured":"Liu H et al (2014) A new user similarity model to improve the accuracy of collaborative filtering. Knowl-Based Syst 56:156\u2013166","journal-title":"Knowl-Based Syst"},{"key":"1849_CR29","first-page":"96","volume":"175","author":"J Deng","year":"2019","unstructured":"Deng J et al (2019) A novel K-medoids clustering recommendation algorithm based on probability distribution for collaborative filtering. Inform Sci 175:96\u2013106","journal-title":"Inform Sci"},{"key":"1849_CR30","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ins.2017.08.008","volume":"418","author":"Y Wang","year":"2017","unstructured":"Wang Y et al (2017) A hybrid user similarity model for collaborative filtering. Inform Sci 418:102\u2013118","journal-title":"Inform Sci"},{"issue":"8","key":"1849_CR31","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2007.1048","volume":"19","author":"L Jing","year":"2007","unstructured":"Jing L et al (2007) An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans Knowl Data Eng 19(8):1026\u20131041","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"1849_CR32","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1109\/TNNLS.2013.2293795","volume":"25","author":"X Huang","year":"2013","unstructured":"Huang X et al (2013) Extensions of kmeans-type algorithms: a new clustering framework by integrating intracluster compactness and intercluster separation. IEEE Trans Neural Netw Learn Syst 25(8):1433\u20131446","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2\u20133","key":"1849_CR33","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10994-010-5177-8","volume":"80","author":"O Shamir","year":"2010","unstructured":"Shamir O et al (2010) Stability and model selection in k-means clustering. Mach Learn 80(2\u20133):213\u2013243","journal-title":"Mach Learn"},{"key":"1849_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.knosys.2014.07.009","volume":"70","author":"X Huang","year":"2014","unstructured":"Huang X et al (2014) DSKmeans: a new kmeans-type approach to discriminative subspace clustering. Knowl-Based Syst 70:293\u2013300","journal-title":"Knowl-Based Syst"},{"key":"1849_CR35","unstructured":"Arthur D et al (2007) k-means ++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp 1027\u20131035"},{"key":"1849_CR36","unstructured":"Pelleg D et al (2000) X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of international conference on machine learning"},{"issue":"1","key":"1849_CR37","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02294206","volume":"49","author":"WS DeSarbo","year":"1984","unstructured":"DeSarbo WS et al (1984) Synthesized clustering: a method for amalgamating alternative clustering bases with differential weighting of variables. Psychometrika 49(1):57\u201378","journal-title":"Psychometrika"},{"issue":"4","key":"1849_CR38","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/TKDE.2011.262","volume":"25","author":"X Chen","year":"2011","unstructured":"Chen X et al (2011) TW-k-means: automated two-level variable weighting clustering algorithm for multiview data. IEEE Trans Knowl Data Eng 25(4):932\u2013944","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1849_CR39","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ins.2021.10.048","volume":"584","author":"A Amir","year":"2022","unstructured":"Amir A et al (2022) Tadaptive explicit kernel minkowski weighted K-means. Inform Sci 584:503\u2013518","journal-title":"Inform Sci"},{"issue":"2","key":"1849_CR40","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1109\/TKDE.2020.2986201","volume":"34","author":"Y Li","year":"2022","unstructured":"Li Y et al (2022) Multi-view k-means clustering with adaptive sparse memberships and weight allocation. IEEE Trans Knowl Data Eng 34(2):816\u2013827","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1849_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107560","volume":"109","author":"K Song","year":"2021","unstructured":"Song K et al (2021) Weighted bilateral K-means algorithm for fast co-clustering and fast spectral clustering(Article). Pattern Recognit 109:107560","journal-title":"Pattern Recognit"},{"key":"1849_CR42","doi-asserted-by":"crossref","unstructured":"Shardanand U (1995) Social information filtering : algorithms for automating \u2019word of Mouth\u2019. Proc. CHI\u201995 Conference on Human Factors in Computing Systems pp:210-217","DOI":"10.1145\/223904.223931"},{"key":"1849_CR43","doi-asserted-by":"crossref","unstructured":"Sarwar B et al (2001) Item-based collaborative filtering recommendation algorithms. Proc. CHI\u201995 Conference on Human Factors in Computing Systems pp:285-295","DOI":"10.1145\/371920.372071"},{"key":"1849_CR44","doi-asserted-by":"crossref","unstructured":"Zhang R, Hu Z (2020) Collaborative filtering recommendation algorithm based on Bee Colony K-means clustering model. Microprocessors and Microsystems pp:103424","DOI":"10.1016\/j.micpro.2020.103424"},{"issue":"3","key":"1849_CR45","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1881\/3\/032050","volume":"1881","author":"J Liu","year":"2021","unstructured":"Liu J et al (2021) A hybrid news recommendation algorithm based on k-means clustering and collaborative filtering. J Phys Conf Ser 1881(3):032050","journal-title":"J Phys Conf Ser"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01849-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-023-01849-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01849-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T05:29:12Z","timestamp":1692682152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-023-01849-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,18]]},"references-count":45,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1849"],"URL":"https:\/\/doi.org\/10.1007\/s13042-023-01849-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,18]]},"assertion":[{"value":"7 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}