Joint Graph Embedding and Feature Weighting for Unsupervised Feature Selection

Zhang Wei; Zhang Zhen-bin

doi:10.12052/gdutxb.210053

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

Joint Graph Embedding and Feature Weighting for Unsupervised Feature Selection

更新时间：2026-05-27

- Joint Graph Embedding and Feature Weighting for Unsupervised Feature Selection
- Vol. 38, Issue 5, Pages: 16-23(2021)
- 作者机构：
  
  广东工业大学计算机学院,广东,广州,510006
- 作者简介：
- 基金信息：
- DOI：10.12052/gdutxb.210053
  CLC： TP391
- Online First：10 September 2021，
  
  Published：2021
- 稿件说明：
移动端阅览
张巍, 张圳彬. 联合图嵌入与特征加权的无监督特征选择[J]. 广东工业大学学报, 2021, 38(5): 16-23.

Zhang Wei, Zhang Zhen-bin. Joint Graph Embedding and Feature Weighting for Unsupervised Feature Selection[J]. 2021, 38(5): 16-23.
张巍, 张圳彬. 联合图嵌入与特征加权的无监督特征选择[J]. 广东工业大学学报, 2021, 38(5): 16-23. DOI： 10.12052/gdutxb.210053.

Zhang Wei, Zhang Zhen-bin. Joint Graph Embedding and Feature Weighting for Unsupervised Feature Selection[J]. 2021, 38(5): 16-23. DOI： 10.12052/gdutxb.210053.

摘要

在特征选择领域

现有的大多数方法不能同时捕获不同特征有差异的权重

不能对投影子空间施加正交约束来提高特征的判别力。为此

本文提出联合图嵌入与特征加权的无监督特征选择方法(Joint Graph Embedding and Feature Weighting

JGEFW)。首先

通过图嵌入局部结构学习获得相似度矩阵和聚类指示矩阵; 然后利用正交回归获得表征不同特征重要程度的权重矩阵

以此选择出判别力强且非冗余的特征。此外

本文还提出了一个交替迭代优化算法来求解JGEFW模型; 最后

在4个数据集上进行实验验证。实验结果表明

JGEFW的聚类指标在大多数情况下优于其他对比算法。

Abstract

In the area of feature selection

most existing methods cannot simultaneously capture the importance of different features and enforce orthogonal constraint on the projected subspace to improve the discrimination of selected features. To deal with this issue

a new unsupervised feature selection method called joint graph embedding and feature weighting (JGEFW) is proposed. To be specific

graph-embedding local structure learning is leveraged to obtain the similarity matrix and the cluster indicator matrix. Moreover

the weight matrix is learned through the orthogonal regression

to select the discriminative and non-redundant features. At last

an alternating iteration algorithm is developed for solving the proposed objective function. Finally

experimental results about clustering evaluation metrics on four publicly available datasets demonstrate that JGEFW is better than others in most cases.

关键词

Keywords

references

HU J, LI Y, GAO W, et al . Robust multi-label feature selection with dual-graph regularization [J ] . Knowledge-Based Systems, 2020, 203: 106126.

FEI L K, QIN J Y, TENG S H, et al . Hashing for approximate nearest neighbor search on big data: A survey [J ] . Journal of Guangdong University of Technology, 2020, 37(3): 23-35.

HOU C, NIE F, YI D, et al. Feature selection via joint embedding learning and sparse regression[C]//IJCAI International Joint Conference on Artificial Intelligence. Spain: Morgan Kaufmann, 2011: 1324-1329.

WANG S, WANG H. Unsupervised feature selection via low-rank approximation and structure learning [J]. Knowledge-Based Systems, 2017, 124: 70-79.

LIU Y F, LI W B, GAO Y. Adaptive neighborhood embedding based unsupervised feature selection [J]. Journal of Computer Research and Development, 2020, 57(8): 1639-1649.

TENG S H, FENG Z Y, TENG L Y, et al . Joint low-rank representation and graph embedding for unsupervised feature selection [J ] . Journal of Guangdong University of Technology, 2019, 36(5): 7-13.

