Fig. 1From: A novel algorithm for fast and scalable subspace clustering of high-dimensional dataBottom-up clustering. Typical iterative bottom up generation of clusters based on the Apriori-principle. Dense points in 1-dimensional subspace are combined to compute two-dimensional clusters which are then combined to compute three dimensional clusters and so onBack to article page