Weakly supervised regression using manifold regularization and low-rank matrix representation
V Berikov, A Litvinenko - … Conference, MOTOR 2021, Irkutsk, Russia, July …, 2021 - Springer
We solve a weakly supervised regression problem. Under “weakly” we understand that for
some training points the labels are known, for some unknown, and for others uncertain due …
some training points the labels are known, for some unknown, and for others uncertain due …
Semi-supervised classification using multiple clustering and low-rank matrix operations
V Berikov - … Optimization Theory and Operations Research: 18th …, 2019 - Springer
This paper proposes a semi-supervised classification method which combines machine
learning regularization framework and cluster ensemble approach. We use the low-rank …
learning regularization framework and cluster ensemble approach. We use the low-rank …
Semi-supervised regression using cluster ensemble and low-rank co-association matrix decomposition under uncertainties
In this paper, we solve a semi-supervised regression problem. Due to the lack of knowledge
about the data structure and the presence of random noise, the considered data model is …
about the data structure and the presence of random noise, the considered data model is …
GrpClassifierEC: a novel classification approach based on the ensemble clustering space
Background Advances in molecular biology have resulted in big and complicated data sets,
therefore a clustering approach that able to capture the actual structure and the hidden …
therefore a clustering approach that able to capture the actual structure and the hidden …
Regression analysis with cluster ensemble and kernel function
V Berikov, T Vinogradova - Analysis of Images, Social Networks and Texts …, 2018 - Springer
In this paper, we consider semi-supervised regression problem. The proposed method can
be divided into two steps. In the first step, a number of variants of clustering partition are …
be divided into two steps. In the first step, a number of variants of clustering partition are …
Solving weakly supervised regression problem using low-rank manifold regularization
We solve a weakly supervised regression problem. Under" weakly" we understand that for
some training points the labels are known, for some unknown, and for others uncertain due …
some training points the labels are known, for some unknown, and for others uncertain due …
Cluster ensemble kernel for kernel-based classification
N Odinokikh, V Berikov - 2019 International Multi-Conference …, 2019 - ieeexplore.ieee.org
This paper presents a method for some semi-supervised and supervised classification
problems based on properties of the averaged co-association matrix obtained with a cluster …
problems based on properties of the averaged co-association matrix obtained with a cluster …
Some properties of the classification algorithms using ensemble kernels
N Odinokikh, V Berikov - Journal of Physics: Conference Series, 2021 - iopscience.iop.org
In this paper, we study the properties of the KCCE algorithm (Kernel-based Classification
with Cluster Ensemble) proposed in our previous publication. Different strategies for …
with Cluster Ensemble) proposed in our previous publication. Different strategies for …
Proposing a New Framework for Automation of Thresholding in Wisdom of Crowds Cluster Ensemble Selection
Recently, researchers proposed heuristic frameworks which are based on the Wisdom of
Crowds in order to evaluate and select the basic results. In these methods, basic results are …
Crowds in order to evaluate and select the basic results. In these methods, basic results are …
[PDF][PDF] SEMI-SUPERVISED REGRESSION USING CLUSTER ENSEMBLE AND LOW-RANK CO-ASSOCIATION MATRIX DECOMPOSITION UNDER …
M Papadrakakis, V Papadopoulos, G Stefanou - 2019.uncecomp.org
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 …
about the data structure and the presence of random noise, the considered data model is …