apriori.h

数据挖掘中的经典算法Apriori实现

// Apriori.h: interface for the CApriori class.
//
//////////////////////////////////////////////////////////////////////
#include "hashTree.h"

class CApriori{

public:

    double m_minSupport;
    long necSupport;

	int pagenum;                      //小项个数

    list *m_Ls;

    list *m_samples;
    long m_sampleNum;                  //数据集中项集个数
    
    CApriori()
    {
        m_minSupport = 0.1;
        m_Ls = (list *)new list();
    };

    ~CApriori()
    {
        delete(m_Ls);
    };
    
    void setsupport(double minsupport)
    {
        m_minSupport = minsupport;
    };

    void FindLargeItemSets(list *instances);
    list *singletons();

    list *selfjoin(list *in, int size);
    bool prune(list *in, itemSet *attend, int size);

    itemSet *join(itemSet *first, itemSet *attend, int size);
    bool check(itemSet *first, itemSet *attend, int size);
};