4.7 Article

Real-time sufficient dimension reduction through principal least squares support vector machines

期刊

PATTERN RECOGNITION
卷 112, 期 -, 页码 -

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2020.107768

关键词

Central subspace; Ladle estimator; Online sliced inverse regression; Principal support vector machines; Streamed data

资金

  1. National Reasearch Foundation of Korea (NRF) [2018R1D1A1B07043034, 2019R1A4A1028134]
  2. Korea University [K1806401]
  3. National Research Foundation of Korea [2019R1A4A1028134, 2018R1D1A1B07043034] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

向作者/读者索取更多资源

The proposed real-time approach for sufficient dimension reduction, namely principal least squares support vector machines, provides better estimation of the central subspace compared to existing methods such as sliced inverse regression and principal support vector machines. This new proposal is also capable of quick real-time updates in the presence of streamed data, outperforming existing algorithms in terms of performance and speed.
We propose a real-time approach for sufficient dimension reduction. Compared with popular sufficient dimension reduction methods including sliced inverse regression and principal support vector machines, the proposed principal least squares support vector machines approach enjoys better estimation of the central subspace. Furthermore, this new proposal can be used in the presence of streamed data for quick real-time updates. It is demonstrated through simulations and real data applications that our proposal performs better and faster than existing algorithms in the literature. (c) 2020 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据