33.txt

This complete matlab for neural network

发信人: GzLi (笑梨), 信区: DataMining
标  题: [合集]请问Apriori和FP算法到底那个效果好在large database
发信站: 南京大学小百合站 (Fri Aug 23 23:03:51 2002), 站内信件

highso (漫步者) 于Wed Aug 21 11:19:13 2002提到：

rt


jimo (寂寞) 于Wed Aug 21 13:00:30 2002提到：

呵呵
哪个好自己实现一下不就行了



mining (key) 于Wed Aug 21 21:13:28 2002)
提到：

Since the FP algorithm is developed for  large data sets, as to a very large d
ate collection,FP algorithm shoud work much faster than Apriori one


luoes (luoes) 于Fri Aug 23 20:12:30 2002提到：

自然是fp-tree更好，它只需遍历一次数据库，而apriori算法要N次
在大数据集上自然fp－tree好，



jimo (寂寞) 于Fri Aug 23 21:35:17 2002提到：

哎哎
但是fptree 还要递归呢