A minimal perfect hashing scheme to mining association rules from frequently updated data

References

• Agrawal , R. , Imielinski , T. and Swami , A. “Mining Association Rules between the Sets of Items in Large Database,” . 1993 ACM SIGMOD International Conference on Management of Data . Washington, D.C, USA. pp. 207 – 216 .
   Google Scholar
• Agrawal , R. and Shafer , J.C. 1996 . “Parallel Mining of Association Rules,” . IEEE Transactions on Knowledge and Data Engineering , 8 ( 6 ) : 962 – 969 .
   Web of Science ®Google Scholar
• Aggarwal , C.C. and Yu , P.S. 2001 . “A New Approach to Online Generation of Association Rules,” . IEEE Transactions on Knowledge and Data Engineering , 13 ( 4 ) : 527 – 540 .
   Google Scholar
• Aly , H.H. , Amr , A.A. and Taha , Y. “Fast Mining of Association Rules in Large‐Scale Problems,” . Proceedings of the Sixth IEEE Symposium on Computers and Communications . Hammamet, Tunisia. pp. 107 – 113 .
   Google Scholar
• Berry , M.J.A. and Linoff , G. 1997 . Data Mining Techniques: For Marketing, Sales, and Customer Support , New York, , USA : John Wiley & Sons, Inc. .
   Google Scholar
• Chang , C.C. 1984 . “The Study of an Ordered Minimal Perfect Hashing Scheme” . Communications of the ACM , 27 ( 4 ) : 384 – 387 .
   Google Scholar
• Cheung , D.W. , Ng , V.T. , Fu , A.W. and Fu , Y. 1996 . “Efficient Mining of Association Rules in Distributed Databases,” . IEEE Transactions on Knowledge and Data Engineering , 8 ( 6 ) : 911 – 922 .
   Web of Science ®Google Scholar
• Chen , M.S. , Han , J. and Yu , P.S. 1996 . “Data Mining: An Overview from a Database Perspective,” . IEEE Transactions on Knowledge and Data Engineering , 8 ( 6 ) : 866 – 883 .
   Web of Science ®Google Scholar
• Han , E.H. , Karypis , G. and Kumar , V. 2000 . “Scalable Parallel Data Mining for Association Rules,” . IEEE Transactions on Knowledge and Data Engineering , 12 ( 3 ) : 337 – 352 .
   Web of Science ®Google Scholar
• Han , J. and Fu , Y. 2000 . “Mining Multiple‐Level Association Rules in Large Databases,” . IEEE Transactions on Knowledge and Data Engineering , 11 ( 5 ) : 798 – 805 .
   Google Scholar
• Han , J. , Lakshmanan , L.V.S. and Ng , R.T. 1999 . “Constraint‐Based, Multidimensional Data Mining,” . IEEE Computers , : 46 – 50 .
   Google Scholar
• Hipp , J. , Guntzer , U. and Nakhaeizadeh , G. 2000 . “Algorithms for Association Rule Mining‐ A general Survey and Comparison” . ACM SIGKDD Explorations , 2 ( 1 ) : 58 – 64 .
   Google Scholar
• Houtsma , M. and Swami , A. “Set‐Oriented Mining for Association Rules in Relational Databases,” . Proceedings of the 11th International Conference on Data Engineering . Taipei, Taiwan. pp. 25 – 33 .
   Google Scholar
• Liu , B. , Hsu , W. , Chen , S. and Ma , Y. 2000 . “Analyzing the Subjective Interestingness of Association Rules,” . IEEE Intelligent Systems , 15 ( 5 ) : 47 – 55 .
   Web of Science ®Google Scholar
• Pasquier , N. , Bastide , Y. , Taouil , R. and Lakhal , L. “Discovering Frequent Closed Itemsets for Association Rules,” . Proceedings of the 7th International Conference on Database Theory . Jerusalem, Israel. pp. 398 – 416 .
   Google Scholar
• Sarawagi , S. , Thomas , S. and Agrawal , R. “Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications,” . Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data . Seattle, Washington, USA. pp. 343 – 354 .
   Google Scholar
• Soo , J. , Chen , M.S. and Yu , P.S. 1997 . “Using a Hash‐Based Method with Transaction Trimming and Database Scan Reduction for Mining Association Rules,” . IEEE Transactions On Knowledge and Data Engineering , 9 ( 5 ) : 813 – 825 .
   Google Scholar
• Wang , W. , Yang , J. and Yu , P.S. “Efficient Mining of Weighted Association Rules(WAR),” . Proceedings of the Sixth ACM SIGKDD international conference on Knowledge Discovery and Data Mining . Boston, MA, USA. pp. 270 – 274 .
   Google Scholar
• Zaki , M.J. “Generating Non‐Redundant Association Rules,” . Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . Boston, MA, USA. pp. 34 – 43 .
   Google Scholar
• Zaki , M.J. 2000b . “Scalable Algorithms for Association Mining,” . IEEE Transactions on Knowledge and Data Engineering , 12 ( 3 ) : 372 – 390 .
   Web of Science ®Google Scholar
• Zaki , M.J. , Li , S.P.W. and Ogihara , M. “Evaluation of Sampling for Data Mining of Association Rules,” . Proceedings of the Seventh International Workshop on Research Issues in Data Engineering . Birmingham, UK. pp. 42 – 50 .
   Google Scholar
• Zaki , M.J. and Hsiao , C.J. 1999 . “CHARM: An Efficient Algorithm for Closed Association Rule Mining” . In Technical Report , NY, , USA : Computer Science, Rensselaer Polytechnic Institute .
   Google Scholar
• Corresponding author. (Tel: 886–915396558; Fax: 886–6–3017001; Email: [email protected])
   Google Scholar