Density Peak Clustering Algorithm Based on Shared Neighbors and Natural Neighbors and Analysis of Electricity Consumption Patterns

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2025-01-15 DOI:10.1002/cpe.8387
Qingpeng Li, Xinyue Hu, Jia Zhao, Hao Cao
{"title":"Density Peak Clustering Algorithm Based on Shared Neighbors and Natural Neighbors and Analysis of Electricity Consumption Patterns","authors":"Qingpeng Li,&nbsp;Xinyue Hu,&nbsp;Jia Zhao,&nbsp;Hao Cao","doi":"10.1002/cpe.8387","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The Density Peaks Clustering (DPC) algorithm is well-known for its simplicity and efficiency in clustering data of arbitrary shapes. However, it faces challenges such as inconsistent local density definitions and sample assignment errors. This paper introduces the Shared Neighbors and Natural Neighbors Density Peaks Clustering (SN-DPC) algorithm to address these issues. SN-DPC redefines local density by incorporating weighted shared neighbors, which enhances the density contribution from distant samples and provides a better representation of the data distribution. It also establishes a new similarity measure between samples using shared and natural neighbors, which increases intra-cluster similarity and reduces assignment errors, thereby improving clustering performance. Compared with DPC-CE, IDPC-FA, DPCSA, FNDPC, and traditional DPC, SN-DPC demonstrated superior effectiveness on both synthetic and real datasets. When applied to the analysis of electricity consumption patterns, it more accurately identified load consumption patterns and usage habits.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8387","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

The Density Peaks Clustering (DPC) algorithm is well-known for its simplicity and efficiency in clustering data of arbitrary shapes. However, it faces challenges such as inconsistent local density definitions and sample assignment errors. This paper introduces the Shared Neighbors and Natural Neighbors Density Peaks Clustering (SN-DPC) algorithm to address these issues. SN-DPC redefines local density by incorporating weighted shared neighbors, which enhances the density contribution from distant samples and provides a better representation of the data distribution. It also establishes a new similarity measure between samples using shared and natural neighbors, which increases intra-cluster similarity and reduces assignment errors, thereby improving clustering performance. Compared with DPC-CE, IDPC-FA, DPCSA, FNDPC, and traditional DPC, SN-DPC demonstrated superior effectiveness on both synthetic and real datasets. When applied to the analysis of electricity consumption patterns, it more accurately identified load consumption patterns and usage habits.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于共享邻域和自然邻域的密度峰值聚类算法及用电模式分析
密度峰聚类(DPC)算法以其对任意形状的数据进行聚类的简单和高效而闻名。然而,它面临着局部密度定义不一致和样本分配错误等挑战。本文引入了共享邻居和自然邻居密度峰值聚类算法(SN-DPC)来解决这些问题。SN-DPC通过加入加权共享邻居来重新定义局部密度,从而增强了远程样本的密度贡献,并提供了更好的数据分布表示。利用共享邻域和自然邻域建立了一种新的样本间相似度度量方法,提高了簇内相似度,减少了分配误差,从而提高了聚类性能。与DPC- ce、IDPC-FA、DPCSA、FNDPC和传统DPC相比,SN-DPC在合成数据集和真实数据集上都表现出更强的有效性。当应用于电力消耗模式分析时,可以更准确地识别负载消耗模式和使用习惯。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Additional-Processing-Free Multiparty Reversible Data Hiding Over Encrypted Domain A Novel Ensemble Machine Learning Approach for Interpretable Modeling, Feature Extraction and Selection With Applications to Medical and Biomedical Signals and Data NOA-RAC: An Enhanced Nutcracker Optimization Algorithm for Optimization Tasks CG-YOLOv11: A Smoke-Removal-Enhanced Target Detection Method for Indoor Smoke Scenes A Complexity Calculation Method for Large Scale Optimization With Evolutionary Algorithms and Metaheuristics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1