Logo
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Institutional repository
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

Load curves partitioning with the application of soft clustering algorithms

Thumbnail
Author
Panapakidis I.P., Dagoumas A.S.
Date
2019
Language
en
DOI
10.1109/UPEC.2019.8893610
Keyword
Fuzzy clustering
Fuzzy systems
Pattern recognition
Principal component analysis
Time series analysis
Clustering problems
Clustering validity
Consumer categorization
Electricity demands
Load profiles
Pattern recognition algorithms
Possibilistic C-means
Time series modeling
Clustering algorithms
Institute of Electrical and Electronics Engineers Inc.
Metadata display
Abstract
Load profiling refers to a procedure which leads to the formulation of daily load curve and consumer categories regarding the similarity of their curves shapes. This procedure incorporates a set of pattern recognition algorithms. While many crisp clustering algorithms have been purposed for grouping load curves into classes, only one soft clustering algorithm is utilized for the aforementioned purpose, namely the Fuzzy C-Means (FCM). Since the benefits of the soft clustering is demonstrated in a variety of applications, we examine the potential of introducing soft clustering algorithms in the electricity demand patterns segmentation. This paper introduces in the load profiling studies, two soft clustering algorithms which have been already used in other clustering problems, namely the Possibilistic C-Means (PCM) and the Gustafson-Kessel Fuzzy C-Means (GKFCM). A detailed comparison takes places between the algorithms and their performance is checked by a set of adequacy measures that have been proposed in the load profiling related literature and by a set of traditional fuzzy clustering validity measures. © 2019 IEEE.
URI
http://hdl.handle.net/11615/77476
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    A Scalable Short-Text Clustering Algorithm Using Apache Spark 

    Akritidis L., Alamaniotis M., Fevgas A., Bozanis P. (2021)
    Short text clustering deals with the problem of grouping together semantically similar documents with small lengths. Nowadays, huge amounts of text data is being generated by numerous applications such as microblogs, ...
  • Thumbnail

    Online clustering of distributed streaming data using belief propagation techniques 

    Halkidi, M.; Koutsopoulos, I. (2011)
    Extraction of patterns out of streaming data that are generated from geographically dispersed devices is a major challenge in data mining. The sequential, distributed fashion in which data become available to the decision ...
  • Thumbnail

    Distributed clustering in vehicular networks 

    Maglaras, L. A.; Katsaros, D. (2012)
    Clustering in vanets is of crucial importance in order to cope with the dynamic features of the vehicular topologies. Algorithms that give good results in Manets fail to create stable clusters since vehicular nodes are ...
htmlmap 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
htmlmap