Positive borders or negative borders: How to make lossless generator based representations concise

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 469-473

  Liu, Guimei ^a,b   Li, Jinyan ^a   Wong, Limsoon ^b   Hsu, Wynne ^b  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; DATA PROCESSING; REDUNDANCY; SET THEORY;

FREQUENT ITEMSETS; GENERATOR BASED REPRESENTATIONS; NEGATIVE BORDER; POSITIVE BORDER;

DATA MINING;

EID: 33745439170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.42     Document Type: Conference Paper

References (12)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD Conference, pages 207-216, 1993.
2. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proc. of Computational Logic Conference, pages 972-986, 2000.
3. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Freesets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery Journal, 7(l):5-22, 2003.
4. A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proc. of the 20th PODS Symposium, 2001.
5. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proc. of the 6th PKDD Conference, pages 74-85, 2002.
6. T. Calders and B. Goethals. Minimal k-free representations of frequent sets. In Proc. of the 7th PKDD Conference, pages 71-82, 2003.
7. T. Calders and B. Goethals. Depth-first non-derivable itemset mining. In Proc. of the 2005 SIAM International Data Mining Conference, 2005.
8. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In Proc. of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 2003.
9. M. Kryszkiewicz. Concise representation of frequent patterns based on disjunction-free generators. In Proc. of the 2001 ICDM Conference, pages 305-312, 2001.
10. M. Kryszkiewicz and M. Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In Proc. of the 6th PAKDD Conference, pages 159-171, 2002.
11. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. of the 2nd ACM SIGKDD Conference, pages 189-194, 1996.
12. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of the 7th ICDT Conference, pages 398-416, 1999.