An efficient algorithm for incremental mining of temporal association rules
Data & Knowledge Engineering
| Hi-index | 0.00 |
A new algorithm, which is based on partial support tree (PS_Tree), is proposed to deal with the incremental updating problem when a new database is inserted and the minimum support is not changed. This algorithm use effectively the association rules mined and the partial support tree reserved to improve the performance. It only need scan the updated part of the database once so that the efficiency of algorithm can be further improved . The performance study shows that the algorithm is efficient for incremental updating problems of association rules.