基于Apriori-遗传混合算法的图书馆借阅记录分析

Yu-Chieh Shen, Jingwen Wang, Xiaobing Yang, Yunkai Lv
{"title":"基于Apriori-遗传混合算法的图书馆借阅记录分析","authors":"Yu-Chieh Shen, Jingwen Wang, Xiaobing Yang, Yunkai Lv","doi":"10.1109/icaice54393.2021.00012","DOIUrl":null,"url":null,"abstract":"The library database system accumulates lots of information resources in the long-term service process. Apriori algorithm mining association rules has low time and space efficiency, resulting in a large number of association rules. Using hybrid Apriori-Genetic algorithm to analyze records can be effective. Firstly, the records are cleaned and preprocessed, and the algorithm is used to analyze records, so as to find the association rules between different types of books borrowed, and then the two algorithms are compared in the the number of association rules and Algorithm time complexity.","PeriodicalId":388444,"journal":{"name":"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Library loan records based on hybrid Apriori- Genetic algorithm\",\"authors\":\"Yu-Chieh Shen, Jingwen Wang, Xiaobing Yang, Yunkai Lv\",\"doi\":\"10.1109/icaice54393.2021.00012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The library database system accumulates lots of information resources in the long-term service process. Apriori algorithm mining association rules has low time and space efficiency, resulting in a large number of association rules. Using hybrid Apriori-Genetic algorithm to analyze records can be effective. Firstly, the records are cleaned and preprocessed, and the algorithm is used to analyze records, so as to find the association rules between different types of books borrowed, and then the two algorithms are compared in the the number of association rules and Algorithm time complexity.\",\"PeriodicalId\":388444,\"journal\":{\"name\":\"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icaice54393.2021.00012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icaice54393.2021.00012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图书馆数据库系统在长期的服务过程中积累了大量的信息资源。Apriori算法挖掘关联规则的时间和空间效率较低,导致存在大量的关联规则。采用Apriori-Genetic混合算法对记录进行分析是有效的。首先对记录进行清理和预处理,利用该算法对记录进行分析,从而找到不同类型借阅图书之间的关联规则,然后比较两种算法在关联规则数量和算法时间复杂度方面的差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Library loan records based on hybrid Apriori- Genetic algorithm
The library database system accumulates lots of information resources in the long-term service process. Apriori algorithm mining association rules has low time and space efficiency, resulting in a large number of association rules. Using hybrid Apriori-Genetic algorithm to analyze records can be effective. Firstly, the records are cleaned and preprocessed, and the algorithm is used to analyze records, so as to find the association rules between different types of books borrowed, and then the two algorithms are compared in the the number of association rules and Algorithm time complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信