Closed multidimensional sequential pattern mining

Proceedings - Third International Conference onInformation Technology: New Generations, ITNG 2006

Volumn 2006, Issue , 2006, Pages 512-517

  Songram, Panida ^a   Boonjing, Veera ^a   Intakosum, Sarun ^a  

^a KING MONGKUT'S INSTITUTE OF TECHNOLOGY LADKRABANG   (Thailand)

Author keywords

Closed pattern mining; Data mining; Multidimensional pattern mining

Indexed keywords

COMPUTER ARCHITECTURE; INFORMATION ANALYSIS; MULTIPROGRAMMING; PATTERN RECOGNITION;

CLOSED PATTERN MINING; MULTIDIMENSIONAL PATTERN MINING; SEQUENTIAL PATTERN MINING;

DATA MINING;

EID: 33750827259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2006.41     Document Type: Conference Paper

References (19)

1. C. Lucchese, S. Orlando and R. Perego, "DCI-CLOSED: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets," In Proc. of IEEE ICDM workshop on Frequent Itemset Mininig Implemention (FIMF04), Vol. 126, Brighton, UK, November 2004.
2. th Int'l Conference on Extending Database Technology (EDBT'98), pp. 105-119, Valencia, Spain, March 1998.
3. H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen and U. Dayal, Multi-dimensional Sequential Pattern Mining, M. Sc. Thesis, Simon Fraser University, Canada, April 2001.
4. J. Han, J. Pei, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M-C. Hsu, "PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth," In Proc. 2001 Int. Conf. Data Engineering (ICDE'01), pp. 215-224, Heidelberg, Germany, April 2001.
5. J. Han, J. Pei and Y. Yin, "Mining Frequent Patterns without Candidate Generation," In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), pp.1-12, Dallas, TX, May 2000.
6. J. Han, J. Wang, Y. Lu and P. Tzvetkov, "Mining Top-k Frequent Closed Patterns without Minimum Support," In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pp. 211-218, Maebahi, Japan, December 2002.
7. J. Pei, J. Han and R. Mao, "CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets," In Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD'00), pp. 21-30, May 2000.
8. th Int. Conf. on Data Engineering (ICDE'04), pp. 79-90, Boston, MA, USA, April 2004.
9. th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD'03), pp. 236-245, Washington, DC, August 2003.
10. K. Beyer and R. Ramakrishnan, "Bottom-up computation of sparse and iceberg cubes," In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), pp. 359-370, Philadelphia, Pennsylvnia, USA, June 1999.
11. L. Li, D. Zhai and F. Jin, "GRG: An Efficient Method for Association Rules Mining on Frequent Closed Itemsets," In Proc. of the 2003 IEEE Int. Sym. on Intelligent Control (ISIC'03), pp. 854-859, Houston, Texas, October 2003.
12. M.J. Zaki and C.J. Hsiao, "CHARM: An Efficient Algorithm for Closed Itemsets Mining," In Proc. 2002 SAIM Int. Conf. Data Mining (SDM'02), pp. 457-473, Arlington, VA, April 2002.
13. th Int. Conf. on Database Theory(ICDT'99), pp. 398-416, Jerusalem, Israel, January 1999.
14. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, "Efficient Mining of Association Rules Using Closed Itemset Lattices," Journal of Information Systems, Vol. 24, No.1, pp. 25-46, 1999.
15. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Mining Based for Associate Rules using Galois Closed Sets," In Research Report, Computer Science Dept., Nice Sophia Antipolis University, 2000.
16. rd IEEE Int. Conf. on Data Mining (ICDM'03), pp. 347-354, Melbourne, Florida, USA, December 2003.
17. R. Afshar, Mining Frequent Max and Closed Sequential Patterns, M. Sc. Thesis, University of Alberta, Alberta, 2000.
18. th Int. Conf. on Data Engineering (ICDE'03), pp. 714-716, Bangalore, India, March 2003.
19. X. Yan, J. Han and R. Afshar, "Clospan: Mining Closed Sequenctial Patterns in Large Database," In Proc. 2003 SIAM Int. Conf. Data Mining (SDM'03), pp. 166-177, San Francisco, CA, May 2003.