The improvement of PHP algorithm for association rules
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 alg...
Saved in:
| Published in | 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010) Vol. 3; pp. 404 - 407 |
|---|---|
| Main Authors | , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.03.2010
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 1424451922 9781424451920 |
| ISSN | 1948-3414 |
| DOI | 10.1109/CAR.2010.5456721 |
Cover
| Summary: | 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 based 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. |
|---|---|
| ISBN: | 1424451922 9781424451920 |
| ISSN: | 1948-3414 |
| DOI: | 10.1109/CAR.2010.5456721 |