Font Size: a A A

Supervised And Semi-supervised Feature Combination Methods Based On Graph

Posted on:2015-08-10Degree:MasterType:Thesis
Country:ChinaCandidate:Z F ZhuFull Text:PDF
GTID:2180330422474994Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
In this paper, we study the feature combination of the supervised data andsemi-supervised data based on graphs, and propose a unified framework of supervisedfeature combination based on graphs (GF). And we take that Fisher discriminant analysis(FDA), principal component analysis(PCA), locality preserving projection (LPP),discriminant locality preserving projection (DLPP), marginal Fisher analysis (MFA), andmaximum margin criterion (MMC) add to GF, and obtain the corresponding methodswritten as GFDA, GPCA, GLPP, GDLPPP, GMFA and GMMC by means of differentselection of weighting matrixes. But the proposed framework meet with an oftensingularity problem of weighting matrixes, in order to deal with that problem, we makealgorithms for GF, that is regularized GF (RGF), GF based on null space (NGF), GF basedon singular value decomposition (GF/SVD), GF based on generalized singular valuedecomposition (GF/GSVD), and GF based on pseudo-inverse (PIGF), respectively.We propose semi-supervised GF (SGF) based on GF, and extend SGF with kerneltrick to obtain KSGF algorithm.A serise of experiments are made on AVIRIS remote sensing image in order toillustrate the efficient and effective of five feature combination methods. The resultsdemonstrate the effectiveness of the new feature combination. Particularly, GFDA is betterthan others, and KSGF is better than SGF.
Keywords/Search Tags:pattern recognition, congstruction of graph, supervised algorithm, semi-supervised algorithm, feature combination
PDF Full Text Request
Related items