Implementation of non-intrusive appliances load monitoring (NIALM) on k-nearest neighbors (k-NN) classifier
Bibliographic record
Abstract
Nonintrusive Appliance Load Monitoring (NIALM) is used to analyze individual’s house energy consumption by distinguishing variations in voltage and current of appliances in a household. The method identifies load consumption of each appliance from the aggregated home energy consumption. NIALM will also provide information of load consumptions of each appliance by indirectly detecting the abnormal changes of appliance usage. The proposed NIALM approach is based on features extraction from load consumptions measurements of electrical power signals in order to classify appliance’s state of operation. In this work, we have improved the identification accuracy and the detection of appliances based on their operational state by employing Machine Learning (ML) technique; namely k-nearest neighbor (k-NN) classification algorithm. The dataset used to perform this process is from the publicly available (PLAID) of power, voltage and current signals of appliances from several houses. This is used as benchmark data set. The PLAID dataset is collected and processed for each appliance and our classification results based on k-NN algorithm achieved high accuracy and is able to gain cost-effective solution. In addition, the result shows that k-NN classifier is a proven as an efficient method for NIALM techniques when compared with other proposed different ML options. Based on the used dataset, the average F-score measure obtained using the k-NN classifier is 90%. Possible reasons behind these findings are discussed and areas for further exploration are proposed.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".