Tree Mining In Frequent Patterns

Tree Mining in Frequent Patterns

That tree mining algorithm is basically used for stores quantitative information about frequent patterns. In that tree method use root and node structure for declaring tree with different structure. In that tree one root node with set of sub trees as a children. Each node in the sub tree consist of 3 fields-

1.Indicating item name.

2.Count the number of transaction represented by the node.

3.Node links. They indicating links to the next node in frequent tree. 

Algorithm for construct of Frequent pattern tree-

Input- Transaction database Output-Frequent tree

Steps-

1.Scan all database and select frequent item from that.

2.descending order list.

3.Create root and repeat fallowing steps up to final output. Insert tree([P/Q]T)

•where P-First element

•Q-Remaining list. Advantages of Frequent Tree-

1.Database scanned 2 times during construction.

2.Frequent Pattern tree contains all the information related to mining frequent patterns.

Example- 

STEP 1-Arranging database in descending order.

STEP 2-Scan database for second item, order frequent pattern in each transaction.

STEP 3-Construct Frequent tree.