Closed constrained gradient mining in retail databases

IEEE Transactions on Knowledge and Data Engineering

Volumn 18, Issue 6, 2006, Pages 764-769

  Wang, Jianyong ^a,b   Han, Jiawei ^a,c,e,f   Pei, Jian ^a,d,g,h  

^a IEEE   (United States)

^b TSINGHUA UNIVERSITY   (China)

^c University of Illinois at Urbana Champaign   (United States)

^d SIMON FRASER UNIVERSITY   (Canada)

^e Executive Committee   (United States)

^f ACM   (United States)

^g Same University   (Canada)

^h ACM SIGKDD   (United States)

Author keywords

Association rule; Data mining; Frequent closed itemset; Gradient pattern

Indexed keywords

ASSOCIATION RULE; FREQUENT CLOSED ITEMSET; GRADIENT PATTERN;

DATA MINING; DATABASE SYSTEMS; X RAY ANALYSIS;

CONSTRAINT THEORY;

EID: 33646407818     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2006.88     Document Type: Article

References (10)

1. C. Bucila, J. Gehrke, D. Kifer, and W. White, "Dualminer: A Dual-Pruning Algorithm for Itemsets with Constraints," Data Mining and Knowledge Discovery, vol. 7, pp. 241-272, 2003.
2. G. Dong, J. Han, J.M.W. Lam, J. Pei, and K. Wang, "Mining Multi-Dimensional Constrained Gradients in Data Cubes," Proc. 2001 Int'l Conf. Very Large Data Bases (VLDB '01), pp. 321-330, Sept. 2001.
3. C. Lucchese, S. Orlando, and R. Perego, "DCI-CLOSED: A Fast and Memory Efficient Algorithm to Mine Frequent Itemsets," Proc. 2004 ICDM Int'l Workshop Frequent Itemset Mining Implementations (FIMI '04), Nov. 2004.
4. J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. 2000 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '00), pp. 1-12, May 2000.
5. R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining and Pruning Optimizations of Constrained Associations Rules," Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 13-24, June 1998.
6. J. Pei, J. Han, and L.V.S. Lakshmanan, "Mining Frequent Itemsets with Convertible Constraints," Proc. 2001 Int'l Conf. Data Eng. (ICDE '01), pp. 433-442, Apr. 2001.
7. T. Uno, M. Kiyomi, and H. Arimura, "LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets," Proc. 2004 ICDM Int'l Workshop Frequent Itemset Mining Implementations (FIMI '04), Nov. 2004.
8. J. Wang, J. Han, and J. Pei, "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), pp. 236-245, Aug. 2003.
9. Y. Xu, J.X. Yu, G. Liu, and H. Lu, "From Path Tree to Frequent Patterns: A Framework for Mining Frequent Patterns," Proc. 2002 Int'l Conf. Data Mining (ICDM '02), pp. 514-521, Dec. 2002.
10. M.J. Zaki and C.J. Hsiao, "CHARM: An Efficient Algorithm for Closed Itemset Mining," Proc. 2002 SIAM Int'l Conf. Data Mining (SDM '02), pp. 457-473, Apr. 2002.