本文已被：浏览 1128次 下载 1846次
Received:November 26, 2014 Revised:January 19, 2015
Received:November 26, 2014 Revised:January 19, 2015
中文摘要: 关联挖掘是一种重要的数据分析方法, 提出了一种在全置信度下的增量队列关联挖掘算法模型, 在传统的FP-Growth及PF-Tree算法的关联挖掘中使用了全置信度规则, 算法的适应性得到提升, 由此提出FP4W-Growth算法并运用到对文本数据的关联计算以及对增量式的数据进行关联性挖掘的研究中, 通过实验验证了此算法及模型的可行性与优化性, 为在庞大的文本数据中发现隐藏着的先前未知的并潜在有用的新信息和新模式, 提供了科学的决策方法.
Abstract:Association mining is an important data analysis method, this article proposes an incremental queue association mining algorithm model under full confidence,using the full confidence rules in the traditional FP-Growth and PF-Tree association mining algorithm can improve the algorithm adaptability. Thus, the article proposes FP4W-Growth algorithm, and applies this algotithm to the association calculation of text data and association mining of incremental data. Then this paper conducted verification experiment. The experimental results show the feasibility of this algorithm and model. The article provides a scientific approach to finding hidden but useful information and patterns from large amount of text data.
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| LIU Wei | Management Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China |
| Author Name | Affiliation |
| LIU Wei | Management Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China |
引用文本：
刘炜.基于增量队列的在全置信度下的关联挖掘.计算机系统应用,2015,24(8):133-136
LIU Wei.Association Mining on Massive Text under Full Confidence Based on Incremental Queue.COMPUTER SYSTEMS APPLICATIONS,2015,24(8):133-136
刘炜.基于增量队列的在全置信度下的关联挖掘.计算机系统应用,2015,24(8):133-136
LIU Wei.Association Mining on Massive Text under Full Confidence Based on Incremental Queue.COMPUTER SYSTEMS APPLICATIONS,2015,24(8):133-136
