📄 717.txt
字号:
发信人: fervvac (高远), 信区: DataMining
标 题: Re: 请问Apriori和FP算法到底那个效果好在large data
发信站: 南京大学小百合站 (Sat Aug 31 11:30:11 2002), 站内信件
Well, one lesson I larned is that there is always niche if you are really
into the problem.
A shortcut to the identification of the hidden problems is to implement and
play with the state-of-the-art algorithms by yourself. In this sense, it is
a sad fact that many guys even don't want to implement Apriori by themself!
【 在 jimo (寂寞) 的大作中提到: 】
: 很难有什么突破 了
: 【 在 fervvac (高远) 的大作中提到: 】
: : It is said that the recrusive constrution of the subtree will consume a lot
: : of memory though.
: : Ther are already a few improved algorithms after the introduction of fptree.
: : You guys, if keen on dm, should definitely look at the latest results, :)
--
※ 来源:.南京大学小百合站 bbs.nju.edu.cn.[FROM: 饮水思源BBS]
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -