association.h

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

// AssociationRule.h: interface for the CAssociationRule class.
//如果不生成关联规则，而是只生成频繁项集，则可不用这一个文件
//////////////////////////////////////////////////////////////////////
#include "list.h"
#include "itemSet.h"
////////////////////////////////这里应当会出现重复引用错误********************************************************888***************
typedef struct ARSetOfRules ARRuleSetNode;
struct ARSetOfRules {
    itemSet *m_premise;    //规则前件
    itemSet *m_consequence; //规则后件
	
    double m_support;
    double m_confidence;

    ARRuleSetNode *next;   //下一个规则
};



typedef struct toprulenode TopRule;        ///这是什么东东???
struct toprulenode {
	ARRuleSetNode *prule;
    double m_similarity;
};



class CAssociationRule{

public:
    double m_minConfidence;              //最小置信度

    list *m_LargeItemSets;

    int m_numRules;
    ARRuleSetNode *m_Rules;

	// basic methods for association rule generation
	
    CAssociationRule();
    ~CAssociationRule();
    
    void setconfidence(double minconfidence) { m_minConfidence = minconfidence; };

    void genrules();				

    void ruler(itemSet *Lk, itemSet *Am);
    void add(itemSet *Lk, itemSet *Aminusone, double confidence);

    void save(const char *filename);
    void load(const char *filename);
	
	// advanced methods for association rule testing
	
	itemSet *genRecommendations(itemSet *observed_session, int NumberofTopPages);
	double calSimilarity(itemSet *trace, itemSet *observed_session);
	
	
};