A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data
Authors:
- H. KriegelHKH. Kriegel
- P. KrogerPKP. Kroger
- M. RenzMRM. Renz
- S. WurstSWS. Wurst
- 5 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 250-257
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Subspace Selection for Clustering High-Dimensional Data2005
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- Density-Connected Subspace Clustering for High-Dimensional Data2004
- Feature selection for clustering - a filter solution2003
- Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data2003
- A Monte Carlo algorithm for fast projective clustering2002
- Adaptive Grids for Clustering Massive Data Sets2001
- Fast algorithms for projected clustering1999
- Comprehensive Identification of Cell Cycle–regulated Genes of the YeastSaccharomyces cerevisiaeby Microarray HybridizationMolecular Biology of the Cell, 1998
- Automatic subspace clustering of high dimensional data for data mining applications1998