基于1NF强相关项对的挖掘算法研究

2011 International Conference on Future Computer Science and Education Pub Date : 2011-08-20 DOI:10.1109/ICFCSE.2011.135

Luo Mingying

{"title":"基于1NF强相关项对的挖掘算法研究","authors":"Luo Mingying","doi":"10.1109/ICFCSE.2011.135","DOIUrl":null,"url":null,"abstract":"In order to reduce the computation cost of candidate pairs, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve efficiency. Experimental results exhibit that the new algorithm is well worked in the mining of all-strong-pairs. So it is more suitable for real relation database system.","PeriodicalId":279889,"journal":{"name":"2011 International Conference on Future Computer Science and Education","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research of Mining Algorithm Based on 1NF Strongly Correlated Item Pair\",\"authors\":\"Luo Mingying\",\"doi\":\"10.1109/ICFCSE.2011.135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to reduce the computation cost of candidate pairs, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve efficiency. Experimental results exhibit that the new algorithm is well worked in the mining of all-strong-pairs. So it is more suitable for real relation database system.\",\"PeriodicalId\":279889,\"journal\":{\"name\":\"2011 International Conference on Future Computer Science and Education\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Future Computer Science and Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFCSE.2011.135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Future Computer Science and Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFCSE.2011.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

为了减少候选对的计算量，我们根据1NF的性质开发了锥算法。提出的TaperR算法可以减少候选对的数量，提高效率。实验结果表明，新算法在全强对挖掘中表现良好。因此它更适合于实际的关系型数据库系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Research of Mining Algorithm Based on 1NF Strongly Correlated Item Pair

In order to reduce the computation cost of candidate pairs, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve efficiency. Experimental results exhibit that the new algorithm is well worked in the mining of all-strong-pairs. So it is more suitable for real relation database system.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 International Conference on Future Computer Science and Education

自引率

0.00%

发文量