apriori.h

数据挖掘中Aprior算法的C++实现

// Apriori.h: interface for the CApriori class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_APRIORI_H__964C88FF_476F_46BA_B7A0_5D8C65403BB9__INCLUDED_)
#define AFX_APRIORI_H__964C88FF_476F_46BA_B7A0_5D8C65403BB9__INCLUDED_

#include "List.h"
#include "itemSet.h"

//##ModelId=42E494EF033C
class CApriori{

public:

	//##ModelId=42E494EF033D
    double m_minSupport;
	//##ModelId=42E494EF034B
    long necSupport;

	//##ModelId=42E494EF034C
	int pagenum;

	//##ModelId=42E494EF034E
    List *m_Ls;

	//##ModelId=42E494EF035E
    List *m_samples;
	//##ModelId=42E494EF036B
    long m_sampleNum;
    
	//##ModelId=42E494EF036C
    CApriori()
    {
        m_minSupport = 0.1;
        m_Ls = (List *)new List();
    };

	//##ModelId=42E494EF036D
    ~CApriori()
    {
        delete(m_Ls);
    };
    
	//##ModelId=42E494EF036E
    void setsupport(double minsupport)
    {
        m_minSupport = minsupport;
    };

	//##ModelId=42E494EF037A
    void FindLargeItemSets(List *instances);
	//##ModelId=42E494EF037C
    List *singletons();

	//##ModelId=42E494EF037D
    List *selfjoin(List *in, int size);
	//##ModelId=42E494EF038B
    bool prune(List *in, itemSet *attend, int size);

	//##ModelId=42E494EF0399
    itemSet *join(itemSet *first, itemSet *attend, int size);
	//##ModelId=42E494EF039D
    bool check(itemSet *first, itemSet *attend, int size);
};


#endif // !defined(AFX_APRIORI_H__964C88FF_476F_46BA_B7A0_5D8C65403BB9__INCLUDED_)