COBBLER: Combining column and row enumeration for closed pattern discovery

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 16, Issue , 2004, Pages 21-30

  Pan, Feng ^a   Tung, Anthony K H ^a   Cong, Gao ^a   Xu, Xin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERNS; FEATURE ENUMERATION METHOD; IBM (CO); SUB-DATASETS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA HANDLING; DATABASE SYSTEMS; NUMBER THEORY; PATTERN RECOGNITION; PROBLEM SOLVING; REDUNDANCY; SET THEORY;

DATA MINING;

EID: 5444270612     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), pages 487-499, Sept 1994.
2. EL Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In Proc. AAAI'94 Workshop Knowledge Discovery in Databases (KDD'94).
3. F. Pan, G. Cong, and A. K. H. Tung. Carpenter: Finding closed patterns in long biological datasets. In Proc. Of ACM-SIGKDD Int'l Conference on Knowledge Discovery and Data Mining, 2003.
4. 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).
5. P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), pages 22-23, Dallas, TX, May 2000.
6. J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent dosed itemsets. In Proc. 2003 ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD'03), Washington, D.C., Aug 2003.
7. M. Zaki. Generating non-redundant association roles. In Proc. 2000 Int. Conf. Knowledge Discovery and Data Mining (KDD'00), 2000.
8. M. Zaki and C. Hsiao. Charm: An efficient algorithm for closed association rule mining. In Proc. of SDM 2002, 2002.
9. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. 1997 Int. Conf. Knowledge Discovery and Data Mining (KDD'97), pages 283-286, Newport Beach, CA, Aug. 1997.