{"title":"基于强相关的改进数据挖掘算法研究","authors":"Chun-hong Hu, Zhengqiang Wang","doi":"10.1109/WGEC.2008.119","DOIUrl":null,"url":null,"abstract":"The extensive application of association rules in commerce enables itself to be one of the most active research directions in data mining. Recently, the mining of strong correlation item pairs with statistical significance in transaction database receives a certain value. In order to further reduce the cost of testing candidate item pairs in relational database, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve effciency.","PeriodicalId":198475,"journal":{"name":"2008 Second International Conference on Genetic and Evolutionary Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Improved Data-Mining Algorithm Based on Strong Correlation\",\"authors\":\"Chun-hong Hu, Zhengqiang Wang\",\"doi\":\"10.1109/WGEC.2008.119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The extensive application of association rules in commerce enables itself to be one of the most active research directions in data mining. Recently, the mining of strong correlation item pairs with statistical significance in transaction database receives a certain value. In order to further reduce the cost of testing candidate item pairs in relational database, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve effciency.\",\"PeriodicalId\":198475,\"journal\":{\"name\":\"2008 Second International Conference on Genetic and Evolutionary Computing\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Second International Conference on Genetic and Evolutionary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WGEC.2008.119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WGEC.2008.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on Improved Data-Mining Algorithm Based on Strong Correlation
The extensive application of association rules in commerce enables itself to be one of the most active research directions in data mining. Recently, the mining of strong correlation item pairs with statistical significance in transaction database receives a certain value. In order to further reduce the cost of testing candidate item pairs in relational database, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve effciency.