Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression

Abstract 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.

Paper

Full text

PDF

Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression

Semantic Scholar · Computer Science · 2021

Abstract

Abstract 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.

Similar papers

© 2026 NYSGPT2525 LLC