|
|||||
|
|
| 基于前缀树的模糊关联规则挖掘算法 | |
| 引用本文： | 程江,易云飞,林建辉,余启港.基于前缀树的模糊关联规则挖掘算法[J].计算机工程,2009,35(7):68-69,7. |
| 作者姓名： | 程江 易云飞 林建辉 余启港 |
| 作者单位： | 1. 中南民族大学计算机科学学院,武汉,430074 2. 中南民族大学计算机科学学院,武汉,430074;河池学院计算机与信息科学系,宜州,546300 3. 武汉大学电信工程学院,武汉,430079 |
| 基金项目： | 国家自然科学基金，广西教育科学课题基金 |
| 摘 要： | 针对布尔型关联规则不能表达挖掘对象中模糊信息的关联性，给出一系列有关模糊关联规则的定义，并提出一种基于前缀树的模糊关联规则挖掘算法。通过构造前缀树来压缩存储模糊模式候选集和频繁集，有效地节约了内存开销，且只需扫描数据库2遍。实验结果表明，该算法是有效的。 |
| 关 键 词： | 数据挖掘 关联规则 前缀树 模糊模式 |
| 修稿时间： | |
Mining Algorithm for Fuzzy Association Rules Based on Prefix Tree |
|
| CHENG Jiang,YI Yun-fei,LIN Jian-hui,YU Qi-gang.Mining Algorithm for Fuzzy Association Rules Based on Prefix Tree[J].Computer Engineering,2009,35(7):68-69,7. | |
| Authors: | CHENG Jiang YI Yun-fei LIN Jian-hui YU Qi-gang |
| Affiliation: | 1.School of Computer Science;South Central University for Nationality;Wuhan 430074;2.School of Electronic and Information Engineering;Wuhan University;Wuhan 430079;3.Department of Computer and Information Science;Hechi University;Yizhou 546300 |
| Abstract: | In view of that the boolean association rules can not express the association of fuzzy data, this paper gives a series of definitions of fuzzy association rules and proposes a mining algorithm based on prefix tree for fuzzy association rules.The algorithm can store fuzzy pattern candidate sets and frequent sets compressibly by constructing prefix tree, which effectively saves the memory cost, besides it only scans database twice.The efficiency of the algorithm is verified by the experiment. |
| Keywords: | data mining association rule prefix tree fuzzy pattern |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程》浏览原始摘要信息 | |
| 点击此处可从《计算机工程》下载全文 | |