occlonglist.h

包含最大频繁序列的挖掘； 包含层次聚类算法

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 
Header: OccLongList.h
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#ifndef OccLongList_H
#define OccLongList_H

#include "CMRmisc.h"
#include "TextTree.h"
#include "OccList.h"

extern vector<short> currentPath;

using namespace std;

struct pathocc 
{
	int dococ;
	int pathoc;
	int pos;
};

struct OccLongList { //the occurrence list for the FreqTree, i.e., Asai's algorithm
	vector<pathocc > occurrenceLong;
	int lastTid;
	int mySupport;
	
	OccLongList() : lastTid(-1), mySupport(0)
	{
	}
	
	
	void insert(int newdocTid, int newpathTid, int newLocation);
	bool OccLongList::combineList(const OccLongList& mother, const OccList& newNodes);
	void explore(const vector<bool>& isFrequent, 
				 const vector<TextTree>& database,
				 const int& support,
				 map<int, vector< vector<short> > >&  frequency,
				 vector< vector<short> >& maximal,
				 vector< vector<pathocc> >& maximalocclonglist);
};

#endif //OccLongList_H