基于快速动态时间翘曲和亲和性传播的电力负荷曲线聚类算法

Yu Jin, Zhongqin Bi
{"title":"基于快速动态时间翘曲和亲和性传播的电力负荷曲线聚类算法","authors":"Yu Jin, Zhongqin Bi","doi":"10.1109/ICSAI.2018.8599336","DOIUrl":null,"url":null,"abstract":"Load curve clustering is a basic task for big data mining in electricity consumption. This paper proposed a clustering algorithm to improve the correct and accurate clustering of the load curve data. Firstly, we introduced the FastDTW as the similarity metric to measure the distance between two time series. Secondly, we used the Affinity Propagation (AP) to cluster. At last, we proposed a novel FastDTW-AP clustering algorithm for load curve clustering. As the similarity measures for clustering, we consider the Euclidean distance, Dynamic Time Warping (DTW), and Fast Dynamic Time Warping (FastDTW), and compare the efficiency of three similarity measures using the labelled dataset SCCTS from UCI. To evaluate the clustering algorithm, the real power load data is analyzed. The results show obvious improvement in evaluation index Adjust Rand Index (ARI) and Adjust Mutual Information (AMI).","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Power Load Curve Clustering Algorithm Using Fast Dynamic Time Warping and Affinity Propagation\",\"authors\":\"Yu Jin, Zhongqin Bi\",\"doi\":\"10.1109/ICSAI.2018.8599336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Load curve clustering is a basic task for big data mining in electricity consumption. This paper proposed a clustering algorithm to improve the correct and accurate clustering of the load curve data. Firstly, we introduced the FastDTW as the similarity metric to measure the distance between two time series. Secondly, we used the Affinity Propagation (AP) to cluster. At last, we proposed a novel FastDTW-AP clustering algorithm for load curve clustering. As the similarity measures for clustering, we consider the Euclidean distance, Dynamic Time Warping (DTW), and Fast Dynamic Time Warping (FastDTW), and compare the efficiency of three similarity measures using the labelled dataset SCCTS from UCI. To evaluate the clustering algorithm, the real power load data is analyzed. The results show obvious improvement in evaluation index Adjust Rand Index (ARI) and Adjust Mutual Information (AMI).\",\"PeriodicalId\":375852,\"journal\":{\"name\":\"2018 5th International Conference on Systems and Informatics (ICSAI)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th International Conference on Systems and Informatics (ICSAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2018.8599336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Systems and Informatics (ICSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2018.8599336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

负荷曲线聚类是电力消费大数据挖掘的基础任务。为了提高负荷曲线数据聚类的正确性和准确性,本文提出了一种聚类算法。首先,引入FastDTW作为度量两个时间序列之间距离的相似度度量。其次,我们使用亲和性传播(Affinity Propagation, AP)进行聚类。最后,我们提出了一种新的用于负载曲线聚类的FastDTW-AP算法。作为聚类的相似度量,我们考虑了欧几里得距离、动态时间翘曲(DTW)和快速动态时间翘曲(FastDTW),并使用来自UCI的标记数据SCCTS比较了三种相似度量的效率。为了评价聚类算法,对实际电力负荷数据进行了分析。结果表明,评价指标调整兰德指数(ARI)和调整互信息(AMI)均有明显改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Power Load Curve Clustering Algorithm Using Fast Dynamic Time Warping and Affinity Propagation
Load curve clustering is a basic task for big data mining in electricity consumption. This paper proposed a clustering algorithm to improve the correct and accurate clustering of the load curve data. Firstly, we introduced the FastDTW as the similarity metric to measure the distance between two time series. Secondly, we used the Affinity Propagation (AP) to cluster. At last, we proposed a novel FastDTW-AP clustering algorithm for load curve clustering. As the similarity measures for clustering, we consider the Euclidean distance, Dynamic Time Warping (DTW), and Fast Dynamic Time Warping (FastDTW), and compare the efficiency of three similarity measures using the labelled dataset SCCTS from UCI. To evaluate the clustering algorithm, the real power load data is analyzed. The results show obvious improvement in evaluation index Adjust Rand Index (ARI) and Adjust Mutual Information (AMI).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Improvement of Text Processing and Clustering Algorithms in Public Opinion Early Warning System Mutation Relation Extraction and Genes Network Analysis in Colon Cancer Discovering Transportation Mode of Tourists Using Low-Sampling-Rate Trajectory of Cellular Data Sound Source Separation by Instantaneous Estimation-Based Spectral Subtraction Evaluation Of Electricity Market Operation Efficiency Based On Analytic Hierarchy Process-Grey Relational Analysis
×
引用
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