apriori.h

来自「apriori算法是数据挖掘的经典算法,它基于关联规则的思想.此为我的第3个收藏」· C头文件 代码 · 共 48 行

H
48
字号
//---------------------------------------------------------------------------#ifndef AprioriH#define AprioriH//---------------------------------------------------------------------------#include "util.h"class Apriori{public:    double m_minSupport;    long necSupport;    ItemSets *m_Ls;    ItemSets *m_samples;    long m_sampleNum;        Apriori()    {        m_minSupport = 0.1;        m_Ls = (ItemSets *)new ItemSets();    };    ~Apriori()    {        delete(m_Ls);    };        void setsupport(double minsupport)    {        m_minSupport = minsupport;    };    void FindLargeItemSets(ItemSets *instances);    ItemSets *singletons();    ItemSets *selfjoin(ItemSets *in, int size);    bool prune(ItemSets *in, ItemSet *attend, int size);    ItemSet *join(ItemSet *first, ItemSet *attend, int size);    bool check(ItemSet *first, ItemSet *attend, int size);};#endif

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?