---

Algorithmic Component Functions

Algorithm components (HUTMFI, PEP, etc.). More...

Data Structures
class	TreeNode
Functions
bool	LMFISuperSet (TreeNode *location)
	Check for an existing superset of name in the MFI.
void	AddToFI (TreeNode *C)
	Output itemset (don't need to save bitmaps for FI).
void	AddToMFI (TreeNode *C)
	Add this node's name bitmap to the MFI list.
void	AddToFCI (TreeNode *C)
	Add this node's name bitmap to the FCI list.
int	SortLMFI (int rBegin, int rEnd, int sortBy)
bool	CheckHUTMFI (TreeNode *C, int iTAIL)
	Determine whether a HUTMFI is true.
void	ReorderTail (TreeNode *C, int &iTAIL, bool useComp, bool &NoChild, bool &AllFreq)
	Dynamically reorder the elements in the tail by increasing support - Expand all children and sort by increasing support - Remove infrequent children.
void	NoorderTail (TreeNode *C, int &iTAIL)
	Simply copy over the tail without expanding any of the children for pure DFS (no expansion of all children).
void	MAFIA (TreeNode *C, bool HUT, bool &FHUT, bool useComp)
	The main MAFIA algorithm function.
void	MergeRepeatedItemsets ()
	Merge repeated itemsets into one combined itemset - e.g.

---

Detailed Description

Algorithm components (HUTMFI, PEP, etc.).

---

Function Documentation

void AddToFCI (  TreeNode *    C )

Add this node's name bitmap to the FCI list. Parameters: C  the current node Definition at line 479 of file Mafia.cpp. Referenced by MAFIA().

void AddToFI (  TreeNode *    C )

Output itemset (don't need to save bitmaps for FI). Parameters: C  the current node Definition at line 428 of file Mafia.cpp. Referenced by MAFIA().

void AddToMFI (  TreeNode *    C )

Add this node's name bitmap to the MFI list. Parameters: C  the current node Definition at line 454 of file Mafia.cpp. Referenced by MAFIA().

bool CheckHUTMFI (  TreeNode *    C, int    iTAIL )

Determine whether a HUTMFI is true. if HUT is in MFI, then HUT is frequent and the subtree rooted at this node can be pruned Returns: True if HUT is in the MFI Definition at line 550 of file Mafia.cpp. Referenced by MAFIA().

bool LMFISuperSet (  TreeNode *    location )

Check for an existing superset of name in the MFI. Parameters: location  The node we're at. Use this to examine only the relevant portion of the MFI Returns: True - if superset found. False - if no superset. Definition at line 419 of file Mafia.cpp. Referenced by MAFIA().

void MAFIA (  TreeNode *    C, bool    HUT, bool &    FHUT, bool    useComp )

The main MAFIA algorithm function. Parameters: C  the current node HUT  whether this is a HUT check (left most branch) FHUT  [output] whether the HUT is frequent useComp  if compression has been switched on Definition at line 684 of file Mafia.cpp.

void MergeRepeatedItemsets (    )

Merge repeated itemsets into one combined itemset - e.g. if (transaction set of item 4) AND (transaction set item 5) = (transaction set item 5), then item 5 is a duplicate of item 4 due to increasing support Definition at line 888 of file Mafia.cpp.

void NoorderTail (  TreeNode *    C, int &    iTAIL )

Simply copy over the tail without expanding any of the children for pure DFS (no expansion of all children). Parameters: C  current node iTAIL  index into tail of current node Definition at line 658 of file Mafia.cpp. Referenced by MAFIA().

void ReorderTail (  TreeNode *    C, int &    iTAIL, bool    useComp, bool &    NoChild, bool &    AllFreq )

Dynamically reorder the elements in the tail by increasing support - Expand all children and sort by increasing support - Remove infrequent children. Parameters: C  current node iTAIL  index into tail of current node useComp  whether compressed bitmaps should be used NoChild  whether C has any frequent children AllFreq  whether all children are frequent Definition at line 577 of file Mafia.cpp. Referenced by MAFIA().

int SortLMFI (  int    rBegin, int    rEnd, int    sortBy )

Definition at line 519 of file Mafia.cpp. Referenced by CheckHUTMFI(), and MAFIA().

---