Block Model Guided Unsupervised Feature Selection
share
Feature selection is a core area of data mining with a recent innovation of graph-driven unsupervised feature selection for linked data. In this setting we have a dataset 𝐘 consisting of n instances each with m features and a corresponding n node graph (whose adjacency matrix is 𝐀) with an edge indicating that the two instances are similar. Existing efforts for unsupervised feature selection on attributed networks have explored either directly regenerating the links by solving for f such that f(𝐲_i,𝐲_j) ≈𝐀_i,j or finding community structure in 𝐀 and using the features in 𝐘 to predict these communities. However, graph-driven unsupervised feature selection remains an understudied area with respect to exploring more complex guidance. Here we take the novel approach of first building a block model on the graph and then using the block model for feature selection. That is, we discover 𝐅𝐌𝐅^T ≈𝐀 and then find a subset of features 𝒮 that induces another graph to preserve both 𝐅 and 𝐌. We call our approach Block Model Guided Unsupervised Feature Selection (BMGUFS). Experimental results show that our method outperforms the state of the art on several real-world public datasets in finding high-quality features for clustering.
READ FULL TEXT