Clustering gene expression data in SQL using locally adaptive metrics

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

Volumn , Issue , 2003, Pages 35-41

  Papadopoulos, Dimitris ^a   Domeniconi, Carlotta ^b   Gunopulos, Dimitrios ^a   Ma, Sheng ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GEORGE MASON UNIVERSITY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING PROBLEMS; CURSE OF DIMENSIONALITY; DIMENSIONALITY REDUCTION TECHNIQUES; DISTANCE FUNCTIONS; GENE EXPRESSION DATA; HIGH DIMENSIONAL SPACES; HOMOGENEOUS GROUP; INPUT FEATURES; INPUT SPACE; RELATIONAL DBMS; SIMILARITY MEASURE; WEIGHT VECTOR;

GENE EXPRESSION;

DATA MINING;

EID: 77952341457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/882082.882091     Document Type: Conference Paper

References (20)

1. C. Aggarwal, C. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast Algorithms for Projected Clustering. In Proc. ACM SIGMOD, 1999.
2. P. Arabie and L. Hubert. An overview of combinatorial data analysis. Clustering and Classification. World Scientific Pub., pages 5-63, 1996.
3. L. bottou and V. Vapnik. Local Learning algorithms. Neural, Computation, 4 (6):888-900, 1992.
4. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In Proc. VLDB, 2000.)
5. P. Cheeseman and J. Stutz. Bayessian Classification (autoclass): Theory and Results, chapter 6. AAAI/MIT Press, 1996.
6. Y. Cheng and G. M. Church. Biclustering of expression data. In Proc. ISMB, pages 93-103, 2000.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, 39 (1):1-38, 1997.
8. C. Domeniconi. Locally Adaptive Techniques for Patern Classification. PhD thesis, UC Riverside, Aug. 2002.
9. J. G. Dy and C. E. Brodley. Feature Subset Selection and Order Identification for Unsupervised Learning. In Proc. ICML, 2000.
10. M. Ester, H. P. Kriegel, and X. Xu. A database interface for clustering in large spatial databases. In Proc. KDD, 1995.
11. Z. Ghahramani and G. E. Hinton. The EM Algorithm for Mixtures of Factor Analyzers. Technical Report CRG-TR-96-1, Dept. of Computer Science, Univ. of Toronto, 1996.
12. E. Keogh, K. Chakrabarti, S. Mehrotra, and M. Paz-zani. Locally adaptive dimensionality reduction for indexing large time series databases. In Proc. of ACM SIGMOD, 2001.
13. R. Michalski and R. Stepp. Machine Learning: An Artificial Intelligence Approach, chapter 'Learning from observation: Conceptual Clustering'. IOGA Publishing Co., 1983.
14. R. T. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In Proc. of VLDB, 1994.
15. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proc. ACM SIGMOD, 2002.
16. D. G. R. Agrawal, J. Gehrke and P. Raghavan. Automatic Subspace Clustering of High Dimensional Data For Data Mining Applications. In Proceedings of ACM SIGMOD, pages 94-105, June 1998.
17. A. Thomasian, V. Castello, and C. S. Li. Clustering and singular value decomposition for approximate indexing in high dimensional spaces. In Proc. CIKM, 1998.
18. M. E. Tipping and C. M. Bishop. Mixtures of Princi pal Component Analyzers. Neural Computation, 1 (2), 1999.
19. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proc. ACM SIGMOD, 2002.
20. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proc. ACM SIGOD, 1996.