MAFIA: FHUT (Frequent head-union-tail)

FHUT (node C, MFI, BooleanIsHUT) {

For each item i in C.tail {

newNode = C union {i}

IsHUT = whether i is the first item in the tail

if newNode is frequent

FHUT (newNode, MFI, IsHUT)

}

if (IsHUT and tail is frequent)

Stop search and go back up tree

if (C is a leaf and C.head is not in MFI)

Add C.head to MFI

}

{}

{1}

{1,2}

{1,2,3,4}

{1,2,3}

Slide Links:

Slide Comments: