全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种挖掘最大频繁集的算法*

, PP. 661-666

Keywords: 关联规则,最大频繁集,最小支持数最小组合算法(MSMCA),重复数列中最小支持数最小组合(MSMCRA)

Full-Text   Cite this paper   Add to My Lib

Abstract:

挖掘频繁项目集是关联规则应用中的关键问题.目前挖掘频繁集主要有Apriori算法和频繁树法两大类.本文提出与上述两类算法完全不同的高效挖掘最大频繁集的算法:最小支持数最小组合算法(MSMCA).该算法不产生候选频繁集,能较大减少计算量的开销.此外,在此算法的研究中,本文提出另一个子课题:重复数列中最小支持数最小组合算法研究.

References

[1]  Agrawal R,Imielinski T,Swami A. Mining Association Rules between Sets of Items in Large Databases // Proc of the ACM SIGMOD International Conference on Management of Data. Washington, USA, 1993: 207-216
[2]  Lu Songfeng, Lu Zhengding. Fast Mining Maximum Frequent Itemsets. Journal of Software, 2001, 12(2): 293-297 (in Chinese) (路松峰,卢正鼎.快速开采最大频繁项目集.软件学报, 2001, 12(2): 293-297)
[3]  Song Yuqin, Zhu Yuquan, Sun Zhihui, et al. An Algorithm and Its Updating Algorithm Based on FPTree for Mining Maximum Frequent Itemsets. Journal of Software, 2003, 14(9): 1586-1592 (in Chinese) (宋余庆,朱玉全,孙志挥,等.基于FPTree的最大频繁项目集挖掘及更新算法.软件学报, 2003, 14(9): 1586-1592)
[4]  Han Jiawei, Kamber M. Data Mining:Concepts and Techniques. Orlando, USA: Morgan Kaufmann, 2001
[5]  Jr Bayardo R J. Efficiently Mining Long Patterns from Databases //Proc of the ACM SIGMOD International Conference on Management of Data. Seattle, USA, 1998: 85-93
[6]  Yang Ming, Sun Zhihui, Ji Genlin. Fast Mining of Global Frequent Itemsets. Journal of Computer Research and Development, 2003, 40(4): 620-626 (in Chinese) (杨 明,孙志挥,吉根林.快速挖掘全局频繁项目集.计算机研究与发展, 2003, 40(4): 620-626)
[7]  Zhu Yuquan, Sun Zhihui, Zhao Chuanshen. Fast Updating Frequent Itemsets. Journal of Computer Research and Development, 2003, 40(1): 94-99 (in Chinese) (朱玉全,孙志挥,赵传申.快速更换频繁项集.计算机研究与发展, 2003, 40(1): 94-99)
[8]  Ji Genlin, Yang Ming, Song Yuqing, et al. The Fast Updating Maximum Frequent Itemsets. Chinese Journal of Computers, 2005, 28(1): 128-135 (in Chinese) (吉根林,杨 明,宋余庆,等.最大频繁项目集的快速更新.计算机学报, 2005, 28(1): 128-135)
[9]  Lu Jieping, Yang Ming, Sun Zhihui, et al. Fast Mining of Global Maximum Frequent Itemsets. Journal of Software, 2005, 16(4): 553-560 (in Chinese) (陆介平,杨 明,孙志恽,等.快速挖掘全局最大频繁项目集.软件学报, 2005, 16(4): 553-560)
[10]  Han Jiawei, Jian Pei, Yin Yiwen. Mining Frequent Patterns without Candidate Generation // Proc of the ACM SIGMOD International Conference on Management of Data. Dallas, USA, 2000: 1-12
[11]  Yang Ming, Sun Zhihui, Song Yuqing. Fast Updating of Globally Frequent Itemsets. Journal of Software, 2004, 15(8): 1993-1998 (in Chinese) (杨 明,孙志恽,宋余庆.快速更新全局频繁项目集.软件学报, 2004, 15(8): 1993-1998)
[12]  Liu Junqiang, Sun Xiaoying, Wang Xun, et al. The New Method in Mining Maximum Frequent Itemsets. Chinese Journal of Computers, 2004, 27(10): 1327-1334 (in Chinese) (刘君强,孙晓莹,王 勋,等.挖掘最大频繁模式的新方法.计算机学报, 2004, 27(10): 1327-1334)

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133