Power Load Curve Clustering Algorithm Using Fast Dynamic Time Warping And Affinity Propagation

Yu Jin,Zhongqin Bi

2018 5TH INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI)(2018)

引用 7|浏览1
暂无评分
摘要
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).
更多
查看译文
关键词
power load curve clustering algorithm,big data mining,load curve data,time series,similarity measures,power load data,fast dynamic time warping,affinity propagation,data clustering,FastDTW-AP clustering algorithm,adjust Rand index,adjust mutual information,ARI,AMI,electricity consumption,SCCTS dataset
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要