Title: Method of frequent pattern mining based on mapping hash table
Abstract: Most of the algorithm researches in frequent pattern mining focused on the amelioration of algorithms on logic pro- cess,but explorations on physical storage mode when algorithms were running on computers received much less attention.In this article,a new storage structure used in frequent pattern mining based on FP-Tree is proposed.It uses a sequence storage structure and a hash table which is based on mappings of frequent items’IDs as its header table.A corresponding frequent pattern mining algorithm is proposed.Experiments show that the new storage structure is better than FP-Tree,and the corresponding algorithm is much faster than FP-Growth.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot