000 | a | ||
---|---|---|---|
999 |
_c31010 _d31010 |
||
008 | 230221b xxu||||| |||| 00| 0 eng d | ||
020 | _a9781611976403 | ||
082 |
_a512.9434 _bGIL |
||
100 | _aGillis, Nicolas | ||
245 | _aNonnegative matrix factorization | ||
260 |
_bSociety for Industrial and Applied Mathematics, _c2021 _aPhiladelphia : |
||
300 |
_axxv, 350 p. ; _bill. _c26 cm |
||
365 |
_b87.00 _cUSD _d85.20 |
||
490 | _aData science ; 2 | ||
504 | _aIncludes bibliographical references and index. | ||
520 | _aThis book provides a comprehensive and up-to-date account of the NMF problem and its most significant features. | ||
650 | _aAlgorithms | ||
650 | _aData Science Data Analytics | ||
650 | _aComputer algorithms | ||
650 | _aData mining | ||
650 | _aNon-negative matrices | ||
650 | _aBolzano-Weierstress theorem | ||
650 | _a Condition number | ||
650 | _aContact change point | ||
650 | _aDistributional robustness | ||
650 | _aFeature extraction | ||
650 | _aHierarchical alternating least squares | ||
650 | _aIdentifiability | ||
650 | _aKarush-Kuhn-Tucker (KKT) conditions | ||
650 | _aMATLAB | ||
650 | _aMinimum -volumeNMF | ||
650 | _aNear-separable factorization | ||
650 | _aNested polytope problem | ||
650 | _aNonnegative rank | ||
650 | _aOrthogonal NMF | ||
650 | _a Principal component analysis | ||
650 | _aRobust PCA | ||
650 | _aThomas matrix | ||
650 | _aVerttex component analysis | ||
650 | _a High dimensional data sets | ||
942 |
_2ddc _cBK |