Showing 1 - 3 of 3
Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$\ell _1$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <msub> <mi>ℓ</mi> <mn>1</mn> </msub> </math> </EquationSource> </InlineEquation>-cost functions as convex relaxations of the rank constraint and the sparsity measure,...</equationsource></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010998546
Tree-based methods are statistical procedures for automatic learning from data, whose main applications are integrated into a data-mining environment for decision support systems. Here, we focus on two problems of decision trees: the stability of the rules obtained and their applicability to...
Persistent link: https://www.econbiz.de/10011241292
Persistent link: https://www.econbiz.de/10009149749