{"title":"个性化推荐的最强关联规则挖掘","authors":"Jie LI , Yong XU , Yun-feng WANG , Chao-hsien CHU","doi":"10.1016/S1874-8651(10)60064-6","DOIUrl":null,"url":null,"abstract":"<div><p>The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.</p></div>","PeriodicalId":101206,"journal":{"name":"Systems Engineering - Theory & Practice","volume":"29 8","pages":"Pages 144-152"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-8651(10)60064-6","citationCount":"12","resultStr":"{\"title\":\"Strongest Association Rules Mining for Personalized Recommendation\",\"authors\":\"Jie LI , Yong XU , Yun-feng WANG , Chao-hsien CHU\",\"doi\":\"10.1016/S1874-8651(10)60064-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.</p></div>\",\"PeriodicalId\":101206,\"journal\":{\"name\":\"Systems Engineering - Theory & Practice\",\"volume\":\"29 8\",\"pages\":\"Pages 144-152\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1874-8651(10)60064-6\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Systems Engineering - Theory & Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874865110600646\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems Engineering - Theory & Practice","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874865110600646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Strongest Association Rules Mining for Personalized Recommendation
The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.