An effective mining approach for up-to-date patterns

Authors:
Tzung-Pei Hong;Yi-Ying Wu;Shyue-Liang Wang
Affiliations:
Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan and Department of Computer Science and Engineering, National Sun Yat-sen Univers ...;Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung, 811, Taiwan;Department of Information Management, National University of Kaohsiung, Kaohsiung 811, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 15
Cited 3

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules

IEEE Transactions on Knowledge and Data Engineering
A Survey of Temporal Knowledge Discovery Paradigms and Methods

IEEE Transactions on Knowledge and Data Engineering
Discovering calendar-based temporal association rules

Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
Database Mining: A Performance Perspective

IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Cyclic Association Rules

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovery of Multiple-Level Association Rules from Large Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining Generalized Association Rules

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Temporal approach to association rule mining using t-tree and p-tree

MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction

ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems

DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets

Expert Systems with Applications: An International Journal
Temporal data mining with up-to-date pattern trees

Expert Systems with Applications: An International Journal
A new method for mining Frequent Weighted Itemsets based on WIT-trees

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

Mining association rules is most commonly seen among the techniques for knowledge discovery from databases (KDD). It is used to discover relationships among items or itemsets. Furthermore, temporal data mining is concerned with the analysis of temporal data and the discovery of temporal patterns and regularities. In this paper, a new concept of up-to-date patterns is proposed, which is a hybrid of the association rules and temporal mining. An itemset may not be frequent (large) for an entire database but may be large up-to-date since the items seldom occurring early may often occur lately. An up-to-date pattern is thus composed of an itemset and its up-to-date lifetime, in which the user-defined minimum-support threshold must be satisfied. The proposed approach can mine more useful large itemsets than the conventional ones which discover large itemsets valid only for the entire database. Experimental results show that the proposed algorithm is more effective than the traditional ones in discovering such up-to-date temporal patterns especially when the minimum-support threshold is high.