Created with the Web Accessibility Wizard |
MAFIA: Simple Algorithm |
Pseudocode: Simple (Current node C, MFI) { For each item i in C.tail { newNode = C union {i} if newNode is frequent Simple(newNode, MFI) } if (C is a leaf and C.head is not in MFI) Add C.head to MFI } |
Slide Links:
Slide Comments:
Text-Only Version Graphic Version |