{"title":"FApriori:一种基于检查点的改进Apriori算法","authors":"M. Patel, Dipti P Rana, R. Mehta","doi":"10.1109/ICISCON.2013.6524172","DOIUrl":null,"url":null,"abstract":"Many Algorithms have been proposed to mine association rule that uses support and confidence as constraint. We are proposing a method that can be combined with Apriori algorithm and reduces storage required to store candidate and the execution time by reducing CPU time. CPU time is saved by reducing candidate sets size and time required to calculate the support of each candidate. We are introducing the concept of checkpoint based on support value to reduce the execution time and overall storage space required to store candidate generated during scanning of dataset.","PeriodicalId":216110,"journal":{"name":"2013 International Conference on Information Systems and Computer Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"FApriori: A modified Apriori algorithm based on checkpoint\",\"authors\":\"M. Patel, Dipti P Rana, R. Mehta\",\"doi\":\"10.1109/ICISCON.2013.6524172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many Algorithms have been proposed to mine association rule that uses support and confidence as constraint. We are proposing a method that can be combined with Apriori algorithm and reduces storage required to store candidate and the execution time by reducing CPU time. CPU time is saved by reducing candidate sets size and time required to calculate the support of each candidate. We are introducing the concept of checkpoint based on support value to reduce the execution time and overall storage space required to store candidate generated during scanning of dataset.\",\"PeriodicalId\":216110,\"journal\":{\"name\":\"2013 International Conference on Information Systems and Computer Networks\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Systems and Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCON.2013.6524172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Systems and Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCON.2013.6524172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
FApriori: A modified Apriori algorithm based on checkpoint
Many Algorithms have been proposed to mine association rule that uses support and confidence as constraint. We are proposing a method that can be combined with Apriori algorithm and reduces storage required to store candidate and the execution time by reducing CPU time. CPU time is saved by reducing candidate sets size and time required to calculate the support of each candidate. We are introducing the concept of checkpoint based on support value to reduce the execution time and overall storage space required to store candidate generated during scanning of dataset.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
