Itemset classified clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3202, Issue , 2004, Pages 398-409

  Sese, Jun ^a   Morishita, Shinichi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b Department of Computational Biology   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; OPTIMIZATION;

CLUSTERING PROCESS; CLUSTERING RESULTS; INTER CLASS; ITEM SETS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; SEARCH SPACES; TRADITIONAL CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 35048831030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_37     Document Type: Article

References (22)

1. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. of ACM SIGMOD 1998, pages 94-105, 1998.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of 20th VLDB, pages 487-499, 1994.
3. R. Bayardo. Efficiently mining long patterns from databases. In Proc. of ACM SIGMOD 1998, pages 85-93, 1998.
4. L. Breiman, R. A. Olshen, J. H. Friedman, and C. J. Stone. Classification and Regression Trees. Brooks/Cole Publishing Company, 1984.
5. Y. Cheng and G. M. Church. Biclustering of expression data. In Proc. of the Eighth Intl. Conf. on ISMB, pages 93-103, 2000.
6. R. J. Cho, M. J. Campbell, et al. A genome-wide transcriptional analysis of the mitotic cell cycle. Molecular Cell, 2:65-73, 1998.
7. J. L. DeRisi, V. R. Iyer, and P. O. Brown. Exploring the metabolic and genetic control of gene expression on a genomic scale. Science, 278:680-686, 1997.
8. M. R. Garey and D. S. Johnson. Computer and Intractability. A Guide to NP-Completeness. W. H. Freeman, 1979.
9. S. Guha, R. Rastogi, and K. Shim. Cure: an efficient clustering algorithm for large databases. In Proc. of ACM SIGMOD 1998, pages 73-84, 1998.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of ACM SIGMOD 2000, pages 1-12, 2000.
11. R. Horst and H. Tuy. Global optimization: Deterministic approaches. Springer-Verlag, 1993.
12. R. S. Michalski and R. E. Stepp. Learning from observation: Conceptual clustering, pages 331-363. Tioga Publishing Company, 1983.
13. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In Proc. of ACM PODS 2000, pages 226-236, 2000.
14. R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In 20th VLDB, pages 144-155, Los Altos, CA 94022, USA, 1994.
15. J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., 1993.
16. J. Sese, Y. Kurokawa, M. Monden, K. Kato, and S. Morishita. Constrained clusters of gene expression profiles with pathological features. Bioinformatics, 2004. in press.
17. J. Sese and S. Morishita. Answering the most correlated n association rules efficiently. In Proc. of PKDD'02, pages 410-422, 2002.
18. P. T. Spellman and other. Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molecular Biology of the Cell, 9:3273-3297, 1998.
19. J. Tantrum, A. Murua, and W. Stuetzle. Hierarchical model-based clustering of large datasets through fractionation and refractionation. In Proc. of the KDD '02, 2002.
20. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proc. of ACM SIGMOD 2002, pages 394-405, 2002.
21. M. Zaki and C. Hsiao. Charm: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, 2002.
22. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: an efficient data clustering method for very large databases. In Proc. of ACM SIGMOD 1996, pages 103-114, 1996.