skip to main content
10.1145/2768510.2770932acmconferencesArticle/Chapter ViewAbstractPublication Pagese-energyConference Proceedingsconference-collections
research-article

Challenge: On Online Time Series Clustering for Demand Response: Optic - A Theory to Break the 'Curse of Dimensionality'

Authors Info & Claims
Published:14 July 2015Publication History

ABSTRACT

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 devise OPTIC, an efficient online time series 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. OPTIC is randomized in nature, and provides optimal performance guarantees (Section 2.3.2) 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 "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. We demonstrate the efficacy of OPTIC in practice using real-world data obtained from the fully operational USC microgrid.

References

  1. F. Rahimi and A. Ipakchi, "Demand response as a market resource under the smart grid paradigm," Smart Grid, IEEE Transactions on, vol. 1, no. 1, pp. 82--88, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  2. M. Frincu, C. Chelmis, M. U. Noor, and V. K. Prasanna, "Accurate and efficient selection of the best consumption prediction method in smart grids," in Proc. IEEE International Conference on Big Data, IEEE, 2014.Google ScholarGoogle Scholar
  3. Y. Simmhan and M. Noor, "Scalable prediction of energy consumption using incremental time series clustering," in Big Data, 2013 IEEE International Conference on, pp. 29--36, Oct 2013.Google ScholarGoogle ScholarCross RefCross Ref
  4. T. W. Liao, "Clustering of time series data - a survey," Pattern Recognition, vol. 38, no. 11, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S.-L. Chua, S. Marsland, and H. Guesgen, "Unsupervised learning of human behaviors," in AAAI, 2011.Google ScholarGoogle Scholar
  6. H. Hino, H. Shen, N. Murata, S. Wakao, and Y. Hayashi, "A versatile clustering method for electricity consumption pattern analysis in households," IEEE Transactions on Smart Grid, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  7. F. Martinez-Alvarez, A. Troncoso, J. C. Riquelme, and J. S. Ruiz, "Energy time series forecasting based on pattern similarity," IEEE Transactions on Knowledge ad Data Engineering, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Ding, Q. Wang, Y. Dang, Q. Fu, H. Zhang, and D. Zhang, "Yading: Fast clustering of large-scale time series data," in VLDB, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. Everitt, Cluster Analysis. Heinemann Educational, 1974.Google ScholarGoogle Scholar
  10. C. J. van Rijsbergen, Information Retrieval. Buttersworth, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. Salton and M. J. Gill, Introduction to Modern Information Retrieval. McGraw-Hill Book Compnay, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Willet, "Recent trends in hierarchical document clustering: A critical review," Information Processing and Management, vol. 24, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Bern and D. Eppstein, Approximation Algorithms for Geometric Problems. PWS Publishing Company, 1996.Google ScholarGoogle Scholar
  14. D. Hochbaum, Various Notions of Approximations: Good, Better, Best, and More. PWS Publishing Company, 1996.Google ScholarGoogle Scholar
  15. M. R. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. O. Kariv and S. L. Hakimi, "An algorithmic approach to network location problems," SIAM Journal of Applied Mathematics, vol. 37, 1979.Google ScholarGoogle Scholar
  17. T. Feder and D. H. Greene, "Optimal algorithms for approximate clustering," in STOC, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. T. E. Gonzalez, "Clustering to minimize the maximum inter-cluster distance," Theoretical Computer Science, vol. 38, 1985.Google ScholarGoogle Scholar
  19. M. Charikar, C. Chekuri, T. Ferer, and R. Motwani, "Incremental clustering and dynamic information retrieval," SIAM Journal on Computing, vol. 33, no. 6, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. King, "Online k-means clustering of non-stationary data." Technical Report, Massachusetts Institute of Technology, May 2012.Google ScholarGoogle Scholar
  21. W. Barbakh and C. Fyfe, "Online clustering algorithms," International Journal of Neural Systems, vol. 18, no. 3, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  22. A. Choromanska and C. Monteleoni, "Online clustering with experts," Journal of Machine Learning Research, vol. 22, 2012.Google ScholarGoogle Scholar
  23. D. Arthur and S. Vassilvitskii, "k-means++," in SODA, 2007.Google ScholarGoogle Scholar

Index Terms

  1. Challenge: On Online Time Series Clustering for Demand Response: Optic - A Theory to Break the 'Curse of Dimensionality'

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      e-Energy '15: Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems
      July 2015
      334 pages
      ISBN:9781450336093
      DOI:10.1145/2768510

      Copyright © 2015 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 July 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      e-Energy '15 Paper Acceptance Rate20of85submissions,24%Overall Acceptance Rate160of446submissions,36%

      Upcoming Conference

      e-Energy '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader