📄 649.txt
字号:
发信人: GzLi (笑梨), 信区: DataMining
标 题: Re: 这个,有没有了解Tree based Ass rule Data Mini
发信站: 南京大学小百合站 (Fri May 10 12:48:11 2002), 站内信件
mecool大作中提到的论文已经上载。
Fernando Berzal,etc.
TBAR: An efficient method for association rule mining in relational databases,
data&knowledge engineering 37(2001)
已经上载到本板上载区。
【 在 mecool (mecool) 的大作中提到: 】
: The author claimed that it is much more effective than Apriori...
: of course it is based on Apriori algorithm....
: They refer to a new potentially interesting itemsets(relvant itemsets) instead
: of frequent itemsets and use a hash tree to store the nodes...
: All the above are the abstact of that paper which the teacher give me...
: if you are interested in it...i will send u...
: So just give me reply, thx
: 【 在 fervvac 的大作中提到: 】
: : What's that? The problem definition and, any reference?
: : 【 在 mecool (mecool) 的大作中提到: 】
--
GzLi如是说:
Joy and pain are coming and going both
Be kind to yourself and others.
welcome to DataMining http://DataMining.bbs.lilybbs.net
welcome to Matlab http://bbs.sjtu.edu.cn/cgi-bin/bbsdoc?board=Matlab
※ 修改:.GzLi 於 May 10 13:10:10 修改本文.[FROM: 211.80.38.29]
※ 来源:.南京大学小百合站 bbs.nju.edu.cn.[FROM: 211.80.38.29]
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -