Application of Interesting Subspace Mining Algorithm in High-dimensional Data Clustering
Lei Yang · 2007
Based on Chernoff-Hoeffding bound,this paper adopts a novel mining algorithm of depth-first search with backtracking to mine interesting subspace,and testifies the effectiveness by using synthetic and real data.High-dimensional data mining faces the challengers of distributed data sparsity and overlapping feature subspace.