Non-Intrusive Energy Disaggregation Using Non-Negative Matrix Factorization With Sum-to-k Constraint

被引:95
作者
Rahimpour, Alireza [1 ]
Qi, Hairong [1 ]
Fugate, David [2 ]
Kuruganti, Teja [2 ]
机构
[1] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37996 USA
[2] Oak Ridge Natl Lab, Comp & Computat Sci Div, Oak Ridge, TN 37831 USA
基金
美国国家科学基金会;
关键词
Energy disaggregation; HVAC; non-negative matrix factorization; sum-to-k constraint; sparse constraint; LOAD DISAGGREGATION; CLASSIFICATION; ALGORITHM; SELECTION;
D O I
10.1109/TPWRS.2017.2660246
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Energy disaggregation or non-intrusive load monitoring addresses the issue of extracting device-level energy consumption information by monitoring the aggregated signal at one single measurement point without installing meters on each individual device. Energy disaggregation can be formulated as a source separation problem, where the aggregated signal is expressed as linear combination of basis vectors in a matrix factorization framework. In this paper, an approach based on Sum-to-k constrained non-negative matrix factorization (S2K-NMF) is proposed. By imposing the sum-to-k constraint and the non-negative constraint, S2K-NMF is able to effectively extract perceptually meaningful sources from complex mixtures. The strength of the proposed algorithm is demonstrated through two sets of experiments: Energy disaggregation in a residential smart home; and heating, ventilating, and air conditioning components energy monitoring in an industrial building testbed maintained at the Oak Ridge National Laboratory. Extensive experimental results demonstrate the superior performance of S2K-NMF as compared to state-of-the-art decomposition-based disaggregation algorithms.
引用
收藏
页码:4430 / 4441
页数:12
相关论文
共 60 条
[1]  
[Anonymous], 2013, 2013 IEEE INT WORKSH
[2]  
[Anonymous], 2012, ORNLTM2012143
[3]  
[Anonymous], UBICOMP 2007 UBIQUIT
[4]  
[Anonymous], 2011, PROC SIAM INT C DATA, DOI [10.1137/1, 10.1137/1.9781611972818.64, DOI 10.1137/1.9781611972818.64]
[5]  
[Anonymous], THESIS U GRENOBLE
[6]  
[Anonymous], P ADV NEUR INF PROC
[7]  
[Anonymous], P ADV NEUR INF PROC
[8]  
[Anonymous], 2015, ARXIV151200907
[9]  
[Anonymous], 2016, ARXIV160500962
[10]  
[Anonymous], 2012, PROC ARTIF INTELL ST