Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Semi-supervised regression using cluster ensemble and low-rank co-association matrix decomposition under uncertainties. / Berikov, Vladimir; Litvinenko, Alexander.
Proceedings of the 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019. ed. / M. Papadrakakis; V. Papadopoulos; G. Stefanou. National Technical University of Athens, 2019. p. 229-242 (Proceedings of the 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Semi-supervised regression using cluster ensemble and low-rank co-association matrix decomposition under uncertainties
AU - Berikov, Vladimir
AU - Litvinenko, Alexander
N1 - Publisher Copyright: © 2019 Proceedings of the 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019. All rights reserved. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2019
Y1 - 2019
N2 - In this paper, we solve a semi-supervised regression problem. Due to the luck of knowledge about the data structure and the presence of random noise, the considered data model is uncertain. We propose a method which combines graph Laplacian regularization and cluster ensemble methodologies. The co-association matrix of the ensemble is calculated on both labeled and unlabeled data; this matrix is used as a similarity matrix in the regularization framework to derive the predicted outputs. We use the low-rank decomposition of the co-association matrix to significantly speedup calculations and reduce memory. Numerical experiments using the Monte Carlo approach demonstrate robustness, efficiency, and scalability of the proposed method.
AB - In this paper, we solve a semi-supervised regression problem. Due to the luck of knowledge about the data structure and the presence of random noise, the considered data model is uncertain. We propose a method which combines graph Laplacian regularization and cluster ensemble methodologies. The co-association matrix of the ensemble is calculated on both labeled and unlabeled data; this matrix is used as a similarity matrix in the regularization framework to derive the predicted outputs. We use the low-rank decomposition of the co-association matrix to significantly speedup calculations and reduce memory. Numerical experiments using the Monte Carlo approach demonstrate robustness, efficiency, and scalability of the proposed method.
KW - Cluster ensemble
KW - Co-association matrix
KW - Graph Laplacian regularization
KW - Hierarchical matrices
KW - Low-rank matrix decomposition
KW - Semi-supervised regression
UR - http://www.scopus.com/inward/record.url?scp=85079327596&partnerID=8YFLogxK
U2 - 10.7712/120219.6338.18377
DO - 10.7712/120219.6338.18377
M3 - Conference contribution
AN - SCOPUS:85079327596
SN - 9786188284494
T3 - Proceedings of the 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019
SP - 229
EP - 242
BT - Proceedings of the 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019
A2 - Papadrakakis, M.
A2 - Papadopoulos, V.
A2 - Stefanou, G.
PB - National Technical University of Athens
T2 - 3rd International Conference on Uncertainty Quantification in Computational Sciences and Engineering, UNCECOMP 2019
Y2 - 24 June 2019 through 26 June 2019
ER -
ID: 25504709