Unsupervised Feature Weighting Based on Graph Heat Kernel and Normalized Hilbert–Schmidt Independence Criterion

Unsupervised feature weighting relies on sample structure to assess feature importance. However, irrelevant features and noise can distort the structural reference, while feature redundancy can cause repeated weighting of similar information. We propose an unsupervised feature-weighting method based on a graph heat kernel and the normalized Hilbert–Schmidt independence criterion (nHSIC), termed GHK-nHSIC-FW, which constructs a label-free structural target using heat diffusion on a nearest-neighbor graph. The method uses nHSIC to measure feature–target alignment and feature redundancy and learns continuous weights with convex quadratic optimization under nonnegative simplex constraints to adjust feature contributions to the weighted Euclidean distance. Experiments on eight public datasets demonstrate that our proposed method can achieve the highest average clustering accuracy (ACC) and normalized mutual information (NMI) among the compared methods, while ablation and subsampling analyses assess component effectiveness and feature importance stability. Synthetic experiments with known informative features examine sample contamination, irrelevant feature injection, correlated feature copies, and diffusion-scale effects under graph perturbations. The results show strong relative performance under sample and irrelevant feature contamination and demonstrate how redundancy control helps retain complementary informative contributions. These results support graph-guided, redundancy-aware feature weighting for unsupervised clustering.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-11-16
DOI
https://doi.org/10.3390/e28111263
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Unsupervised Feature Weighting Based on Graph Heat Kernel and Normalized Hilbert–Schmidt Independence Criterion

Tinghua Wang, Yuhong Chen, Long Zou
2 links
Entropy
Advanced Clustering Algorithms Research
article

Unsupervised Feature Weighting Based on Graph Heat Kernel and Normalized Hilbert–Schmidt Independence Criterion

Tinghua Wang, Yuhong Chen, Long Zou
article en

Abstract

Unsupervised feature weighting relies on sample structure to assess feature importance. However, irrelevant features and noise can distort the structural reference, while feature redundancy can cause repeated weighting of similar information. We propose an unsupervised feature-weighting method based on a graph heat kernel and the normalized Hilbert–Schmidt independence criterion (nHSIC), termed GHK-nHSIC-FW, which constructs a label-free structural target using heat diffusion on a nearest-neighbor graph. The method uses nHSIC to measure feature–target alignment and feature redundancy and learns continuous weights with convex quadratic optimization under nonnegative simplex constraints to adjust feature contributions to the weighted Euclidean distance. Experiments on eight public datasets demonstrate that our proposed method can achieve the highest average clustering accuracy (ACC) and normalized mutual information (NMI) among the compared methods, while ablation and subsampling analyses assess component effectiveness and feature importance stability. Synthetic experiments with known informative features examine sample contamination, irrelevant feature injection, correlated feature copies, and diffusion-scale effects under graph perturbations. The results show strong relative performance under sample and irrelevant feature contamination and demonstrate how redundancy control helps retain complementary informative contributions. These results support graph-guided, redundancy-aware feature weighting for unsupervised clustering.

EntropyVol. 28(11)
Gannan Normal University (CN)
National Natural Science Foundation of China
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon