LEADER 00812nam0-22002891i-450- 001 990005516350403321 005 20070917104007.0 035 $a000551635 035 $aFED01000551635 035 $a(Aleph)000551635FED01 035 $a000551635 100 $a19990604d1971----km-y0itay50------ba 101 0 $aita 105 $aa-------00--- 200 1 $aOmaggio a Lucio Fontana$fEnrico Crispolti 210 $aAssisi$cBeniamino Carucci$dc1971 215 $a248 p.$cill.$d22 cm 676 $a730.92 700 1$aCrispolti,$bEnrico$f<1933- >$0297014 702 1$aFontana,$bLucio$f<1899-1968> 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005516350403321 952 $a730.92 FON 2$bST.ARTE 10694$fFLFBC 959 $aFLFBC 996 $aOmaggio a Lucio Fontana$9609559 997 $aUNINA LEADER 02986nam0 22006853i 450 001 VAN00265397 005 20240806101517.677 010 $a978-16-11-97640-3 100 $a20231026d2021 |0itac50 ba 101 $aeng 102 $aUS 105 $a|||| ||||| 200 1 $aNonnegative matrix factorization$fNicolas Gillis 210 $aPhiladelphia$cSIAM$d2021 215 $axix, 350 p.$cill.$d26 cm 410 1$1001VAN00258348$12001 $aData science book series$1210 $aPhiladelphia$cSIAM$v2 606 $a15-XX$xLinear and multilinear algebra; matrix theory [MSC 2020]$3VANC020607$2MF 606 $a15A23$xFactorization of matrices [MSC 2020]$3VANC023159$2MF 606 $a15B48$xPositive matrices and their generalizations; cones of matrices [MSC 2020]$3VANC019936$2MF 606 $a65F55$xNumerical methods for low-rank matrix approximation; matrix compression [MSC 2020]$3VANC037610$2MF 606 $a68-XX$xComputer science [MSC 2020]$3VANC019670$2MF 606 $a68T09$xComputational aspects of data analysis and big data [MSC 2020]$3VANC035916$2MF 606 $a68T10$xPattern recognition, speech recognition [MSC 2020]$3VANC020788$2MF 610 $aComputational complexity$9KW:K 610 $aDictionary learning$9KW:K 610 $aGene expression analysis$9KW:K 610 $aHyperspectral Imaging$9KW:K 610 $aMatrix Factorization$9KW:K 610 $aNon-linear optimization$9KW:K 610 $aNonnegative matrix factorization$9KW:K 610 $aPrincipal component analysis$9KW:K 610 $aRecommender systems$9KW:K 610 $aSingular value decomposition$9KW:K 610 $aSparsity$9KW:K 610 $aaudio source separation$9KW:K 610 $abeta-divergences$9KW:K 610 $ablind source separation$9KW:K 610 $ablock coordinate descent methods$9KW:K 610 $acommunication complexity$9KW:K 610 $aextended formulations$9KW:K 610 $afeature extraction$9KW:K 610 $aidentifiability$9KW:K 610 $alinear dimensionality reduction$9KW:K 610 $alow-rank matrix approximations$9KW:K 610 $amultiplicative updates$9KW:K 610 $anested polytope problem$9KW:K 610 $anonnegative rank$9KW:K 610 $aself-modeling curve resolution$9KW:K 610 $aseparability$9KW:K 610 $atopic modeling$9KW:K 620 $dPhiladelphia$3VANL000037 700 1$aGillis$bNicolas$3VANV218746$01430938 712 $aSIAM $3VANV108794$4650 801 $aIT$bSOL$c20240906$gRICA 856 4 $u/sebina/repository/catalogazione/documenti/GILLIS.pdf$zGILLIS.pdf 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $aVAN00265397 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST 68-XX 1598 $e08DMF826 I 20231026 996 $aNonnegative matrix factorization$93571190 997 $aUNICAMPANIA