Skip to content

Supervised NILM using multiple-choice knapsack problem (MCKP).

License

Notifications You must be signed in to change notification settings

compsust/KP-NILM

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

KP-NILM

NILM by using multiple-choice knapsack problem (MCKP).

This is a naïve prototype/demonstration that was initially used when exploring different concepts of UNILM.

If you use my code in your research please cite our UNILM research paper (IEEE example):

A. Rodriguez-Silva and S. Makonin, “Universal Non-Intrusive Load Monitoring (UNILM) Using Filter Pipelines, Probabilistic Knapsack, and Labelled Partition Maps,” p. 6, 2019.

Read more about UNILM on arXiv at https://arxiv.org/abs/1907.06299.

Notes

  • You need to install the following packages via pip: prettytable, statistics, scipy, numpy
  • Download the house1_power_blk1.csv file from the RAE dataset from Dataverse

About

Supervised NILM using multiple-choice knapsack problem (MCKP).

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published