A Novel Text Clustering Approach Using Deep-Learning Vocabulary Network

Algorithm 2

FPMAX-RS.

Procedure FPMAX-RS(T)

Input: T (an FP-tree),

Global:

 MFIT: an MFI-tree

 Head: a linked list of items

Output: The MFIT that contains all MFI’s

Method:

() if only contains a single path P

()  if

()   combine MFI-tree to this path;

()  else

()   insert into MFIT;

() else for each in Header-table of T

()  append to Head;

()  construct the Head-pattern base;

()   Tail = items in ;

()  subset_checking ();

()  if is not in MFI-tree

()   construct the FP-tree ;

()   call FPMAX-RS();

()   remove from Head.