Entropy dimension reduction method for randomized machine learning problems
From MaRDI portal
Publication:1717049
DOI10.1134/S0005117918110085zbMath1442.68201OpenAlexW4232959139MaRDI QIDQ1717049
Publication date: 5 February 2019
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117918110085
entropyprojection operatorsrelative entropygradient methodmatrix derivativesdirect and inverse projections
Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)
Related Items (6)
Elements of randomized forecasting and its application to daily electrical load prediction in a regional power system ⋮ Randomization and entropy in machine learning and data processing ⋮ Randomized machine learning algorithms to forecast the evolution of thermokarst lakes area in permafrost zones ⋮ Entropy modeling of network structures ⋮ Кросс-энтропийная редукции матрицы данных с ограничением информационной емкости матриц-проекторов и их норм ⋮ Cross-entropy optimal dimensionality reduction with a condition on information capacity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms and applications for approximate nonnegative matrix factorization
- Principal component analysis.
- Macrosystems theory and its applications. Equilibrium models
- Principle component analysis: robust versions
- Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview
- Information Theory and Statistical Mechanics
- Extensions of Lipschitz mappings into a Hilbert space
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Communication Theory of Secrecy Systems*
- On Information and Sufficiency
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Entropy dimension reduction method for randomized machine learning problems
