.png){kind=icon}
.png){kind=icon}
Return
Adaptive weighted K-means algorithm for data risk pattern recognition and optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00521-026-11969-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the era of big data, identifying and optimizing data risk patterns is crucial for enhancing decision-making accuracy and system security. However, existing methods often treat all features equally or lack sensitivity to varying risk levels, which limits their effectiveness in complex risk environments. This paper proposes AWK-RPO (Adaptive Weighted K-means for Risk Pattern Optimization), a novel clustering-based framework that integrates adaptive feature weighting with risk-aware optimization. Unlike traditional K-means algorithms that treat all features equally, AWK-RPO iteratively adjusts the weight of each feature based on its contribution to the overall risk, enabling the algorithm to highlight critical risk-related attributes while suppressing noise. Furthermore, a risk-sensitive distance metric is employed to improve the clustering accuracy for high-risk data points. The proposed method incorporates a feedback loop that refines the feature weights and cluster boundaries until convergence, ensuring both robust pattern recognition and optimized risk distribution. Experimental results on multiple real-world datasets demonstrate that AWK-RPO outperforms existing K-means variants in terms of clustering quality, risk detection rate, and optimization efficiency.
Keywords:
Adaptive weighted clustering
Risk pattern recognition
Data optimization
Risk-sensitive distancen
Journal
IF:
4.5
Papers:
808
Citations:
3.2W