Analysis & implementation of item based collaboration filtering using K-Medoid

Deepti Mishra, Saroj Hiranwal
{"title":"Analysis & implementation of item based collaboration filtering using K-Medoid","authors":"Deepti Mishra, Saroj Hiranwal","doi":"10.1109/ICAETR.2014.7012829","DOIUrl":null,"url":null,"abstract":"This thesis uses data mining classification algorithm classification algorithms to get useful information to decision-making out of customer ship transaction behaviors. Firstly, by business understanding, data understanding and data preparing, modeling and evaluating we get the results of the two algorithms and by comparing the results, we know that the two algorithms can both be applied in the customer membership card classification model and can obtain a quite accurate result. Then we introduce the application of this model. In classification tree modeling the data is classified to make predictions about new data. Using old data to predict new data has the danger of being too fitted on the old data. But that problem can be solved by pruning methods which decentralizes the modeled tree. This paper describes the use of classification trees and shows two methods of pruning them. An experiment has been set up using different kinds of classification tree algorithms with different pruning methods to test the performance of the algorithms and Pruning methods.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAETR.2014.7012829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This thesis uses data mining classification algorithm classification algorithms to get useful information to decision-making out of customer ship transaction behaviors. Firstly, by business understanding, data understanding and data preparing, modeling and evaluating we get the results of the two algorithms and by comparing the results, we know that the two algorithms can both be applied in the customer membership card classification model and can obtain a quite accurate result. Then we introduce the application of this model. In classification tree modeling the data is classified to make predictions about new data. Using old data to predict new data has the danger of being too fitted on the old data. But that problem can be solved by pruning methods which decentralizes the modeled tree. This paper describes the use of classification trees and shows two methods of pruning them. An experiment has been set up using different kinds of classification tree algorithms with different pruning methods to test the performance of the algorithms and Pruning methods.
基于k - mediid的项目协同过滤分析与实现
本文采用数据挖掘分类算法,从客户船舶交易行为中提取有用的决策信息。首先,通过业务理解、数据理解和数据准备、建模和评估得到了两种算法的结果,并通过结果的比较,我们知道这两种算法都可以应用到客户会员卡分类模型中,并且可以得到比较准确的结果。然后介绍了该模型的应用。在分类树建模中,对数据进行分类以对新数据进行预测。使用旧数据来预测新数据有过于接近旧数据的危险。但这个问题可以通过修剪方法来解决,这种方法使建模树分散。本文描述了分类树的使用,并给出了两种修剪分类树的方法。利用不同的分类树算法和不同的剪枝方法,建立了一个实验来测试算法和剪枝方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信