{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:17Z","timestamp":1750220657098,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,18]]},"DOI":"10.1145\/3427771.3427847","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T18:33:44Z","timestamp":1606242824000},"page":"20-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Matrix Factorization for High Frequency Non Intrusive Load Monitoring"],"prefix":"10.1145","author":[{"given":"Simon","family":"Henriet","sequence":"first","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, France"}]},{"given":"Benoit","family":"Fuentes","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, France"}]},{"given":"Umut","family":"\u015eim\u015fekli","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, France"}]},{"given":"Ga\u00ebl","family":"Richard","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2020,11,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. to appear in the IEEE Trans. On Signal Processing","author":"Aharon M","year":"2006","unstructured":"M Aharon , M Elad , and A Bruckstein . 2006. The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. to appear in the IEEE Trans. On Signal Processing ( 2006 ). M Aharon, M Elad, and A Bruckstein. 2006. The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. to appear in the IEEE Trans. On Signal Processing (2006)."},{"key":"e_1_3_2_1_2_1","volume-title":"Independent component analysis, a new concept? Signal processing 36, 3","author":"Comon Pierre","year":"1994","unstructured":"Pierre Comon . 1994. Independent component analysis, a new concept? Signal processing 36, 3 ( 1994 ), 287--314. Pierre Comon. 1994. Independent component analysis, a new concept? Signal processing 36, 3 (1994), 287--314."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.05.017"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2941428"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2018.07.060"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.761722"},{"key":"e_1_3_2_1_8_1","volume-title":"Independent component analysis: algorithms and applications. Neural networks 13, 4","author":"Hyv\u00e4rinen Aapo","year":"2000","unstructured":"Aapo Hyv\u00e4rinen and Erkki Oja . 2000. Independent component analysis: algorithms and applications. Neural networks 13, 4 ( 2000 ), 411--430. Aapo Hyv\u00e4rinen and Erkki Oja. 2000. Independent component analysis: algorithms and applications. Neural networks 13, 4 (2000), 411--430."},{"key":"e_1_3_2_1_9_1","volume-title":"Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture. Signal processing 24, 1","author":"Jutten Christian","year":"1991","unstructured":"Christian Jutten and Jeanny Herault . 1991. Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture. Signal processing 24, 1 ( 1991 ), 1--10. Christian Jutten and Jeanny Herault. 1991. Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture. Signal processing 24, 1 (1991), 1--10."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993422.2993581"},{"key":"e_1_3_2_1_11_1","unstructured":"Daniel D Lee and H Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in neural information processing systems. 556--562. Daniel D Lee and H Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in neural information processing systems. 556--562."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Honglak Lee Alexis Battle Rajat Raina and Andrew Y Ng. 2007. Efficient sparse coding algorithms. In Advances in neural information processing systems. 801--808. Honglak Lee Alexis Battle Rajat Raina and Andrew Y Ng. 2007. Efficient sparse coding algorithms. In Advances in neural information processing systems. 801--808.","DOI":"10.7551\/mitpress\/7503.003.0105"},{"key":"e_1_3_2_1_13_1","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","author":"Mairal Julien","year":"2010","unstructured":"Julien Mairal , Francis Bach , Jean Ponce , and Guillermo Sapiro . 2010 . Online learning for matrix factorization and sparse coding . Journal of Machine Learning Research 11 , Jan (2010), 19 -- 60 . Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro. 2010. Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research 11, Jan (2010), 19--60.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_1_14_1","volume-title":"Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision research 37, 23","author":"Olshausen Bruno A","year":"1997","unstructured":"Bruno A Olshausen and David J Field . 1997. Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision research 37, 23 ( 1997 ), 3311--3325. Bruno A Olshausen and David J Field. 1997. Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision research 37, 23 (1997), 3311--3325."},{"key":"e_1_3_2_1_15_1","volume-title":"Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60, 1-4","author":"Rudin Leonid I","year":"1992","unstructured":"Leonid I Rudin , Stanley Osher , and Emad Fatemi . 1992. Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60, 1-4 ( 1992 ), 259--268. Leonid I Rudin, Stanley Osher, and Emad Fatemi. 1992. Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60, 1-4 (1992), 259--268."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"}],"event":{"name":"BuildSys '20: The 7th ACM International Conference on Systems for Energy-Efficient Buildings, Cities, and Transportation","sponsor":["SIGEnergy ACM Special Interest Group on Energy Systems and Informatics"],"location":"Virtual Event Japan","acronym":"BuildSys '20"},"container-title":["Proceedings of the 5th International Workshop on Non-Intrusive Load Monitoring"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427771.3427847","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427771.3427847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:31Z","timestamp":1750197751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427771.3427847"}},"subtitle":["Definitions and Algorithms"],"short-title":[],"issued":{"date-parts":[[2020,11,18]]},"references-count":16,"alternative-id":["10.1145\/3427771.3427847","10.1145\/3427771"],"URL":"https:\/\/doi.org\/10.1145\/3427771.3427847","relation":{},"subject":[],"published":{"date-parts":[[2020,11,18]]},"assertion":[{"value":"2020-11-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}