| 加权最大频繁项目集挖掘算法 |
| |
| 引用本文： | 杨君锐,兰天,刘南艳.加权最大频繁项目集挖掘算法[J].微电子学与计算机,2008,25(6). |
| |
| 作者姓名： | 杨君锐 兰天 刘南艳 |
| |
| 作者单位： | 西安科技大学,计算机科学与技术系,陕西,西安,710054 |
| |
| 基金项目： | 陕西省自然科学基金
,
陕西省教育厅资助项目 |
| |
| 摘 要： | 关联规则是数据挖掘领域的一个重要分支,而发现最大频繁项目集是关联规则挖掘中的重要问题.最大频繁项目集挖掘是在数据库中各属性之间是平等的情况下进行的,但现实中并非如此.频繁模式树(Frequent Pattern Tree,FP-Tree)已不能满足要求.为此提出了一个有效的基于加权FP-Tree的加权最大频繁项目集挖掘算法,其挖掘过程中不需要产生候选项目集.并通过实例说明了此算法的挖掘过程.实验结果表明此算法是有效的并且有较好的扩展性.
|
| 关 键 词： | 数据挖掘 关联规则 加权最大频繁项目集 |
A Mining Algorithm of Weighted Maximum Frequent Itemsets |
| |
| YANG Jun-rui,LAN Tian,LIU Nan-yan.A Mining Algorithm of Weighted Maximum Frequent Itemsets[J].Microelectronics & Computer,2008,25(6). |
| |
| Authors: | YANG Jun-rui LAN Tian LIU Nan-yan |
| |
| Abstract: | Association rules is an important branch of data mining domain.Discovering maximum frequent itemsets is a key problem in mining association rules.The algorithm of discovering maximum frequent itemsets had equal character in the database.It was not different in reality.FP-Tree(Frequent Pattern Tree)do not adapt to need.An effective algo- rithm based on weighted FP-Tree for mining weighted maximum frequent itemsets was presented.It was during the mining without generating candidate itemsets.The algorithm was analysed in an example.Experimental result showed that it had effective and excellent expanding. |
| |
| Keywords: | data mining association rule weighted maximum frequent set |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
