<p>Unsupervised feature selection (UFS) methods play a crucial role in improving the efficiency of extracting relevant information and reducing computational complexity in the context of big data analysis. Despite notable advancements in the field of unsupervised feature selection for large-scale datasets, many UFS methods still remain redundant and irrelevant features during the feature selection process. To tackle these challenges, we present a novel unsupervised feature selection method that leverages the generalized regression model with linear discriminant constraints to learn discriminant and effective features from the data. Benefited from this, the relationships and patterns within the high-dimensional data are retained in the reduced-dimensional feature space. We reformulate our proposed method as a multi-variable optimization problem that incorporates equality constraints. To efficiently solve this problem, we develop an algorithm that updates each variable alternately. Extensive experiments on six datasets among nine state-of-the-art methods on the clustering task are conducted to demonstrate the effectiveness of the proposed method.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Unsupervised feature selection based on generalized regression model with linear discriminant constraints

  • Xiangguang Dai,
  • Mingyu Guan,
  • Facheng Dai,
  • Wei Zhang,
  • Tingji Zhang,
  • Hangjun Che,
  • Xiangqin Dai

摘要

Unsupervised feature selection (UFS) methods play a crucial role in improving the efficiency of extracting relevant information and reducing computational complexity in the context of big data analysis. Despite notable advancements in the field of unsupervised feature selection for large-scale datasets, many UFS methods still remain redundant and irrelevant features during the feature selection process. To tackle these challenges, we present a novel unsupervised feature selection method that leverages the generalized regression model with linear discriminant constraints to learn discriminant and effective features from the data. Benefited from this, the relationships and patterns within the high-dimensional data are retained in the reduced-dimensional feature space. We reformulate our proposed method as a multi-variable optimization problem that incorporates equality constraints. To efficiently solve this problem, we develop an algorithm that updates each variable alternately. Extensive experiments on six datasets among nine state-of-the-art methods on the clustering task are conducted to demonstrate the effectiveness of the proposed method.