Location:
Search - Relim
Search list
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 30955 |
Author: clark |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 34213 |
Author: clark |
Hits:
Description: 数据挖掘中的relim算法,很好的代码,可以挖掘数据库中的关联规则,很有效哦!
Platform: |
Size: 36727 |
Author: 王路漫 |
Hits:
Description: 数据挖掘中的一算法 relim算法,适合数据挖掘初学者借鉴,c语言实现的。简单易懂。-of data mining algorithms relim an algorithm suitable for beginners from data mining, c language to achieve. Simple and understandable.
Platform: |
Size: 36983 |
Author: cxl |
Hits:
Description: 数据挖掘中的一算法 relim算法,适合数据挖掘初学者借鉴,c语言实现的。简单易懂。-of data mining algorithms relim an algorithm suitable for beginners from data mining, c language to achieve. Simple and understandable.
Platform: |
Size: 36864 |
Author: cxl |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 30720 |
Author: clark |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 33792 |
Author: clark |
Hits:
Description: 数据挖掘中的relim算法,很好的代码,可以挖掘数据库中的关联规则,很有效哦!-Relim data mining algorithms, a very good code, you can tap the database of association rules, oh, very effective!
Platform: |
Size: 36864 |
Author: 王路漫 |
Hits:
Description: 文本挖掘中交叉熵算法实现,通过词汇左右出现的概率来计算交叉熵-Text mining cross entropy algorithm,The task of part2of2speech iden t if icat ion is
to au tomat ically assign a part2of2speech tag to an unknow n wo rd w ith emp ty part2of2speech info r2
mat ion. A part2of2speech iden t if icat ion algo rithm based on k2nearest2neighbo rs st rategy is p re2
sen ted in th is paper. The p relim inary experimen t,
Platform: |
Size: 2048 |
Author: mikepeng |
Hits: