mlsanityData to 14 Oct 2026

Unsupervised Feature Selection Algorithm Based on Graph Filtering and Self-representation

arXiv 2411.00270 ↗First posted 1 Nov 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Aiming at the problem that existing methods could not fully capture the intrinsic structure of data without considering the higher-order neighborhood information of the data, we proposed an unsupervised feature selection algorithm based on graph filtering and self-representation. Firstly,a higher-order graph filter was applied to the data to obtain its smooth representation,and a regularizer was designed to combine the higher-order graph information for the self-representation matrix learning to capture the intrinsic structure of the data. Secondly,l2,1 norm was used to reconstruct the error term and feature selection matrix to enhance the robustness and row sparsity of the model to select the discriminant features. Finally, an iterative algorithm was applied to effectively solve the proposed objective function and simulation experiments were carried out to verify the effectiveness of the proposed algorithm.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 13 references that are in the map. First posted on arXiv 1 Nov 2024.

Builds on

1 of 13 references.

References · 1

  1. 2013Projection onto the probability simplex: An efficient algorithm with a simple proof, and an applicationcited by 67

Built on by

Not cited yet.