Generalized closed itemsets for association rule mining

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 714-716

  Pudi, Vikram ^a   Haritsa, Jayant R ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA MINING; KNOWLEDGE BASED SYSTEMS; REDUNDANCY; RESPONSE TIME (COMPUTER SYSTEMS);

BOOLEAN ASSOCIATION RULE MINING; GENERALIZED CLOSED ITEMSET;

DATABASE SYSTEMS;

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

References (5)

1. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of Intl. Conference on Database Theory (ICDT), Jan. 1999.
2. V. Pudi and J. Haritsa. Generalized closed itemsets: Improving the conciseness of rule covers. Technical Report RT-2002-02, DSL, Indian Institute of Science, 2002.
3. V. Pudi and J. Haritsa. On the efficiency of association-rule mining algorithms. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), May 2002.
4. R. Taouil, N. Pasquier, Y. Bastide, and L. Lakhal. Mining basis for association rules using closed sets. In Intl. Conf. on Data Engineering (ICDE), Feb. 2000.
5. M. J. Zaki. Generating non-redundant association rules. In Intl. Conf. on Knowledge Discovery and Data Mining (KDD), Aug. 2000.