📄 772.txt
字号:
发信人: fervvac (高远), 信区: DataMining
标 题: Re: fp of fervvac
发信站: 南京大学小百合站 (Wed Sep 4 02:20:41 2002), 站内信件
The op paper should be this one:
http://www-sal.cs.uiuc.edu/~hanj/pdf/kdd02jliu.pdf
I guess the icdm paper has not been published yet.
【 在 minerboy (miner) 的大作中提到: 】
:
: fervvac (高远) 于Sat Aug 24 11:25:23 2002提到:
:
: Acoording to Prof. Han, their latest OP (opportunistic pruning) algorithms
: is the fatest one for tasks that mine the whole patterns. A recent work
: in ICDM02 could be a rival, as it beats FP by a large margin.
:
: Can u give me the paper,thanks
: yyj@nudt.edu.cn
--
※ 来源:.南京大学小百合站 bbs.nju.edu.cn.[FROM: 饮水思源BBS]
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -