{"title":"基于特征的改进Apriori算法","authors":"Jun Yang, Zhonghua Li, Wei Xiang, Luxin Xiao","doi":"10.1109/CIS.2013.33","DOIUrl":null,"url":null,"abstract":"In the traditional Apriori algorithm, all the database transaction items are equally important. However, in fact, in order to discover more reasonable association rules, different items should be given different importance. In this paper, an improved algorithm based on Apriori algorithm is proposed, in which every transaction item has its own feature(s) to carry more information. With adding feature(s) to these items, when mining the association rules, just those transaction data with same feature(s) will be scanned and computed. Studies and analysis in book recommendation system show that it takes less time cost and gets more reasonable association rules by using the improved algorithm.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An Improved Apriori Algorithm Based on Features\",\"authors\":\"Jun Yang, Zhonghua Li, Wei Xiang, Luxin Xiao\",\"doi\":\"10.1109/CIS.2013.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the traditional Apriori algorithm, all the database transaction items are equally important. However, in fact, in order to discover more reasonable association rules, different items should be given different importance. In this paper, an improved algorithm based on Apriori algorithm is proposed, in which every transaction item has its own feature(s) to carry more information. With adding feature(s) to these items, when mining the association rules, just those transaction data with same feature(s) will be scanned and computed. Studies and analysis in book recommendation system show that it takes less time cost and gets more reasonable association rules by using the improved algorithm.\",\"PeriodicalId\":294223,\"journal\":{\"name\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2013.33\",\"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 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In the traditional Apriori algorithm, all the database transaction items are equally important. However, in fact, in order to discover more reasonable association rules, different items should be given different importance. In this paper, an improved algorithm based on Apriori algorithm is proposed, in which every transaction item has its own feature(s) to carry more information. With adding feature(s) to these items, when mining the association rules, just those transaction data with same feature(s) will be scanned and computed. Studies and analysis in book recommendation system show that it takes less time cost and gets more reasonable association rules by using the improved algorithm.