A fast algorithm for subspace clustering by pattern similarity

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 16, Issue , 2004, Pages 51-60

  Wang, Haixun ^a   Chu, Fang ^b   Fan, Wei ^a   Philip, S Yu ^a   Pei, Jian ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of California   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SEQUENCES; DATA SETS; GENE EXPRESSIONS; VALUE-BASED SIMILARITIES;

ALGORITHMS; COMPUTER SCIENCE; DATA MINING; DATA REDUCTION; DATABASE SYSTEMS; PROBLEM SOLVING; SET THEORY; WORLD WIDE WEB;

PATTERN RECOGNITION;

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

References (22)

1. Alison Abbott. Bioinformatics institute plans public database for gene expression data. Nature, 398:646, 1999.
2. C. C. Aggarwal, C. Procopiuc, J. Wolf, P. S. Yu, and J. S. Park Fast algorithms for projected clustering. In SIGMOD, 1999.
3. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In SIGMOD, pages 70-81, 2000.
4. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Authomatic subspace clustering of high dimensional data for data mining applications. In SIGMOD, 1998.
5. Alvis Brazma, Alan Robinson. Graham Cameron, and Michael Ashburner. One-stop shop for microarray data. Nature, 403:699-700, 2000.
6. P. O. Brown and D. Botstein. Exploring the new world of the genome with DNA microarrays. Nature Genetics, 21:33-37, 1999.
7. C. H. Cheng, A. W. Eu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In SIGKDD, pages 84-93, 1999.
8. Y. Cheng and G. Church. Biclustering of expression data. In. Proc. of 8th International Conference on Intelligent System for Molecular Biology, 2000.
9. P. D'haeseleer, S. Liang, and R. Somogyi. Gene expression analysis and genetic network modeling. In Pacific Symposium on Biocomputing, 1999.
10. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, 1994.
11. G. Gonnet, R. Baeza-Yates, and T. Snider. New indices for text: Pat trees and pat arrays. In Information Retrieval: Data Structures and Algorithms, pages 335-349. Prentice Hall, 1992.
12. H. V. Jagadish, Jason Madar, and Raymond Ng. Semantic compression and pattern extraction with fascicles. In VLDB, pages 186-196, 1999.
13. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal On Computing, pages 935-948, 1993.
14. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
15. Jian Pei, Xiaoling Zhang, Moonjung Cho, Haixun Wang, and Philip S. Yu. Maple: A fast algorithm for maximal pattern-based clustering. In ICDM, 2003.
16. Chang-Shing Perng, Haixun Wang, Sheng Ma, and Joseph L Hellerstein. A framework for exploring mining spaces with multiple attributes. In ICDM, 2001.
17. Chang-Shing Perng, Haixun Wang, Sylvia R. Zhang, and D. Stott Parker. Landmarks: a new model for similarity-based pattern querying in time series databases. In ICDE, pages 33-42, 2000.
18. S. Tavazoie, J. Hughes, M. Campbell, R. Cho, and G. Church. Yeast micro data set. In http://arep.med.harvard.edu/biclustering/yeast.matrix, 2000.
19. Haixun Wang, Sanghyun Park, Wei Fan, and Philip S. Yu. VIST: A dynamic index method for querying XML data by tree structures. In SIGMOD, 2003.
20. Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun Park, and Philip S. Yu. Indexing weighted sequences in large databases. In ICDE, 2003.
21. Haixun Wang, Wei Wang, Jiong Yang, and Philip S. Yu. Clustering by pattern similarity in large data sets. In SIGMOD, 2002.
22. Jiong Yang, Wei Wang, Haixun Wang, and Philip S Yu. δ-clusters: Capturing subspace correlation in a large data set. In ICDE, pages 517-528, 2002.