Entropy Dimension Reduction Method for Randomized Machine Learning Problems
- 作者: Popkov Y.S.1,2,3, Dubnov Y.A.1,3,4, Popkov A.Y.1,5
-
隶属关系:
- Institute for Systems Analysis, Russian Academy of Sciences
- Braude College of Haifa University
- National Research University “Higher School of Economics,”
- Moscow Institute of Physics and Technology
- Peoples’ Friendship University
- 期: 卷 79, 编号 11 (2018)
- 页面: 2038-2051
- 栏目: Control in Technical Systems
- URL: https://journals.rcsi.science/0005-1179/article/view/151074
- DOI: https://doi.org/10.1134/S0005117918110085
- ID: 151074
如何引用文章
详细
The direct and inverse projections (DIP) method was proposed to reduce the feature space to the given dimensions oriented to the problems of randomized machine learning and based on the procedure of “direct” and “inverse” design. The “projector” matrices are determined by maximizing the relative entropy. It is suggested to estimate the information losses by the absolute error calculated with the use of the Kullback–Leibler function (SRC method). An example illustrating these methods was given.
作者简介
Yu. Popkov
Institute for Systems Analysis, Russian Academy of Sciences; Braude College of Haifa University; National Research University “Higher School of Economics,”
编辑信件的主要联系方式.
Email: popkov@isa.ru
俄罗斯联邦, Moscow; Carmiel; Moscow
Yu. Dubnov
Institute for Systems Analysis, Russian Academy of Sciences; National Research University “Higher School of Economics,”; Moscow Institute of Physics and Technology
Email: popkov@isa.ru
俄罗斯联邦, Moscow; Moscow; Moscow
A. Popkov
Institute for Systems Analysis, Russian Academy of Sciences; Peoples’ Friendship University
Email: popkov@isa.ru
俄罗斯联邦, Moscow; Moscow
补充文件
