Improved FP-Growth algorithm and its applications in the business association

Abstract

The FP-Growth algorithm,based on FP-Tree,needs to create a large number of conditional FP-Trees recursively in the process of mining frequent patterns.It is not efficient and not good to apply in mobile communication business cross-selling,in which the association rules mining is business-constraint.Therefore,an items-constraint frequent pattern tree ICFP-Tree and a new ICFP-Mine algorithm which directly mines in the tree were proposed.Theoretical analysis and experimental results show that the ICFP-Mine algorithm is superior to FP-Growth algorithm in memory occupancy and time costs.It has achieved better results in the field of mobile communication business cross-selling applications.