Reasoning about sets using redescription mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 364-373

  Zaki, Mohammed J ^a   Ramakrishnan, Naren ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b State University   (United States)

Author keywords

Closed itemsets; Data mining; Minimal generators; Redescription

Indexed keywords

ALGORITHMS; CONTEXT FREE LANGUAGES; PROBLEM SOLVING; QUERY LANGUAGES;

CLOSED ITEMSETS; MINIMAL GENERATORS; REDESCRIPTION; RULE MINING;

DATA MINING;

EID: 32344440051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081912     Document Type: Conference Paper

References (13)

1. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In 1st International Conference on Computational Logic, July 2000.
2. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In IEEE Intl. Conf. on Data Engineering, pages pp. 443-452, April 2001.
3. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, 1999.
4. A.P. Gasch, P.T. Spellman, C.M. Kao, O. Carmel-Harel, M.B. Eisen, G. Storz, D. Botstein, and P.O. Brown. Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes. Mol. Biol. Cell, Vol. 11:pages 4241-4257, 2000.
5. L. Nourine and O. Raynaud. A fast algorithm for building lattices. Information Processing Letters, 71: 199-204, 1999.
6. J.L. Pflatz and R.E. Jamison. Closure systems and their structure. Information Sciences, 139:275-286, 2001.
7. N. Ramakrishnan, D. Kumar, B. Mishra, M. Potts, and R.F. Helm. Turning CART wheels: An Alternating Algorithm for Mining Redescriptions. In Proc. KDD'04, pages 266-275, Aug 2004.
8. A. Sturn, J. Quackenbush, and Z. Trajanoski. Genesis: Cluster Analysis of Microarray Data. Bioinformatics, Vol. 18(1):pages 207-208, 2002.
9. J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. In ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, August 2003.
10. J.J. Wyrick, F.C. Holstege, E.G. Jennings, H.C. Causton, D. Shore, M. Grunstein, E.S. Lander, and R.A. Young. Chromosomal Landscape of Nucleosome-Dependent Gene Expression and Silencing in Yeast. Nature, Vol. 402:pages 418-421, 1999.
11. M. J. Zaki. Generating non-redundant association rules. In 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages pp. 34-43, August 2000.
12. M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, pages pp. 457-473, April 2002.
13. M. J. Zaki and C.-J. Hsiao. Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering, 17(4):462-478, April 2005.