A new graph-based clustering method with dual-feature regularization and Laplacian rank constraint

The performance of graph-based clustering is commonly limited by two-stage processing (Constructing and dividing similarity graph) and the quality of similar graphs. To this end, we propose a new graph-based clustering method with dual-feature regularization and Laplacian rank constraint. Specifically, our method reveals the clustering structure and unifies the two-stage process. It imposes a Laplacian rank constraint on the similarity graph to ensure that it has C connected components. In addition, a method based on dual-feature regularization is designed to capture local data feature information from both feature extraction and adaptive regression, and is applied to an accurate distance metric learning. A reweighting optimization is integrated to learn a high-quality robust similarity graph. Comprehensive experiments on Ecoli, Yale and Yeast datasets show that our method outperforms the existing graph-based clustering methods with an average improvement of about 4%, 5% and 7% on the evaluation metrics ACC, NMI and RI, respectively.