Skip to main content

Identifying Customer Profiles in Power Load Time Series Using Spectral Clustering

  • Conference paper
Artificial Neural Networks – ICANN 2009 (ICANN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5769))

Included in the following conference series:

Abstract

An application of multiway spectral clustering with out-of-sample extensions towards clustering time series is presented. The data correspond to power load time series acquired from substations in the Belgian grid for a period of 5 years. Spectral clustering methods are a class of unsupervised learning algorithms where the solutions can be obtained from the eigenvectors of a Laplacian matrix derived from the data. Nonlinearity can easily be added to the analysis by the use of nonlinear similarity functions that can be regarded as Mercer kernels. In this paper, a weighted kernel PCA formulation to spectral clustering is used to find interpretable customer profiles underlying the power consumption load time series. The main advantage of the interpretation as kernel PCA is the extension of the clustering model to out-of-sample points. The clustering model can be trained, validated and tested in a learning framework working directly with the data and without the use of pre-modeling steps. The experimental results with real-life data demonstrate the applicability of the multiway spectral clustering method compared to an existing method pre-modeling the data based on periodic autoregressions (PAR).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)

    Article  Google Scholar 

  2. Meila, M., Shi, J.: Learning segmentation by random walks. In: Advances in Neural Information Processing Systems, vol. 13. MIT Press, Cambridge (2001)

    Google Scholar 

  3. Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol. 14, pp. 849–856. MIT Press, Cambridge (2002)

    Google Scholar 

  4. Alzate, C., Suykens, J.A.K.: Multiway spectral clustering with out-of-sample extensions through weighted kernel PCA. IEEE Transactions on Pattern Analysis and Machine Intelligence (2009) (in Press)

    Google Scholar 

  5. Suykens, J.A.K., Van Gestel, T., De Brabanter, J., De Moor, B., Vandewalle, J.: Least Squares Support Vector Machines. World Scientific, Singapore (2002)

    Book  MATH  Google Scholar 

  6. Espinoza, M., Joye, C., Belmans, R., De Moor, B.: Short-term load forecasting, profile identification and customer segmentation: A methodology based on periodic time series. IEEE Trans. on Power System 20(3), 1622–1630 (2005)

    Article  Google Scholar 

  7. Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1997)

    Google Scholar 

  8. Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czech. Math. J. 25(100), 619–633 (1975)

    MathSciNet  MATH  Google Scholar 

  9. Gu, M., Zha, H., Ding, C., He, X., Simon, H.: Spectral relaxation models and structure analysis for k-way graph clustering and bi-clustering. Tech. report, Penn. State Univ, Computer Science and Engineering (2001)

    Google Scholar 

  10. Fan, K.: On a theorem of Weyl concerning eigenvalues of linear transformations. Proc. Natl. Acad. Sci., USA 35(11), 652–655 (1949)

    Google Scholar 

  11. Bach, F.R., Jordan, M.I.: Learning spectral clustering. In: Advances in Neural Information Processing Systems, vol. 16. MIT Press, Cambridge (2004)

    Google Scholar 

  12. Meila, M., Shi, J.: A random walks view of spectral segmentation. In: Artificial Intelligence and Statistics AISTATS (2001)

    Google Scholar 

  13. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  14. Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the Nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2), 214–225 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alzate, C., Espinoza, M., De Moor, B., Suykens, J.A.K. (2009). Identifying Customer Profiles in Power Load Time Series Using Spectral Clustering. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds) Artificial Neural Networks – ICANN 2009. ICANN 2009. Lecture Notes in Computer Science, vol 5769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04277-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04277-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04276-8

  • Online ISBN: 978-3-642-04277-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics