Balancing principle in supervised learning for a general regularization scheme

2020 ◽  
Vol 48 (1) ◽  
pp. 123-148 ◽  
Author(s):  
Shuai Lu ◽  
Peter Mathé ◽  
Sergei V. Pereverzev
Author(s):  
Baohuai Sheng ◽  
Daohong Xiang ◽  
Peixin Ye

Semi-supervised learning deals with learning with a small amount labeled sample and a large amount of unlabeled sample to improve the learning ability. The purpose of the semi-supervised gradient learning is to increase the smoothness of the solution using unlabeled gradient data. In this paper, we study the semi-supervised kernel-based regularization scheme involving function gradient value. We show that the learning rate can be bounded by a K-functional with gradients of the function, which verify how the unlabeled gradient data quantitatively influences the learning rate. Some approaches from convex analysis play a key role in our error analysis.


2018 ◽  
Vol 2018 (15) ◽  
pp. 132-1-1323
Author(s):  
Shijie Zhang ◽  
Zhengtian Song ◽  
G. M. Dilshan P. Godaliyadda ◽  
Dong Hye Ye ◽  
Atanu Sengupta ◽  
...  

2014 ◽  
Vol 6 (2) ◽  
pp. 46-51
Author(s):  
Galang Amanda Dwi P. ◽  
Gregorius Edwadr ◽  
Agus Zainal Arifin

Nowadays, a large number of information can not be reached by the reader because of the misclassification of text-based documents. The misclassified data can also make the readers obtain the wrong information. The method which is proposed by this paper is aiming to classify the documents into the correct group.  Each document will have a membership value in several different classes. The method will be used to find the degree of similarity between the two documents is the semantic similarity. In fact, there is no document that doesn’t have a relationship with the other but their relationship might be close to 0. This method calculates the similarity between two documents by taking into account the level of similarity of words and their synonyms. After all inter-document similarity values obtained, a matrix will be created. The matrix is then used as a semi-supervised factor. The output of this method is the value of the membership of each document, which must be one of the greatest membership value for each document which indicates where the documents are grouped. Classification result computed by the method shows a good value which is 90 %. Index Terms - Fuzzy co-clustering, Heuristic, Semantica Similiarity, Semi-supervised learning.


Sign in / Sign up

Export Citation Format

Share Document