期刊
INFORMATION SCIENCES
卷 545, 期 -, 页码 688-712出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2020.09.015
关键词
Label descriptive function; Semi-supervised regression; Smoothness regularization; Weighted co-association rate
资金
- Incheon National University
- National Research Foundation of Korea (NRF) - Korea government (MSIT
- Ministry of Science and ICT) [2020R1C1C1003425]
- National Research Foundation of Korea [2020R1C1C1003425] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
The study introduces a Laplacian regularized label description algorithm based on weighted co-association rates, utilizing smoothness regularization to derive the optimal label descriptive function. Experimental results confirm that the proposed algorithm outperforms previous methods.
Smoothness regularization derives the optimal regression function by minimizing the squared loss combined with a smoothness regularizer that restricts the variation of the function within a neighboring region. Thus, the regression function can effectively accommodate intrinsic data structures, and prediction performance can be improved when the label information is insufficient. In this study, we propose a weighted co-association rate-based Laplacian regularized label description algorithm. In the proposed algorithm, we define a regression function by combining weighted co-association rates and a label descriptive function. We use the weighted co-association rate, computed by summarizing various clustering solutions, to depict the data structure. The label descriptive function identifies a latent label distribution, and hence helps the regression function to accurately involve as much true label information as possible. To derive the optimal label descriptive function, we apply the smoothness regularizer to label descriptive function. Experiments were conducted on various benchmark datasets to examine the properties of the proposed algorithms, and the results were compared with those of the existing methods. The experimental results confirm that the proposed algorithm outperforms the previous methods. (C) 2020 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据