50 Algorithms Every Programmer Should Know - Second Edition by Imran Ahmad

Author:Imran Ahmad [Imran Ahmad]
Language: eng
Format: epub
Publisher: Packt Publishing
Published: 2023-10-16T00:00:00+00:00

Mining Frequent Patterns

The second phase of the FP-growth tree involves mining the frequent patterns from the FP-tree. By creating an ordered tree, the intention is to create an efficient data structure that can be easily navigated to search for frequent patterns.We start from a leaf node (that is, the end node) and move upward—for example, let's start from one of the leaf node items, bat. Then we need to calculate the conditional pattern base for bat. The conditional pattern base is calculated by specifying all the paths from the leaf item node to the top. The conditional pattern base for bat will be as follows:

Wicket: 1 Pads: 1 Helmet: 1

Pad: 1 Helmet: 1

The frequent pattern for bat will be as follows:

{wicket, pads, helmet} : bat{pad,helmet} : bat

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.