A low-complexity energy disaggregation method: Performance and robustness

Hana Altrabalsi, J. Liao, L. Stanković, V. Stanković
{"title":"A low-complexity energy disaggregation method: Performance and robustness","authors":"Hana Altrabalsi, J. Liao, L. Stanković, V. Stanković","doi":"10.1109/CIASG.2014.7011569","DOIUrl":null,"url":null,"abstract":"Disaggregating total household's energy data down to individual appliances via non-intrusive appliance load monitoring (NALM) has generated renewed interest with ongoing or planned large-scale smart meter deployments worldwide. Of special interest are NALM algorithms that are of low complexity and operate in near real time, supporting emerging applications such as in-home displays, remote appliance scheduling and home automation, and use low sampling rates data from commercial smart meters. NALM methods, based on Hidden Markov Model (HMM) and its variations, have become the state of the art due to their high performance, but suffer from high computational cost. In this paper, we develop an alternative approach based on support vector machine (SVM) and k-means, where k-means is used to reduce the SVM training set size by identifying only the representative subset of the original dataset for the SVM training. The resulting scheme outperforms individual k-means and SVM classifiers and shows competitive performance to the state-of-the-art HMM-based NALM method with up to 45 times lower execution time (including training and testing).","PeriodicalId":166543,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence Applications in Smart Grid (CIASG)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence Applications in Smart Grid (CIASG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIASG.2014.7011569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

Disaggregating total household's energy data down to individual appliances via non-intrusive appliance load monitoring (NALM) has generated renewed interest with ongoing or planned large-scale smart meter deployments worldwide. Of special interest are NALM algorithms that are of low complexity and operate in near real time, supporting emerging applications such as in-home displays, remote appliance scheduling and home automation, and use low sampling rates data from commercial smart meters. NALM methods, based on Hidden Markov Model (HMM) and its variations, have become the state of the art due to their high performance, but suffer from high computational cost. In this paper, we develop an alternative approach based on support vector machine (SVM) and k-means, where k-means is used to reduce the SVM training set size by identifying only the representative subset of the original dataset for the SVM training. The resulting scheme outperforms individual k-means and SVM classifiers and shows competitive performance to the state-of-the-art HMM-based NALM method with up to 45 times lower execution time (including training and testing).
一种低复杂度能量分解方法:性能和鲁棒性
通过非侵入式设备负载监测(NALM)将家庭总能源数据分解为单个设备,这引起了全球正在进行或计划大规模智能电表部署的新兴趣。特别令人感兴趣的是NALM算法,它具有低复杂性和近实时操作,支持诸如家庭显示,远程设备调度和家庭自动化等新兴应用,并使用来自商业智能电表的低采样率数据。基于隐马尔可夫模型(HMM)及其变体的NALM方法因其高性能而成为目前的研究热点,但其计算成本较高。在本文中,我们开发了一种基于支持向量机(SVM)和k-means的替代方法,其中k-means通过仅识别用于支持向量机训练的原始数据集的代表性子集来减少支持向量机训练集的大小。结果方案优于单个k-means和SVM分类器,并显示出与最先进的基于hmm的NALM方法相竞争的性能,执行时间(包括训练和测试)减少了45倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信