{"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}
引用次数: 0
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.