Fig. 12From: A novel algorithm for fast and scalable subspace clustering of high-dimensional dataIllustration of hTable splitting. For τ=3, Split factor sp=3, minimum large-key value min(K)=1088 and maximum large-key value max(K)=9912, approximate range of expected signature sums is (1088×(τ+1), 9912×(τ+1)). Each signature sum is derived from a dense unit of fixed size = τ+1Back to article page