occlist.cpp

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

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 
Class: OccList

Description: Used to store the occurrence list of a rooted 
ordered pattern tree, for Asai's FREQT algorithm
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#include "OccList.h"


//this prepares for OccLongList, i.e., the new occurrence may be a new leg,
void OccList::insert(int& newTid, const int& newLocation, int& motherId)
{
	occurrence.push_back(make_pair(motherId,newLocation));
	if ( lastTid != newTid ) { //if comes from a new transaction
		lastTid = newTid;
		mySupport++;
	}
}