Clustering and Interpretability of Residential Electricity Demand Profiles
Bibliographic record
Abstract
Efficient energy management relies on uncovering meaningful consumption patterns from large-scale electricity load demand profiles. With the widespread adoption of sensor technologies such as smart meters and IoT-based monitoring systems, granular and real-time electricity usage data have become available, enabling deeper insights into consumption behaviors. Clustering is a widely used technique for this purpose, but previous studies have primarily focused on a limited set of algorithms, often treating clustering as a black-box approach without addressing interpretability. This study explores a wide number of clustering algorithms by comparing hard clustering algorithms (K-Means, K-Medoids) versus soft clustering techniques (Fuzzy C-Means, Gaussian Mixture Models) in segmenting electricity consumption profiles. The clustering performance is evaluated using five different clustering validation indices (CVIs), assessing intra-cluster cohesion and inter-cluster separation. The results show that soft clustering methods effectively capture inter-cluster characteristics, leading to better cluster separation, whereas intra-cluster characteristics exhibit similar behavior across all clustering approaches. This study assesses which CVIs provide reliable evaluations independent of clustering algorithm sensitivity. It provides a comprehensive analysis of the different CVIs' responses to changes in data characteristics, highlighting which indices remain robust and which are more susceptible to variations in cluster structures. Beyond evaluating clustering effectiveness, this study enhances interpretability by introducing two decision tree models, axis-aligned and sparse oblique decision trees, to generate human-readable rules for cluster assignments. While the axis-aligned tree provides a complete explanation of all clusters, the sparse oblique tree offers simpler, more interpretable rules, emphasizing a trade-off between full interpretability and rule complexity. This structured evaluation provides a framework for balancing transparency and complexity in clustering explanations, offering valuable insights for utility providers, policymakers, and researchers aiming to optimize both clustering performance and explainability in sensor-driven energy demand analysis.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".