A New Fast Vertical Method for Mining Frequent Patterns

References

• Agrawal , R. , Imielinski , T. and Swami , A. Mining Association Rules Between Sets of Items in Large Databases . proceedings of 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD'93) . pp. 207 – 216 .
   Google Scholar
• Han , J. , Pei , J. and Yin , Y. Mining frequent patterns without candidate generation . proceedings of 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD'00) . pp. 1 – 12 .
   Google Scholar
• Agrawal , R. and Srikant , R. Fast algorithm for mining Association rules . Proceedings of 1994 International Conference on Very Large Data Bases (VLDB'94) . pp. 487 – 499 .
   Google Scholar
• Savasere , A. , Omiecinski , E. and Navathe , S. An efficient algorithm for mining association rules in large databases . Proceedings of 1995 International Conference on Very Large Data Bases (VLDB'95) . pp. 432 – 443 .
   Google Scholar
• Park , J. S. , Chen , M. S. and Yu , P. S. 1997 . Using a hash-based method with transaction trimming for mining association rules . IEEE Transactions on Knowledge and Data Engineering , 9 ( 5 ) : 813 – 824 .
   Web of Science ®Google Scholar
• Shenoy , P. , Haritsa , J. R. , Sundarshan , S. , Bhalotia , G. , Bawa , M. and Shah , D. Turbo-Charging Vertical Mining of Large Databases . Proceedings of 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD'00) . pp. 22 – 33 .
   Google Scholar
• Zaki , M. J. 2000 . Scalable algorithms for association mining . IEEE Transactions on Knowledge and Data Engineering , 12 ( 3 ) : 372 – 390 .
   Web of Science ®Google Scholar
• Zaki , M. J. and Gouda , K. Fast vertical mining using diffsets . Proceedings of 2003 International Conference on Knowledge Discovery and Data Mining (SIGKDD'03) . pp. 326 – 335 .
   Google Scholar
• Liu , G. , Lu , H. , Xu , Y. and Yu , J. X. Ascending Frequency Ordered Prefix-tree: Efficient Mining of Frequent Patterns . Proceedings of 2003 International Conference on Database Systems for Advanced Applications (DASFAA'03) . pp. 65 – 72 .
   Google Scholar
• Han , J. , Pei , J. , Yin , Y. and Mao , R. 2004 . Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach . Data Mining and Knowledge Discovery , 8 : 53 – 87 .
   Web of Science ®Google Scholar
• Woon , Y. K. , Ng , W. K. and Lim , E. P. 2004 . A Support-Ordered Trie for Fast Frequent Pattern Discovery . IEEE Transactions on Knowledge and Data Engineering , 16 ( 7 ) : 875 – 879 .
   Google Scholar
• Grust , T. Accelerating xpath location steps . Proceedings of 2002 ACM SIGMOD international conference on Management of data (SIGMOD'02) . pp. 109 – 120 .
   Google Scholar
• http://fimi.cs.helsinki.fi/data/
   Google Scholar
• http://www.almaden. ibm.com/cs/quest/syndata.html
   Google Scholar
• Wang , J. Y. , Han , J. and Pei , J. CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Patterns . Proceedings of 2003 International Conference on Knowledge Discovery and Data Mining (SIGKDD'03) . pp. 236 – 245 .
   Google Scholar
• Zaki , M. J. and Hsiao , C. J. 2005 . Efficient Algorithm for Mining Closed Patterns and Their Lattice Structure . IEEE Transactions on Knowledge and Data Engineering , 17 ( 4 ) : 462 – 478 .
   Web of Science ®Google Scholar
• Wang , J. Y. , Han , J. , Lu , Y. and Tzvetkov , P. 2005 . TFP: An Efficient Algorithm for Mining Top-k Frequent Closed Patterns . IEEE Transactions on Knowledge and Data Engineering , 17 ( 5 ) : 652 – 664 .
   Google Scholar
• Qiao , S. , Li , T. and Peng , J. 2010 . Parallel Sequential Pattern Mining of Massive Trajectory Data . International Journal of Computational Intelligence Systems , 3 ( 3 ) : 343 – 356 .
   Web of Science ®Google Scholar