The Data Mining Algorithm Analysis for Personalized Service

Liwu Zou, Guangwei Ren
{"title":"The Data Mining Algorithm Analysis for Personalized Service","authors":"Liwu Zou, Guangwei Ren","doi":"10.1109/MINES.2012.220","DOIUrl":null,"url":null,"abstract":"In recent years, the library service has become more and more to meet the requirements of customers personalized service. With the rapid development of computer technology, the use of data mining technology can effectively achieve the goal. in using data mining technology, realization of the algorithm is the key, there are some problems to realize the personalized service in the use of the classical algorithm - Apriorio algorithm. Therefore, I will improve the classical algorithm in this article so that the improved algorithm can realise the individualized service of the library more efficient. The main content of this paper is: Chapter 1: to introduce the library personalized service and understand their requirements. Chapter 2: to introduce the data mining and know it to understand why it can be used to realize the individualized service of the library. Chapter 3: to introduce Data Mining Algorithm for personalized service. To introduce the classical association rules algorithm - Apriori algorithm, through improving its insufficiency, we can use the improved algorithm to realise the personalized service more efficient.","PeriodicalId":208089,"journal":{"name":"2012 Fourth International Conference on Multimedia Information Networking and Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Multimedia Information Networking and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MINES.2012.220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, the library service has become more and more to meet the requirements of customers personalized service. With the rapid development of computer technology, the use of data mining technology can effectively achieve the goal. in using data mining technology, realization of the algorithm is the key, there are some problems to realize the personalized service in the use of the classical algorithm - Apriorio algorithm. Therefore, I will improve the classical algorithm in this article so that the improved algorithm can realise the individualized service of the library more efficient. The main content of this paper is: Chapter 1: to introduce the library personalized service and understand their requirements. Chapter 2: to introduce the data mining and know it to understand why it can be used to realize the individualized service of the library. Chapter 3: to introduce Data Mining Algorithm for personalized service. To introduce the classical association rules algorithm - Apriori algorithm, through improving its insufficiency, we can use the improved algorithm to realise the personalized service more efficient.
个性化服务的数据挖掘算法分析
近年来,图书馆的服务越来越能满足客户的个性化服务要求。随着计算机技术的飞速发展,利用数据挖掘技术可以有效地实现这一目标。在使用数据挖掘技术时,算法的实现是关键,在使用经典算法——Apriorio算法实现个性化服务时存在一些问题。因此,本文将对经典算法进行改进,使改进后的算法能够更有效地实现图书馆的个性化服务。本文的主要内容是:第一章:介绍图书馆个性化服务并了解其需求。第二章:介绍数据挖掘技术,了解数据挖掘技术为什么可以用于实现图书馆的个性化服务。第三章:介绍个性化服务的数据挖掘算法。引入经典的关联规则算法——Apriori算法,通过改进其不足,利用改进后的算法更高效地实现个性化服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信