Non-intrusive load monitoring by using active and reactive power in additive Factorial Hidden Markov Models
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Abstract Non-intrusive load monitoring (NILM) is the task of determining the appliances individual contributions to the aggregate power consumption by using a set of electrical parameters measured at a single metering point. NILM allows to provide detailed consumption information to the users, that induces them to modify their habits towards a wiser use of the electrical energy. This paper proposes a NILM algorithm based on the joint use of active and reactive power in the Additive Factorial Hidden Markov Models framework. In particular, in the proposed approach, the appliance model is represented by a bivariate Hidden Markov Model whose emitted symbols are the joint active-reactive power signals. The disaggregation is performed by means of an alternative formulation of the Additive Factorial Approximate Maximum a Posteriori (AFAMAP) algorithm for dealing with the bivariate HMM models. The proposed solution has been compared to the original AFAMAP algorithm based on the active power only and to the seminal approach proposed by Hart (1992), based on finite state machine appliance models and which employs both the active and reactive power. Hart’s algorithm has been improved for handling the occurrence of multiple solutions by means of a Maximum A Posteriori technique (MAP). The experiments have been conducted on the AMPds dataset in noised and denoised conditions and the performance evaluated by using the F 1 -Measure and the normalized disaggregation metrics. In terms of F 1 -Measure, the results showed that the proposed approach outperforms AFAMAP, Hart’s algorithm, and Hart’s with MAP respectively by + 14.9 % , + 21.8 % , and + 2.5 % in the 6 appliances denoised case study. In the 6 appliances noised case study, the relative performance improvement is + 25.5 % , + 51.1 % , and + 6.7 % .
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
The Scientific Consensus on Climate Change
Oreskes, N. (2004) · Science · doi:10.1126/science.1103618 · Cited by 1,814
Is disaggregation the holy grail of energy efficiency? The case of electricity
Carrie Armel, K., Gupta, A., Shrimali, G., & Albert, A. (2013) · Energy Policy · doi:10.1016/j.enpol.2012.08.062 · Cited by 595
Cited by
A Systematic Review of Hidden Markov Models and Their Applications
Mor, B., Garhwal, S., & Kumar, A. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09422-4 · Cited by 343
Transfer Learning for Non-Intrusive Load Monitoring
D'Incecco, M., Squartini, S., & Zhong, M. (2020) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2938068 · Cited by 330
“1) Unsupervised Learning: The dominated approach in unsupervised learning is the additive factorial hidden Markov model (AFHMM) [18], [19], [20], [21].”
BackgroundSelf-citation
Metadata
- Authors
- Bonfigli, R., Principi, E., Fagiani, M., Severini, M., Squartini, S., & Piazza, F.
- Venue
- Applied Energy
- Publisher
- Elsevier BV
- Published
- 2017-12
- Volume
- 208
- Pages
- 1590-1607
- ISSN
- 0306-2619 (ISSN-L)
- OpenAlex
- W2755492127
- Cited by
- 226
- References
- 4
- FWCI
- 7.27
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.