The improvement of PHP algorithm for association rules

Authors:
Yang Huansong;Qin Suntao
Affiliations:
Hangzhou Institute of Service Engineering, Hangzhou Normal University, Hangzhou, Zhejiang, P.R.China;Information School, Zhejiang University of Finance and Economics, Hangzhou, Zhejiang, P.R.China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Year:
2010

Citing 3
Cited 0

Efficient mining of association rules in text databases

Proceedings of the eighth international conference on Information and knowledge management
Data mining: concepts and techniques

Data mining: concepts and techniques
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first step of detecting relating rule is a process at the cost of much system resource, so the total performance of detecting relating rule is determined by this step. The main goal of existing algorithms at present is focused on the efficiency of this step. DHP and PHP are included in those algorithms and these two algorithms are the transmutations of Apriori algorithm to improve its validity. PHP is developed hased on DHP and it saves the CPU running time of DHP effectively. It is useful in improving the efficiency of detecting relating rule in commercial database by developing PHP algorithms to reduce the CPU calculating time.