Efficient Ming of Top-K Closed Sequences

Journal of Convergence Information Technology

Volumn 5, Issue 5, 2010, Pages

  Songram, Panida ^a  

^a MAHASARAKHAM UNIVERSITY   (Thailand)

Author keywords

Algorithms; Closed sequences; Data mining; Mining methods

Indexed keywords

CLOSED SEQUENCES; COMPACT REPRESENTATION; DATA MINING TASKS; EFFICIENT ALGORITHM; LARGE DATABASE; MINIMUM SUPPORT THRESHOLDS; MINING METHODS; SEQUENCE MINING; SUPPORT THRESHOLD;

DATA MINING; SPECIFICATIONS;

ALGORITHMS;

EID: 78651547984     PISSN: 19759320     EISSN: None     Source Type: Journal    
DOI: 10.4156/jcit.vol5.issue5.19     Document Type: Article

References (15)

1. J. Ayres, J. Gehrke, T. Yiu and J. Flannick, "Sequential pattern mining using bitmaps", In Proc. ofthe 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Canada, July 2002, pp 429-435.
2. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu, "FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining", In Proc. of International Conference Knowledge Discoveryand Data Mining (KDD'00), Boston, MA, Aug. 2000.
3. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M. Hsu, "PrefixSpan: miningsequential patterns efficiently by prefix-projected pattern growth", In Proc. of the 17thinternational conference on data engineering, Heidelberg, Germany, April 2001, pp 215-224.
4. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu, "PrefixSpan:Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth", Proc. 2001 Int. Conf.on Data Engineering (ICDE'01), Heidelberg, Germany, April 2001.
5. J. Wang, and J. Han, "BIDE: Efficient Mining of Frequent Closed Sequences", In Proc. of the 20thInternational Conference of Data Engineering, Boston, USA, 2004, pp. 79-90.
6. M. J. Zaki, "SPADE: An Efficient Algorithm for Mining Frequent Sequences", in MachineLearning Journal, special issue on Unsupervised Learning (Doug Fisher, ed.), pages 31-60, Vol.42 Nos. 1/2, Jan/Feb 2001.
7. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Efficient Mining of Association Rules UsingClosed Itemset Lattices", Journal of Information Systems, Vol. 24, No.1, pp.25-46, 1999.
8. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets forAssociation Rules", In Proc. of 7th International Conference on Database Theory (ICDT 1999), LNCS, Vol. 1540, Springer, Verlag, Jerusalem, Israel, January 1999, pp. 398-416.
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Mining Based for Associate Rules UsingGalois Closed Sets", In Research Report, Computer Science Dept., Nice Sophia AntipolisUniversity.
10. P. Tzvetkov, X. Yan and J. Han, "TSP: Mining Top-K Closed Sequential Patterns", In Proc. of the3rd IEEE International Conference on Data Mining, Nov. 2003, pp. 347-357.
11. P. Tzvetkov, X. Yan and J. Han, "TSP: Mining Top-K Closed Sequential Patterns", Journal ofKnowledge and Information Systems, Vol. 7, Issue 4, pp. 438-457, May 2005.
12. R. Agrawal and R. Srikant, "Mining sequential patterns", In Proc.of the 11 InternationalConference on Data Engineering, Taipei, Taiwan,. 1995, pp. 3-14.
13. R.Bhagwan and B. Lin, "Fast and Scalable Priority Queue Architecture for High-Speed NetworkSwitches" In Proc. of IEEE INFOCOM, pp. 538-547, 2000.
14. R. Srikant, and R. Agrawal, Mining sequential patterns: Generalizations and performanceimprovements. Proc. of the Fifth Int'l Conference on Extending Database Technology (EDBT), March, Avignon, France, Mar. 1996.
15. X. Yan, J. Han and R. Afshar, "CloSpan: mining closed sequential patterns in large datasets", InProc. of the 3rd SIAM international conference on data mining, San Francisco, CA, May 2003, pp166-177.