Scalable Semi-Supervised Learning by Efficient Anchor Graph Regularization

2016 ◽  
Vol 28 (7) ◽  
pp. 1864-1877 ◽  
Author(s):  
Meng Wang ◽  
Weijie Fu ◽  
Shijie Hao ◽  
Dacheng Tao ◽  
Xindong Wu
Keyword(s):  
Supervised Learning ◽  
Graph Regularization

scholarly journals Sub-Graph Regularization on Kernel Regression for Robust Semi-Supervised Dimensionality Reduction

Entropy ◽  
2019 ◽  
Vol 21 (11) ◽  
pp. 1125
Author(s):  
Jiao Liu ◽  
Mingbo Zhao ◽  
Weijian Kong
Keyword(s):  
Dimensionality Reduction ◽  
Supervised Learning ◽  
Kernel Regression ◽  
Classification Performance ◽  
Unlabeled Data ◽  
Graph Regularization ◽  
Linear Discriminant ◽  
Benchmark Datasets ◽  
Reduction Methods ◽  
Class Labels

Dimensionality reduction has always been a major problem for handling huge dimensionality datasets. Due to the utilization of labeled data, supervised dimensionality reduction methods such as Linear Discriminant Analysis tend achieve better classification performance compared with unsupervised methods. However, supervised methods need sufficient labeled data in order to achieve satisfying results. Therefore, semi-supervised learning (SSL) methods can be a practical selection rather than utilizing labeled data. In this paper, we develop a novel SSL method by extending anchor graph regularization (AGR) for dimensionality reduction. In detail, the AGR is an accelerating semi-supervised learning method to propagate the class labels to unlabeled data. However, it cannot handle new incoming samples. We thereby improve AGR by adding kernel regression on the basic objective function of AGR. Therefore, the proposed method can not only estimate the class labels of unlabeled data but also achieve dimensionality reduction. Extensive simulations on several benchmark datasets are conducted, and the simulation results verify the effectiveness for the proposed work.

A Supervised Learning Approach for Dynamic Sampling (SLADS) in Raman Hyperspectral Imaging

2018 ◽  
Vol 2018 (15) ◽  
pp. 132-1-1323
Author(s):  
Shijie Zhang ◽  
Zhengtian Song ◽  
G. M. Dilshan P. Godaliyadda ◽  
Dong Hye Ye ◽  
Atanu Sengupta ◽  
...  
Keyword(s):  
Supervised Learning ◽  
Hyperspectral Imaging ◽  
Learning Approach ◽  
Dynamic Sampling

Pembobotan Berdasarkan Tingkat Kesamaan Semantik pada Metode Fuzzy Semi-Supervised Co-Clustering untuk Pengelompokkan Dokumen Teks

2014 ◽  
Vol 6 (2) ◽  
pp. 46-51
Author(s):  
Galang Amanda Dwi P. ◽  
Gregorius Edwadr ◽  
Agus Zainal Arifin
Keyword(s):  
Supervised Learning ◽  
Semantic Similarity ◽  
The Other ◽  
Classification Result ◽  
Document Similarity ◽  
The Matrix ◽  
Index Terms ◽  
Membership Value ◽  
Degree Of Similarity

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