关联规则挖掘算法学习报告(3)

模式识别

this->Ouput(outfile);

//循环生成高项频繁集 while(1) {

this->GenerateAlternative(); this->CountSupport();

this->Generate_ItemSets();

if(this->vec_mutiItem.size()==0) return;

this->Ouput(outfile); } }

//输出一项频繁集到文件中

void Apriori::Ouput1(ostream &outfile) {

for(vector::const_iterator

iter=this->vec_item.begin();iter!=this->vec_item.end();++iter) {

outfile<key<<\<value<

outfile<

//输出高项频繁集到文件中

void Apriori::Ouput(ostream &outfile) {

for(vector::const_iterator

iter=this->vec_mutiItem.begin();iter!=this->vec_mutiItem.end();++iter) {

vector::const_iterator iter2=iter->key.begin(); for(;iter2!=iter->key.end()-1;++iter2) outfile<<*iter2<<\;

outfile<<*iter2<<\<value<

outfile<

#pragma once

#include #include using namespace std;

9

模式识别

struct Item {

string key; int value; };

struct MutiItem {

vector key; int value; };

#include \

MutiItem mutiTemp;

bool unaryPred(MutiItem &item) {

vector vec1=mutiTemp.key; vector vec2=item.key; int count=0;

for(vector::const_iterator

iter=vec2.begin();iter!=vec2.end();++iter) {

if(find(vec1.begin(),vec1.end(),*iter)

return count==vec1.size(); }

#include \

void main() {

Apriori ob;

ifstream infile; //读取数据集

ob.ReadFile(infile,\); ofstream outfile;

outfile.open(\);

//生成所有项频繁集

ob.Generate_AllItemSets(outfile);

10

模式识别

outfile.close();

cout<<\<

11