shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications

RESOURCE

Abstract

This code is a toy (short) version of CODE-2016-83. From a general perspective, the code represents an unsupervised adaptive machine learning algorithm that allows efficient and high performance de-mixing and feature extraction of a multitude of non-negative signals mixed and recorded by a network of uncorrelated sensor arrays. The code identifies the number of the mixed original signals and their locations. Further, the code also allows deciphering of signals that have been delayed in regards to the mixing process in each sensor. This code is high customizable and it can be efficiently used for a fast macro-analyses of data. The code is applicable to a plethora of distinct problems: chemical decomposition, pressure transient decomposition, unknown sources/signal allocation, EM signal decomposition. An additional procedure for allocation of the unknown sources is incorporated in the code.
Developers:
Alexandrov, Boian [1] Lliev, Filip [1] Stanev, Valentin [1] Vesselinov, Velimir (Monty) [1]
  1. LANL
Release Date:
2016-09-20
Project Type:
Open Source, Publicly Available Repository
Software Type:
Scientific
Licenses:
Other (Commercial or Open-Source): https://github.com/rNMF/ShiftNMFk.jl/blob/master/LICENSE
Sponsoring Org.:
Code ID:
4661
Site Accession Number:
7147
Research Org.:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Country of Origin:
United States

RESOURCE

Citation Formats

Alexandrov, Boian S., Lliev, Filip L., Stanev, Valentin G., and Vesselinov, Velimir (Monty) V. shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications. Computer Software. https://github.com/rNMF/ShiftNMFk.jl. USDOE. 20 Sep. 2016. Web. doi:10.11578/dc.20171025.1835.
Alexandrov, Boian S., Lliev, Filip L., Stanev, Valentin G., & Vesselinov, Velimir (Monty) V. (2016, September 20). shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications. [Computer software]. https://github.com/rNMF/ShiftNMFk.jl. https://doi.org/10.11578/dc.20171025.1835.
Alexandrov, Boian S., Lliev, Filip L., Stanev, Valentin G., and Vesselinov, Velimir (Monty) V. "shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications." Computer software. September 20, 2016. https://github.com/rNMF/ShiftNMFk.jl. https://doi.org/10.11578/dc.20171025.1835.
@misc{ doecode_4661,
title = {shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications},
author = {Alexandrov, Boian S. and Lliev, Filip L. and Stanev, Valentin G. and Vesselinov, Velimir (Monty) V.},
abstractNote = {This code is a toy (short) version of CODE-2016-83. From a general perspective, the code represents an unsupervised adaptive machine learning algorithm that allows efficient and high performance de-mixing and feature extraction of a multitude of non-negative signals mixed and recorded by a network of uncorrelated sensor arrays. The code identifies the number of the mixed original signals and their locations. Further, the code also allows deciphering of signals that have been delayed in regards to the mixing process in each sensor. This code is high customizable and it can be efficiently used for a fast macro-analyses of data. The code is applicable to a plethora of distinct problems: chemical decomposition, pressure transient decomposition, unknown sources/signal allocation, EM signal decomposition. An additional procedure for allocation of the unknown sources is incorporated in the code.},
doi = {10.11578/dc.20171025.1835},
url = {https://doi.org/10.11578/dc.20171025.1835},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20171025.1835}},
year = {2016},
month = {sep}
}