Papers โบ Block Model Guided Unsupervised Feature Selection
Block Model Guided Unsupervised Feature Selection
Zilong Bai, Hoa Nguyen, Ian Davidson
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) 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 ๐ ๐๐ แต โ๐ 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change ยท a person checks every report against the paper or source before anything changes; decisions are listed on /corrections