| 基于粒计算的多层次关联规则挖掘技术研究 |
| |
| 引用本文： | 孙平安.基于粒计算的多层次关联规则挖掘技术研究[J].吉林师范大学学报（自然科学版）,2012,33(3):77-81. |
| |
| 作者姓名： | 孙平安 |
| |
| 作者单位： | 武夷学院实验室管理中心,福建武夷山,354300 |
| |
| 基金项目： | 2011武夷学院青年教师专项科研基金 |
| |
| 摘 要： | 粒计算理论是一种看待客观世界的世界观和方法论.基于粒计算的多层次关联规则挖掘,引入了粒计算思想,采用多层次化二进制编码表示,只须一次数据集扫描便可获得所有叶节点粒,并能够由子粒的"或"、"与"运算获得父粒和多项集,简化求频繁-项集的求取方法,降低了算法的时间复杂度和空间复杂度提高了算法的效率.
|
| 关 键 词： | 数据挖掘 关联规则 粒计算 多层次化规则挖掘 |
Research on Association Rule Based on Granular Computing |
| |
| SUN Ping-an.Research on Association Rule Based on Granular Computing[J].Jilin Normal University Journal(Natural Science Edition),2012,33(3):77-81. |
| |
| Authors: | SUN Ping-an |
| |
| Institution: | SUN Ping-an(Section of Laboratory Management Center,Wuyi University,Wuyishan 354300,China) |
| |
| Abstract: | Granular computing theory is a view of world and methodology to look at the objective world.Multi-Level association Rule Mining based on Granular Computing—MLAR-Grc,which imports granular computing thought and expressed using multi-Level binary code,can get granulation of all leaves nodes also can get its’parent granulation and multi itemsets using OR and AND operation which Simplify the method of solving frequent k-ItemSets.AR-Grc can reduce time complexity and Space complexity and accordingly improve the efficiency of rule mining. |
| |
| Keywords: | data mining association rule granular computing multi-Level association rule data mining |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
