Two-stage building energy consumption clustering based on temporal and peak demand patterns

• URL: http://arxiv.org/abs/2008.04293v2
• Date: Sat, 29 Aug 2020 18:11:26 GMT
• Title: Two-stage building energy consumption clustering based on temporal and peak demand patterns
• Authors: Milad Afzalan, Farrokh Jazizadeh, and Hoda Eldardiry
• Abstract summary: We introduce a two-stage clustering method that more accurately captures load shape temporal patterns and peak demands. In the first stage, load shapes are clustered by allowing a large number of clusters to accurately capture variations in energy use patterns. In the second stage, clusters of similar centroid and power magnitude range are merged by using Dynamic Time Warping.
• Score: 3.364554138758565
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Analyzing smart meter data to understand energy consumption patterns helps utilities and energy providers perform customized demand response operations. Existing energy consumption segmentation techniques use assumptions that could result in reduced quality of clusters in representing their members. We address this limitation by introducing a two-stage clustering method that more accurately captures load shape temporal patterns and peak demands. In the first stage, load shapes are clustered by allowing a large number of clusters to accurately capture variations in energy use patterns and cluster centroids are extracted by accounting for shape misalignments. In the second stage, clusters of similar centroid and power magnitude range are merged by using Dynamic Time Warping. We used three datasets consisting of ~250 households (~15000 profiles) to demonstrate the performance improvement, compared to baseline methods, and discuss the impact on energy management.

Related papers

• A Hybrid SOM and K-means Model for Time Series Energy Consumption Clustering [0.0]
  This paper introduces a novel approach to effectively cluster monthly energy consumption patterns by integrating two powerful techniques: Self-organizing maps and K-means clustering. The main focus of this study is on a selection of time series energy consumption data from the Smart meters in London dataset.
  arXiv  Detail & Related papers  (2023-11-25T16:55:19Z)
• Targeted demand response for flexible energy communities using clustering techniques [2.572906392867547]
  The goal is to alter the consumption behavior of the prosumers within a distributed energy community in Italy. Three popular machine learning algorithms are employed, namely k-means, k-medoids and agglomerative clustering. We evaluate the methods using multiple metrics including a novel metric proposed within this study, namely peak performance score (PPS)
  arXiv  Detail & Related papers  (2023-03-01T02:29:30Z)
• Agglomerative Hierarchical Clustering with Dynamic Time Warping for Household Load Curve Clustering [0.0]
  Classifying clients according to their consumption patterns enables targeting specific groups of consumers for demand response (DR) programs. We propose a shape-based approach that combines Agglomerative Hierarchical Clustering (AHC) with Dynamic Time Warping (DTW) We show that AHC using DTW outperformed other clustering algorithms and needed fewer clusters.
  arXiv  Detail & Related papers  (2022-10-18T01:30:25Z)
• Decision-making Oriented Clustering: Application to Pricing and Power Consumption Scheduling [61.062312682535755]
  We formulate the framework of decision-making oriented clustering and propose an algorithm providing a decision-based partition of the data space and good representative decisions. By applying this novel framework and algorithm to a typical problem of real-time pricing and that of power consumption scheduling, we obtain several insightful analytical results.
  arXiv  Detail & Related papers  (2021-06-02T08:41:04Z)
• A Clustering Framework for Residential Electric Demand Profiles [2.294014185517203]
  This paper analyses the electric demand profiles of individual households located in the city Amsterdam, the Netherlands. A comprehensive clustering framework is defined to classify households based on their electricity consumption pattern.
  arXiv  Detail & Related papers  (2021-05-17T09:19:34Z)
• (k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping [57.316437798033974]
  In this work we consider the problem of center-based clustering of trajectories. We propose the usage of a continuous version of DTW as distance measure, which we call continuous dynamic time warping (CDTW) We show a practical way to compute a center from a set of trajectories and subsequently iteratively improve it.
  arXiv  Detail & Related papers  (2020-12-01T13:17:27Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• Topology-based Clusterwise Regression for User Segmentation and Demand Forecasting [63.78344280962136]
  Using a public and a novel proprietary data set of commercial data, this research shows that the proposed system enables analysts to both cluster their user base and plan demand at a granular level. This work seeks to introduce TDA-based clustering of time series and clusterwise regression with matrix factorization methods as viable tools for the practitioner.
  arXiv  Detail & Related papers  (2020-09-08T12:10:10Z)
• Energy Disaggregation with Semi-supervised Sparse Coding [0.0]
  Energy disaggregation research aims to decompose the aggregated energy consumption data into its component appliances. In this paper, a discriminative disaggregation model based on sparse coding has been evaluated on large-scale household power usage dataset for energy conservation.
  arXiv  Detail & Related papers  (2020-04-20T21:05:25Z)
• Learning to Cluster Faces via Confidence and Connectivity Estimation [136.5291151775236]
  We propose a fully learnable clustering framework without requiring a large number of overlapped subgraphs. Our method significantly improves clustering accuracy and thus performance of the recognition models trained on top, yet it is an order of magnitude more efficient than existing supervised methods.
  arXiv  Detail & Related papers  (2020-04-01T13:39:37Z)
• Energy-Based Processes for Exchangeable Data [109.04978766553612]
  We introduce Energy-Based Processes (EBPs) to extend energy based models to exchangeable data. A key advantage of EBPs is the ability to express more flexible distributions over sets without restricting their cardinality. We develop an efficient training procedure for EBPs that demonstrates state-of-the-art performance on a variety of tasks.
  arXiv  Detail & Related papers  (2020-03-17T04:26:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.