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

被引:0
|
作者
Jin, Yu [1 ]
Bi, Zhongqin [1 ]
机构
[1] Shanghai Univ Elect Power, Shanghai 200090, Peoples R China
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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).
引用
收藏
页码:1132 / 1137
页数:6
相关论文
共 50 条
  • [31] Accurate and fast Dynamic Time Warping approximation using upper bounds
    Ben Ali, Bilel
    Masmoudi, Youssef
    Dhouib, Souhail
    [J]. 2015 38TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2015,
  • [32] Clustering time series with Granular Dynamic Time Warping method
    Yu, Fusheng
    Dong, Keqiang
    Chen, Fei
    Jiang, Yongke
    Zeng, Wenyi
    [J]. GRC: 2007 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, PROCEEDINGS, 2007, : 393 - +
  • [33] Fast Clustering by Affinity Propagation Based on Density Peaks
    Li, Yang
    Guo, Chonghui
    Sun, Leilei
    [J]. IEEE ACCESS, 2020, 8 : 138884 - 138897
  • [34] Semisupervised Clustering for Networks Based on Fast Affinity Propagation
    Zhu, Mu
    Meng, Fanrong
    Zhou, Yong
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [35] Subspace clustering using affinity propagation
    Gan, Guojun
    Ng, Michael Kwolc-Po
    [J]. PATTERN RECOGNITION, 2015, 48 (04) : 1455 - 1464
  • [36] Clustering Subway Station Arrival Patterns Using Weighted Dynamic Time Warping
    Wang, Rui
    Chen, Nan
    Zhang, Chen
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2018, : 531 - 535
  • [37] Clustering driver behavior using dynamic time warping and hidden Markov model
    Yao, Ying
    Zhao, Xiaohua
    Wu, Yiping
    Zhang, Yunlong
    Rong, Jian
    [J]. JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 25 (03) : 249 - 262
  • [38] Weighted dynamic time warping for traffic flow clustering
    Li, Man
    Zhu, Ye
    Zhao, Taige
    Angelova, Maia
    [J]. NEUROCOMPUTING, 2022, 472 : 266 - 279
  • [39] Query-by-Example Retrieval via Fast Sequential Dynamic Time Warping Algorithm
    Vavrek, Jozef
    Viszlay, Peter
    Kiktova, Eva
    Lojka, Martin
    Juhar, Jozef
    Cizmar, Anton
    [J]. 2015 38TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2015,
  • [40] Parallelizing Dynamic Time Warping Algorithm Using Prefix Computations on GPU
    Xiao, Limin
    Zheng, Yao
    Tang, Wenqi
    Yao, Guangchao
    Ruan, Li
    [J]. 2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, : 294 - 299