A Generalizable Load Recognition Method in NILM Based on Transferable Random Forest

Practical applications of non-intrusive load monitoring (NILM) require load recognition models that generalize to unseen data from new houses and operate efficiently on edge devices. However, existing NILM approaches, particularly deep learning models, are computationally intensive and prone to performance degradation when deployed to new houses due to domain shifts. To address these challenges, this article proposes a Weighted Transferable Random Forest (WTRF) approach for load recognition. Based on the Random Forest (RF) framework, WTRF incorporates a transfer learning mechanism to swiftly adapt the model to new houses using only 1 to 3 labeled samples per appliance. The model is lightweight, with a memory size under 300 KB. Case studies on three datasets demonstrate its effectiveness, including a macro F1-score of 97.0 ± 2.6% when transferring from PLAID to WHITED, a significant improvement over 5.7±1.7% achieved by source-only models. Deployed on a Raspberry Pi 4, WTRF achieves update times as low as 3.1±0.3 seconds and testing times of approximately 3 ms per house. These results highlight WTRF’s efficiency in addressing domain shifts and its suitability for real-time NILM in resource-constrained edge environments.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Instrumentation and Measurement
Published
2025-01-01
DOI
https://doi.org/10.1109/tim.2025.3570355
Citations
29
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
35.22

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Generalizable Load Recognition Method in NILM Based on Transferable Random Forest

Matteo Nardello, Davide Brunelli, Zhongzong Yan, He Wen et al.
29 citations
IEEE Transactions on Instrumentation and Measurement
Advanced Algorithms and Applications
35.22
article

A Generalizable Load Recognition Method in NILM Based on Transferable Random Forest

Matteo Nardello, Davide Brunelli, Zhongzong Yan, He Wen, Pengfei Hao
article en
29 citations

Abstract

Practical applications of non-intrusive load monitoring (NILM) require load recognition models that generalize to unseen data from new houses and operate efficiently on edge devices. However, existing NILM approaches, particularly deep learning models, are computationally intensive and prone to performance degradation when deployed to new houses due to domain shifts. To address these challenges, this article proposes a Weighted Transferable Random Forest (WTRF) approach for load recognition. Based on the Random Forest (RF) framework, WTRF incorporates a transfer learning mechanism to swiftly adapt the model to new houses using only 1 to 3 labeled samples per appliance. The model is lightweight, with a memory size under 300 KB. Case studies on three datasets demonstrate its effectiveness, including a macro F1-score of 97.0 ± 2.6% when transferring from PLAID to WHITED, a significant improvement over 5.7±1.7% achieved by source-only models. Deployed on a Raspberry Pi 4, WTRF achieves update times as low as 3.1±0.3 seconds and testing times of approximately 3 ms per house. These results highlight WTRF’s efficiency in addressing domain shifts and its suitability for real-time NILM in resource-constrained edge environments.

IEEE Transactions on Instrumentation and MeasurementVol. 74
Hunan University (CN), University of Trento (IT)
National Natural Science Foundation of China
Life in Land
Openalex Percentile: Top 0%
Advanced Algorithms and Applications
35.22
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.