首页 大数据 Hadoop     /    MapReduce基于物品的协同过滤算法实现影戏推选体系

MapReduce基于物品的协同过滤算法实现影戏推选体系

上传者: weixin_40903057 | 上传时间:2023/5/3 22:57:16 | 文件大小:4.8MB | 文件类型:zip
MapReduce基于物品的协同过滤算法实现影戏推选体系
本文层主若是协同过滤算法实现的影戏推选体系源码,对于应自己博客MapReduce基于物品的协同过滤算法实现影戏推选体系。
驱散巨匠存眷数据迷信,存眷我。
谢谢 本软件ID:11138585

文件下载

资源详情

[{"title":"(62个子文件4.8MB)MapReduce基于物品的协同过滤算法实现电影推荐系统","children":[{"title":"Recommend-master","children":[{"title":"output","children":[{"title":"step5","children":[{"title":"part-r-00000 <span style='color:#111;'>187B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step4_2","children":[{"title":"part-r-00000 <span style='color:#111;'>462B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step2","children":[{"title":"part-r-00000 <span style='color:#111;'>470B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step3_2","children":[{"title":"part-r-00000 <span style='color:#111;'>470B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step4_1","children":[{"title":"part-r-00000 <span style='color:#111;'>1.72KB</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step1","children":[{"title":"part-r-00000 <span style='color:#111;'>174B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"step3_1","children":[{"title":"part-r-00000 <span style='color:#111;'>212B</span>","children":null,"spread":false},{"title":"_SUCCESS <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"img","children":[{"title":"step2-out.png <span style='color:#111;'>5.19KB</span>","children":null,"spread":false},{"title":"step5-out.png <span style='color:#111;'>9.80KB</span>","children":null,"spread":false},{"title":"step3_1-out.png <span style='color:#111;'>9.75KB</span>","children":null,"spread":false},{"title":"theory-7.png <span style='color:#111;'>5.60KB</span>","children":null,"spread":false},{"title":"theory-8.png <span style='color:#111;'>184.90KB</span>","children":null,"spread":false},{"title":"step1-out.png <span style='color:#111;'>4.03KB</span>","children":null,"spread":false},{"title":"4_1-out.png <span style='color:#111;'>9.98KB</span>","children":null,"spread":false},{"title":"step4-out.png <span style='color:#111;'>16.63KB</span>","children":null,"spread":false},{"title":"step4-out-my.png <span style='color:#111;'>16.55KB</span>","children":null,"spread":false},{"title":"step3_2-out.png <span style='color:#111;'>9.68KB</span>","children":null,"spread":false},{"title":"theory-6.png <span style='color:#111;'>17.21KB</span>","children":null,"spread":false},{"title":"mapreduce.jpg <span style='color:#111;'>6.43MB</span>","children":null,"spread":false},{"title":"theory-5.png <span style='color:#111;'>12.66KB</span>","children":null,"spread":false}],"spread":false},{"title":"code","children":[{"title":"recommend","children":[{"title":".project <span style='color:#111;'>420B</span>","children":null,"spread":false},{"title":"src","children":[{"title":"com","children":[{"title":"paradeto","children":[{"title":"recommend","children":[{"title":"SortHashMap.java <span style='color:#111;'>1.67KB</span>","children":null,"spread":false},{"title":"Step3.java <span style='color:#111;'>3.46KB</span>","children":null,"spread":false},{"title":"Step5.java <span style='color:#111;'>4.48KB</span>","children":null,"spread":false},{"title":"Step1.java <span style='color:#111;'>3.32KB</span>","children":null,"spread":false},{"title":"Step4_Update.java <span style='color:#111;'>5.19KB</span>","children":null,"spread":false},{"title":"HDFSFile.java <span style='color:#111;'>3.76KB</span>","children":null,"spread":false},{"title":"Step4_Update2.java <span style='color:#111;'>4.25KB</span>","children":null,"spread":false},{"title":"Recommend.java <span style='color:#111;'>3.73KB</span>","children":null,"spread":false},{"title":"Step2.java <span style='color:#111;'>3.06KB</span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true},{"title":".classpath <span style='color:#111;'>5.06KB</span>","children":null,"spread":false},{"title":"bin","children":[{"title":"com","children":[{"title":"paradeto","children":[{"title":"recommend","children":[{"title":"Step4_Update2.class <span style='color:#111;'>2.56KB</span>","children":null,"spread":false},{"title":"Step1$Step1_ToUserVectorReducer.class <span style='color:#111;'>2.74KB</span>","children":null,"spread":false},{"title":"Step2.class <span style='color:#111;'>2.41KB</span>","children":null,"spread":false},{"title":"Step3$Step32_CooccurrenceColumnWrapperMapper.class <span style='color:#111;'>2.53KB</span>","children":null,"spread":false},{"title":"Step5$Step5_FilterSortReducer.class <span style='color:#111;'>4.67KB</span>","children":null,"spread":false},{"title":"Step4_Update2$Step4_RecommendReducer.class <span style='color:#111;'>3.21KB</span>","children":null,"spread":false},{"title":"Step4_Update$Step4_AggregateReducer.class <span style='color:#111;'>3.99KB</span>","children":null,"spread":false},{"title":"Step3$Step31_UserVectorSplitterMapper.class <span style='color:#111;'>2.97KB</span>","children":null,"spread":false},{"title":"Step5$Step5_FilterSortMapper.class <span style='color:#111;'>3.29KB</span>","children":null,"spread":false},{"title":"Step3.class <span style='color:#111;'>2.70KB</span>","children":null,"spread":false},{"title":"HDFSFile.class <span style='color:#111;'>4.23KB</span>","children":null,"spread":false},{"title":"Step4_Update$Step4_PartialMultiplyMapper.class <span style='color:#111;'>3.62KB</span>","children":null,"spread":false},{"title":"SortHashMap.class <span style='color:#111;'>2.53KB</span>","children":null,"spread":false},{"title":"Step5.class <span style='color:#111;'>2.59KB</span>","children":null,"spread":false},{"title":"Step2$Step2_UserVectorToCooccurrenceMapper.class <span style='color:#111;'>2.93KB</span>","children":null,"spread":false},{"title":"Recommend.class <span style='color:#111;'>3.05KB</span>","children":null,"spread":false},{"title":"SortHashMap$1.class <span style='color:#111;'>1.20KB</span>","children":null,"spread":false},{"title":"Step4_Update.class <span style='color:#111;'>2.64KB</span>","children":null,"spread":false},{"title":"Step4_Update2$Step4_RecommendMapper.class <span style='color:#111;'>2.44KB</span>","children":null,"spread":false},{"title":"Step1$Step1_ToItemPreMapper.class <span style='color:#111;'>2.69KB</span>","children":null,"spread":false},{"title":"Step2$Step2_UserVectorToConoccurrenceReducer.class <span style='color:#111;'>2.41KB</span>","children":null,"spread":false},{"title":"Step1.class <span style='color:#111;'>2.51KB</span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true}],"spread":true},{"title":"README.md <span style='color:#111;'>2.32KB</span>","children":null,"spread":false},{"title":"data","children":[{"title":"small2.csv <span style='color:#111;'>212B</span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明