.png){kind=icon}
.png){kind=icon}
Return
Information granule optimization and co-training based on kernel method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.111584.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Co-training was originally designed for multi-view data. Subsequent theoretical research has extended cotraining to the application of single-view data. The construction of a feature subspace is one of the methods to expand single-view data into multi-view data, so the establishment of a feature subspace is the key to this approach. In this paper, the kernel method is used to form an implicit feature subspace, to perform multi-view cotraining on single-view data. Because the attribute value in the feature subspace is not known, the subspace is a pseudo-view. To make the view adapt to the base classifier, this paper uses the neighborhood classifier as the base classifier and proposes an adaptive kernel function and three kernel parameter optimization methods according to the characteristics of the neighborhood classifier to build the feature subspace adapted to the neighborhood classifier. The decision of the neighborhood classifier needs to be made based on information granules generated by unlabeled objects. In the iteration of the feature subspace, we can continuously learn and optimize the information granule, and finally form what we expect, to get the implicit feature space corresponding to the granule and improve the accuracy of the base classifier. Finally, taking five data sets from UCI, and using accuracy and F1-score as evaluation indicators, we conduct a comparative experiment. The experimental results show that an adaptive kernel function, three kernel parameter optimization methods, and the cotraining method presented in this paper are effective.
Keywords:
Co-training
Multiple kernel learning
Neighborhood classifier