Abstract

In the fields of machine learning and data mining, unsupervised feature selection plays an important role in processing large amounts of high-dimensional unlabeled data. This paper proposes an original and novel unsupervised feature selection based on feature grouping and orthogonal constraints. We consider the domain relationship in the original data and reconstruct the similarity matrix based on the correlation between the features. We use a generalized incoherent regression model based on orthogonal constraints. Furthermore, a graph regularization term with local structure preservation constraints is added to ensure that the feature subset does not lose local structural features in the original data space. Besides, an iterative algorithm is proposed to solve the optimization problem by iteratively updating the global similarity matrix, and constructing weight matrix, pseudo-label matrix and transformation matrix. Through experiments on 6 benchmark datasets, the clustering performance of the proposed method outperforms state-of-the-art unsupervised feature selection methods. The source code is available at: https://github.com/misteru/FGOC.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.