eclat.h,v

charm是基于垂直数据集挖掘关联规则的一个著名算法

head	1.1;
access;
symbols;
locks
	zaki:1.1; strict;
comment	@ * @;


1.1
date	2001.06.12.16.41.58;	author zaki;	state Exp;
branches;
next	;


desc
@Charm with Hashing.
@


1.1
log
@Initial revision
@
text
@#ifndef __ECLAT_H
#define __ECLAT_H
#include<iostream.h>
#include "assoc.h"
#include "List.h"
#include "Itemset.h"
#include "Array.h"
#include "Graph.h"

#define BOTUP 0
#define HYBRID 1

extern boolean ECLAT_bfs;
extern boolean ECLAT_eqc;
extern int ECLAT_search;
extern Array<int> NumLargeItemset;
extern int maxiter;

extern Array<int> *MaxAry;

class Eqclass: public List<Itemset *>{
public:
   static Itemset *iset;
   static void alloc_tmpiset(int sz);
};
void find_large_bfs(Eqclass *cluster, int iter);
void process_hybrid_main(Eqclass *cluster, int iter);

extern boolean prune2it (int vi, int vj);
extern Eqclass *get_ext_eqclass(int i1, Array<int> *cls, int sort);
extern void process_rhybrid(Eqclass *cluster, int iter);

#endif //__ECLAT_H
@