Реферат: 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 obtained with some clustering algorithm working on both labeled and unlabeled data. Weighted co-association matrix is calculated using the results of partitioning. It is known that this matrix satisfies Mercer’s condition, so it can be used as a kernel for a kernel-based regression algorithm. In the second step, we use the obtained matrix as kernel to construct the decision function based on labelled data. With the use of probabilistic model, we prove that the probability that the error is significant converges to its minimum possible value as the number of elements in the cluster ensemble tends to infinity. Output of the method applied to a real set of data is compared with the results of popular regression methods that use a standard kernel and have all the data labelled. In noisy conditions the proposed method showed higher quality, compared with support vector regression algorithm with standard kernel. © Springer Nature Switzerland AG 2018.

Библиографическая ссылка: Berikov V. , Vinogradova T.
Regression analysis with cluster ensemble and kernel function
Lecture Notes in Computer Science. 2018. V.11179 LNCS. P.211-220. DOI: 10.1007/978-3-030-11027-7_21 Scopus OpenAlex

Идентификаторы БД:

Scopus:	2-s2.0-85059931171
OpenAlex:	W2907086500

Цитирование в БД:

БД	Цитирований
Scopus	3
OpenAlex	2

Альметрики: