Mining subspace correlations

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

Volumn , Issue , 2007, Pages 335-342

  Harpaz, Rave ^a   Haralick, Robert ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; CORRELATION METHODS; EMBEDDED SYSTEMS; GENE EXPRESSION; MICROARRAYS; WEB SERVICES;

COLLABORATIVE FILTERING; INFORMATION CARRYING PATTERNS; WEB MINING;

DATA MINING;

EID: 34548779313     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2007.368893     Document Type: Conference Paper

References (19)

1. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, and Prabhakar Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 94-105, 1998.
2. Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, Cecilia Procopiuc, and Jong Soo Park. Fast algorithms for projected clustering. In Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pages 61-72. ACM Press, 1999.
3. Sanjay Goil, Harsha Nagesh, and Alok Choudhary. Mana: Eficient and scalable subspace clustering for very large data sets. Technical Report 9906-010, Northwestern University, June 1999.
4. Lance Parsons, Ehtesham Haque, and Huan Liu. Subspace clustering for high dimensional data: A review. SIGKDD Explorations, Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, 6(1):90-105, 2004.
5. Y. Cheng and G. Church. Biclustering of expression data. In International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
6. Yang et al. δ-clusters: Capturing subspace correlation in a large data set. In ICDE, pages 517-528, 2002.
7. Wang et al. A fast algorithm for subspace clustering by pattern similarity. In SSDBM, 2004.
8. Daniel Lemire and Anna Maclachlan. Slope one predictors for online rating-based collaborative Dltering. In Proceedings of SIAM Data Mining (SDM'05), 2005.
9. Jess S. Aguilar-Ruiz. Shifting and scaling patterns from gene expression data. Bioinformatics, 21(10):3840-3845, 2005.
10. Erdal et al. A time series analysis of microarray data. In BIBE, page 366, 2004.
11. Böhm et al. Computing clusters of correlation connected objects. In ACM SIGMOD, pages 455-466, 2004.
12. Lizhuang Zhao and Mohammed J. Zaki. Microcluster: Eficient deterministic biclustering of microarray data. IEEE Intelligent Systems, 20(6):40-49, 2005.
13. Rave Harpaz and Robert M. Haralick. Exploiting the geometry of gene expression patterns for unsupervised learning. In 18th International Conference on Pattern Recognition (ICPR 2006), volume 2, pages 670-674, 2006.
14. Martin A. Fischler and Robert C. Bolles. Random sample consensus: A paradigm for model setting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381-395, 1981.
15. R. Haralick and R. Harpaz. Linear manifold clustering. In 4th International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM 2005). Springer Verlag, LNAI 3587, pages 132-141, 2005.
16. J. B. MacQueen. Some methods for classincation and analysis of multivariate observations. In Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297. Berkeley, University of California Press, 1967.
17. J. Illingworth and J. Kittler. A survey of the hough transform. Comput. Vision Graph. Image. Process., 44(1):87-116, 1988.
18. Charu C. Aggarwal and Philip S. Yu. Finding generalized projected clusters in high dimensional spaces. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 70-81, 2000.
19. Tavazoie et al. Systematic determination of genetic network architecture. Nature Genetics, 22(3):281-285, 1999.