A New Density Clustering Method based on Dynamic Local Density

Jian-chun Lu, Quanwang Wu, Chunling Wu
{"title":"A New Density Clustering Method based on Dynamic Local Density","authors":"Jian-chun Lu, Quanwang Wu, Chunling Wu","doi":"10.1109/ICNSC55942.2022.10004074","DOIUrl":null,"url":null,"abstract":"Density-based clustering is an important research direction of data mining because density-based clustering algorithms can find clusters with arbitrary shape and are robust to noises. Local density estimation is widely used in the task of clustering and outlier detection. Traditionally, distance-based and statistic-based local density estimation methods are usually adopted for data mining. However, the effectiveness and stability of local density estimation models for clustering are still to be improved. In this paper, we propose a novel density clustering method based on dynamic local density estimation. First, we show Poisson distribution to fit the distribution of reverse $k$ nearest neighbor counts and describe the model of dynamic local density estimation. Second, we construct a cluster order based on dynamic local density. Finally, decision graph is developed for density clustering and the identified break points partition the cluster order into clusters. Experiment results show that the new dynamic local density estimation model is effective and can help improve the performance of density clustering.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC55942.2022.10004074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Density-based clustering is an important research direction of data mining because density-based clustering algorithms can find clusters with arbitrary shape and are robust to noises. Local density estimation is widely used in the task of clustering and outlier detection. Traditionally, distance-based and statistic-based local density estimation methods are usually adopted for data mining. However, the effectiveness and stability of local density estimation models for clustering are still to be improved. In this paper, we propose a novel density clustering method based on dynamic local density estimation. First, we show Poisson distribution to fit the distribution of reverse $k$ nearest neighbor counts and describe the model of dynamic local density estimation. Second, we construct a cluster order based on dynamic local density. Finally, decision graph is developed for density clustering and the identified break points partition the cluster order into clusters. Experiment results show that the new dynamic local density estimation model is effective and can help improve the performance of density clustering.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于动态局部密度的密度聚类方法
基于密度的聚类算法可以发现任意形状的聚类,并且对噪声具有较强的鲁棒性,是数据挖掘的一个重要研究方向。局部密度估计广泛应用于聚类和离群点检测任务中。传统上,数据挖掘通常采用基于距离和基于统计的局部密度估计方法。然而,局部密度估计模型在聚类中的有效性和稳定性还有待提高。本文提出了一种基于动态局部密度估计的密度聚类方法。首先,我们展示了泊松分布来拟合反向k近邻计数的分布,并描述了动态局部密度估计模型。其次,基于动态局部密度构造聚类顺序。最后,建立了密度聚类的决策图,并利用识别出的断点将聚类顺序划分为多个聚类。实验结果表明,新的动态局部密度估计模型是有效的,有助于提高密度聚类的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High-dimensional Feature Selection in Classification: A Length-Adaptive Evolutionary Approach SFME: Score Fusion from Multiple Experts for Long-tailed Recognition Attention and Cost-Sensitive Graph Neural Network for Imbalanced Node Classification Conditioning Customers' Product Reviews for Accurate Classification Performance Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1