亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Nearest neighbors-based adaptive density peaks clustering with optimized allocation strategy

聚类分析 计算机科学 相似性(几何) 最近邻搜索 数学 星团(航天器) 集合(抽象数据类型) 最近邻链算法 点(几何) k-最近邻算法 模式识别(心理学) 数据挖掘 人工智能 算法 模糊聚类 图像(数学) 树冠聚类算法 几何学 程序设计语言
作者
Lin Sun,Xiaoying Qin,Weiping Ding,Jiucheng Xu
出处
期刊:Neurocomputing [Elsevier]
卷期号:473: 159-181 被引量:16
标识
DOI:10.1016/j.neucom.2021.12.019
摘要

Density peaks clustering (DPC) model is simple and effective in clustering data of any shape, and has attracted wide attention from scholars in recent years. However, it is difficult for DPC to determine the cutoff distance when calculating the local density of points, and to select the correct cluster centers of data with large differences of density between clusters or multi-density peaks in clusters; in addition, the point allocation method in DPC has low accuracy. To overcome these drawbacks, this paper presents a novel nearest neighbors-based adaptive DPC algorithm with an optimized allocation strategy (NADPC in short), and demonstrates its application in image clustering. First, the mutual nearest neighbor relationship between points is defined, the mutual neighborhood of point is proposed, and then a new local density of points is defined and does not need to set the cutoff distance. The candidate cluster centers and relative density are developed. According to the relative density and the high-density nearest neighbor distance of candidate cluster centers, their credibility as the cluster centers is calculated, and then the cluster centers are selected. Second, the mutual neighbor degree and similarity between two points are constructed. The neighborhoods of points are defined according to the high-density nearest neighbor, shared nearest neighbors, mutual neighbor degree and similarity, respectively. The similarity set, similarity domain, positive set, negative set, prediction set, positive value and predicted value of point are provided based on the above-mentioned neighborhoods. Then the optimized allocation strategy of points is proposed. Finally, the allocation algorithms of the non-abnormal and abnormal points are designed, respectively, and then the NADPC algorithm is designed. To evaluate the effectiveness of NADPC, it has been applied to 22 synthetic datasets and 26 actual datasets including 4 image datasets, and has great performance in terms of several evaluation metrics when compared with the other latest clustering algorithms.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
清爽幼枫发布了新的文献求助10
4秒前
锖婧完成签到 ,获得积分10
4秒前
OCDer完成签到,获得积分0
6秒前
慕青应助鲸落采纳,获得10
18秒前
27秒前
鲸落发布了新的文献求助10
32秒前
Orange应助胡强采纳,获得10
52秒前
Magali应助科研通管家采纳,获得10
1分钟前
花陵完成签到 ,获得积分10
1分钟前
thousandsless完成签到 ,获得积分10
1分钟前
d.zhang完成签到,获得积分10
1分钟前
1分钟前
胡强发布了新的文献求助10
1分钟前
胡强完成签到,获得积分10
1分钟前
caca完成签到,获得积分10
1分钟前
打打应助Huang采纳,获得10
2分钟前
Coral.完成签到 ,获得积分10
2分钟前
2分钟前
2分钟前
2分钟前
2分钟前
Akim应助无私寄风采纳,获得30
2分钟前
2分钟前
归海梦岚完成签到,获得积分0
2分钟前
自由的梦露完成签到 ,获得积分10
2分钟前
Huang发布了新的文献求助10
3分钟前
Magali应助科研通管家采纳,获得20
3分钟前
在水一方应助傢誠采纳,获得10
3分钟前
LiChard完成签到 ,获得积分10
3分钟前
Rin发布了新的文献求助10
3分钟前
汉堡包应助害羞的紫伊采纳,获得10
4分钟前
哈哈哈哈完成签到 ,获得积分10
4分钟前
Rin完成签到,获得积分10
4分钟前
赫连涵柏完成签到,获得积分0
4分钟前
Beata完成签到 ,获得积分10
4分钟前
科研混子完成签到 ,获得积分10
4分钟前
馅饼完成签到,获得积分10
4分钟前
4分钟前
4分钟前
吕懿发布了新的文献求助10
4分钟前
高分求助中
Un calendrier babylonien des travaux, des signes et des mois: Séries iqqur îpuš 1036
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 1000
Corrosion and Oxygen Control 600
Heterocyclic Stilbene and Bibenzyl Derivatives in Liverworts: Distribution, Structures, Total Synthesis and Biological Activity 500
重庆市新能源汽车产业大数据招商指南(两链两图两池两库两平台两清单两报告) 400
Division and square root. Digit-recurrence algorithms and implementations 400
行動データの計算論モデリング 強化学習モデルを例として 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2545380
求助须知:如何正确求助?哪些是违规求助? 2175631
关于积分的说明 5600155
捐赠科研通 1896323
什么是DOI,文献DOI怎么找? 946218
版权声明 565334
科研通“疑难数据库(出版商)”最低求助积分说明 503552