聚类分析
数学优化
计算机科学
拉格朗日乘数
约束聚类
约束(计算机辅助设计)
公制(单位)
多目标优化
点(几何)
选择(遗传算法)
帕累托原理
星团(航天器)
数学
算法
数据挖掘
相关聚类
最优化问题
k-中位数聚类
性能指标
集合(抽象数据类型)
k均值聚类
工作(物理)
公平性度量
分拆(数论)
作者
Zhijing Yang,Yiding Tang,Boyang Yan,Junjie Zheng,Chuan Qian,Yi Yang,Hui Zhang
出处
期刊:
[Institute of Electrical and Electronics Engineers]
日期:2025-06-30
卷期号:: 1-8
标识
DOI:10.1109/ijcnn64981.2025.11227190
摘要
Clustering is a fundamental technique in data analysis and machine learning, essential for uncovering hidden patterns. Density Peak Clustering (DPC) is known for its ability to intuitively and rapidly discover hidden clusters in datasets. However, it lacks fairness considerations, leading to biased results. This issue is increasingly critical as fairness becomes a widely discussed and emphasized aspect of clustering algorithms. Notably, this paper introduces Fair Density Peak Clustering (FDPC). Inspired by the cut-off distance in DPC, FDPC introduces a novel distance metric called fair cut-off distance (fdc), derived using the Lagrange multiplier method to ensure minimal fairness loss. To enhance overall fairness, the fdc is used in both the selection of cluster centers and the point assignment strategy. Furthermore, the assignment strategy considers the constraint of a fairness deviation upper bound. Additionally, this paper integrates Pareto multi-objective optimization theory into the assignment strategy, considering both the distances of unassigned points to clusters and their fairness deviations. Comparative experiments demonstrate that FDPC significantly improves fairness while maintaining comparable clustering performance. The code for our work is available at https://github.com/HurryUp1234/FDPC.
科研通智能强力驱动
Strongly Powered by AbleSci AI