Using transposition for pattern discovery from microarray data

Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD '03

Volumn , Issue , 2003, Pages 73-79

  Rioult, François ^a   Boulicaut, Jean François ^b   Crémilleux, Bruno ^a   Besson, Jérémy ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; CLOSED SET; CONDENSED REPRESENTATIONS; EXTRACTION TECHNIQUES; FREQUENT ITEMSET; GALOIS CONNECTION; MICROARRAY DATA; MICROARRAY DATA SETS; PATTERN DISCOVERY;

DATA MINING; GENE EXPRESSION;

MATRIX ALGEBRA;

EID: 24144503059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/882082.882099     Document Type: Conference Paper

References (18)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
2. M. Arbeitman, E. Furlong, F. Imam, E. Johnson, B. Null, B. Baker, M. Krasnow, M. P. Scott, R. Davis, and K. P. White. Gene expression during the life cycle of drosophilia melanogaster. Science, 297, 2002.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2 (2):66-75, Dec. 2000.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In Proceedings ACM SIGMOD'98, pages 85-93, Seattle, Washington, USA, 1998. ACM Press.
5. C. Becquet, S. Blachon, B. Jeudy, J.-F. Boulicaut, and O. Gandrillon. Strong association rule mining for large gene expression data analysis: a case study on human SAGE data. Genome Biology, 12, 2002.
6. J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proceedings PAKDD'00, volume 1805 of LNAI, pages 62-73, Kyoto, JP, Apr. 2000. Springer-Verlag.
7. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by mean of free-sets. In Proceedings PKDD'00, volume 1910 of LNAI, pages 75-85, Lyon, F, Sept. 2000. Springer-Verlag.
8. 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 (1):5-22, 2003.
9. R. Godin, R. Missaoui, and H. Alaoui. Incremental algorithms based on galois (concepts) lattices. Computational Intelligence, 11 (2):246-267, 1995.
10. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery journal, 1 (3):241-258, 1997.
11. T. M. Mitchell. Generalization as search. Artificial Intelligence, 18:203-226, 1982.
12. C. Niehrs and N. Pollet. Synexpression groups in eukaryotes. Nature, 402:483-487, 1999.
13. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24 (1):25-46, Jan. 1999.
14. J. Pei, J. Han, and R. Mao. CLOSET an efficient algorithm for mining frequent closed itemsets. In Proceedings ACM SIGMOD Workshop DMKD'00, Dallas, USA, May 2000.
15. C. Robardet, F. Rioult, S. Blachon, B. Crémilleux, O. Gandrillon, and J.-F. Boulicaut. Mining closed sets of genes from SAGE expression matrices: a spectacular improvement. Technical report, LIRIS INSA Lyon, F-69622 Villeurbanne, March 2003.
16. S. Rome, K. Clément, R. Rabasa-Lhoret, E. Loizon, C. Poitou, G. S. Barsh, J.-P. Riou, M. Laville, and H. Vidal. Microarray profiling of human skeletal muscle reveals that insulin regulates 800 genes during an hyperinsulinemic clamp. Journal of Biological Chemistry, March 2003. In Press.
17. R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered sets, pages 445-470. Reidel, 1982.
18. M. J. Zaki. Generating non-redundant association rules. In Proceedings ACM SIGKDD'00, pages 34-43, Boston, USA, Aug. 2000. AAAI Press.