ZHENG W, YAN H, YANG J. Robust unsupervised feature selection by nonnegative sparse subspace learning [J]. Neurocomputing, 2019, 334: 156-171.

DING D, YANG X, XIA F, et al . Unsupervised feature selection via adaptive hypergraph regularized latent representation learning [J ] . Neurocomputing, 2020, 378: 79-97.

TENG L, FENG Z, FANG X, et al . Unsupervised feature selection with adaptive residual preserving [J ] . Neurocomputing, 2019, 367: 259-272.

LIU X, WANG L, ZHANG J, et al . Global and local structure preservation for feature selection [J ] . IEEE Transactions on Neural Networks and Learning Systems, IEEE, 2014, 25(6): 1083-1095.

DU L, SHEN Y D. Unsupervised feature selection with adaptive structure learning[C]//Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Sydney: ACM, 2015-August: 209-218.

CAI D, ZHANG C, HE X. Unsupervised feature selection for multi-cluster data[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2010: 333-342.

QIAN M, ZHAI C. Robust unsupervised feature selection[C]//IJCAI International Joint Conference on Artificial Intelligence. Beijing: Morgan Kaufmann, 2013: 1621-1627.

LI Z, YANG Y, LIU J, et al. Unsupervised feature selection using nonnegative spectral analysis[C]//Proceedings of the AAAI Conference on Artificial Intelligence. Toronto: AAAI, 2012: 1026-1032.

NIE F, WANG X, HUANG H. Clustering and projected clustering with adaptive neighbors[C]//Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2014: 977-986.

XU X, WU X, WEI F, et al . A general framework for feature selection under orthogonal regression with global redundancy minimization [J ] . IEEE Transactions on Knowledge and Data Engineering, 2021, 99: 1-1.

ZHAO H, WANG Z, NIE F. Orthogonal least squares regression for feature extraction [J]. Neurocomputing, 2016, 216: 200-207.

WU X, XU X, LIU J, et al . Supervised feature selection with orthogonal regression and feature weighting [J ] . IEEE Transactions on Neural Networks and Learning Systems, 2020, 32(5): 1831-1838.

NIE F, ZHANG R, LI X. A generalized power iteration method for solving quadratic problem on the Stiefel manifold [J]. Science China(Information Sciences), 2017, 60(11): 5-11.

HUANG J, NIE F, HUANG H. A new simplex sparse learning model to measure data similarity for clustering[C]//IJCAI International Joint Conference on Artificial Intelligence. Buenos Aires: Morgan Kaufmann, 2015: 3569-3575.

LIU Y, YE D, LI W, et al . R obust neighborhood embedding for unsupervised feature selection [J ] . Knowledge-Based Systems, 2020, 193: 105462.

LI X, ZHANG H, ZHANG R, et al . Generalized uncorrelated regression with adaptive graph for unsupervised feature selection [J ] . IEEE Transactions on Neural Networks and Learning Systems, 2019, 30(5): 1587-1595.

THARWAT A, GABER T, IBRAHIM A, et al . Linear discriminant analysis: a detailed tutorial [J ] . AI Communications, 2017, 30(2): 169-190.

SHANG R, WANG W, STOLKIN R, et al . Non-negative spectral learning and sparse regression-based dual-graph regularized feature selection [J ] . IEEE Transactions on Cybernetics, IEEE, 2018, 48(2): 793-806.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Joint Low-Rank Representation and Graph Embedding for Unsupervised Feature Selection

Unsupervised GAN Multi-focus Image Fusion Based on Attention Mechanism

Multi-view Consistency Learning with Block Diagonal Guidance

Combined Weighting Method for Short Text Features

A Monocular Depth Estimation Combined with Attention and Unsupervised Deep Learning

Related Author

Teng Shao-hua

Feng Zhen-ye

Teng Lu-yao

Fang Xiao-zhao

Li Weitong

Jiang Yunfeng

Zhang Wei

Teng Luyao

Related Institution

Centre for Applied Informatics, Victoria University

School of Information Engineering, Guangdong University of Technology

School of Computer Science and Technology, Guangdong University of Technology

School of Information Engineering, Guangzhou Panyu Polytechnic

School of Computers, Guangdong University of Technology

AI问答

⁰