FFS - An I/O-efficient algorithm for mining frequent sequences

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2035, Issue , 2001, Pages 294-305

  Zhang, Minghua ^a   Kao, Ben ^a   Yip, Chi Lap ^a   Cheung, David ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

AprioriAll; Data mining; FFS; Sequence

Indexed keywords

ALGORITHMS; COSTS; DATABASE SYSTEMS; ITERATIVE METHODS;

APRIORIALL; APRIORIALL ALGORITHM; FFS; FREQUENT SEQUENCES; ITERATIVE ALGORITHM; SEQUENCE; TRANSACTIONAL DATABASE;

DATA MINING;

EID: 57749091666     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45357-1_32     Document Type: Conference Paper

References (12)

1. Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Proc. of the 11th Int'l Conference on Data Engineering, Taipei, Taiwan, March 1995.
2. Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD Conference on Management of Data, 1997.
3. Ming-Syan Chen, Jong Soo Park, and Philip S. Yu. Eficient data mining for path traversal patterns. IEEE Transactions on Knowledge and Data Engineering, 10(2), March/April 1998.
4. Minos N. Garofalakis, Rajeev Rastogi, and Kyuseok Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK, September 1999.
5. http://www.almaden.ibm.com/cs/quest/.
6. Dao-I Lin and Zvi M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In Proceedings of the 6th Conference on Extending Database Technology (EDBT), Valencia, Spain, March 1998.
7. K.K. Loo, C.L. Yip, Ben Kao, and David Cheung. Exploiting the duality of maxi- mal frequent itemsets and minimal infrequent itemsets for I/O eficient association rule mining. In Proc. of the 11th International Conference on Database and Expert Systems Conference, London, Sept. 2000.
8. S. Parthasarathy, M. J. Zaki, M. Ogihara, and S. Dwarkadas. Incremental and interactive sequence mining. In Proceedings of the 1999 ACM 8th International Conference on Information and Knowledge Management (CIKM'99), Kansas City, MO USA, November 1999.
9. T. Imielinski R. Agrawal and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD International Conference on Management of Data, page 207, Washington, D.C., May 1993.
10. Ramakrishnan Srikant and Rakesh Agrawal. Mining sequential patterns: Gen- eralizations and performance improvements. In Proc. of the 5th Conference on Extending Database Technology (EDBT), Avignion, France, March 1996.
11. Mohammed J. Zaki. Eficient enumeration of frequent sequences. In Proceedings of the 1998 ACM 7th International Conference on Information and Knowledge Management(CIKM'98), Washington, United States, November 1998.
12. Minghua Zhang, Ben Kao, C.L. Yip, and David Cheung. FFS - An I/O eficient algorithm for mining frequent sequences. Technical Report CS Technical Report TR-2000-6, University of Hong Kong, 2000.