Clustering For Demand Response A Theory to Break the ‘ Curse of Dimensionality ’

The advent of smart meters and advanced communication infrastructures catalyzes numerous smart grid applications such as dynamic demand response, and paves the way to solve challenging research problems in sustainable energy consumption. The space of solution possibilities are restricted primarily by the huge amount of generated data requiring considerable computational resources and efficient algorithms. To overcome this Big Data challenge, data clustering techniques have been proposed. Current approaches however do not scale in the face of the “increasing dimensionality” problem where a cluster point is represented by the entire customer consumption time series. To overcome this aspect we first rethink the way cluster points are created and designed, and then design an efficient online clustering technique for demand response (DR) in order to analyze high volume, high dimensional energy consumption time series data at scale, and on the fly. Our online algorithm is randomized in nature, and provides optimal performance guarantees in a computationally efficient manner. Unlike prior work we (i) study the consumption properties of the whole population simultaneously rather than developing individual models for each customer separately, claiming it to be a ‘killer’ approach that breaks the “curse of dimensionality” in online time series clustering, and (ii) provide tight performance guarantees in theory to validate our approach. Our insights are driven by the field of sociology, where collective behavior often emerges as the result of individual patterns and lifestyles.

[1]  Qiang Fu,et al.  YADING: Fast Clustering of Large-Scale Time Series Data , 2015, Proc. VLDB Endow..

[2]  Viktor K. Prasanna,et al.  Accurate and efficient selection of the best consumption prediction method in smart grids , 2014, 2014 IEEE International Conference on Big Data (Big Data).

[3]  Yogesh L. Simmhan,et al.  Scalable prediction of energy consumption using incremental time series clustering , 2013, 2013 IEEE International Conference on Big Data.

[4]  Yasuhiro Hayashi,et al.  A Versatile Clustering Method for Electricity Consumption Pattern Analysis in Households , 2013, IEEE Transactions on Smart Grid.

[5]  Hans W. Guesgen,et al.  Unsupervised Learning of Human Behaviours , 2011, AAAI.

[6]  Farrokh Rahimi,et al.  Demand Response as a Market Resource Under the Smart Grid Paradigm , 2010, IEEE Transactions on Smart Grid.

[7]  T. Warren Liao,et al.  Clustering of time series data - a survey , 2005, Pattern Recognit..

[8]  R. J. Alcock Time-Series Similarity Queries Employing a Feature-Based Approach , 1999 .

[9]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

[10]  Dorit S. Hochbaum,et al.  Various notions of approximations: good, better, best, and more , 1996 .

[11]  P. Sopp Cluster analysis. , 1996, Veterinary immunology and immunopathology.

[12]  Peter Willett,et al.  Recent trends in hierarchic document clustering: A critical review , 1988, Inf. Process. Manag..

[13]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[14]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[15]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[16]  S. L. HAKIMIt AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .