Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Local Discriminant Embedding and Its Variants
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Locality sensitive semi-supervised feature selection
Neurocomputing
A unified framework for semi-supervised dimensionality reduction
Pattern Recognition
Semi-supervised orthogonal discriminant analysis via label propagation
Pattern Recognition
Locality sensitive discriminant analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Learning a locality discriminating projection for classification
Knowledge-Based Systems
Time series analysis with multiple resolutions
Information Systems
Text clustering using frequent itemsets
Knowledge-Based Systems
Face recognition using kernel direct discriminant analysis algorithms
IEEE Transactions on Neural Networks
Spectral clustering with discriminant cuts
Knowledge-Based Systems
A new automatic identification system of insect images at the order level
Knowledge-Based Systems
Hi-index | 0.00 |
Semi-supervised dimensional reduction methods play an important role in pattern recognition, which are likely to be more suitable for plant leaf and palmprint classification, since labeling plant leaf and palmprint often requires expensive human labor, whereas unlabeled plant leaf and palmprint is far easier to obtain at very low cost. In this paper, we attempt to utilize the unlabeled data to aid plant leaf and palmprint classification task with the limited number of the labeled plant leaf or palmprint data, and propose a semi-supervised locally discriminant projection (SSLDP) algorithm for plant leaf and palmprint classification. By making use of both labeled and unlabeled data in learning a transformation for dimensionality reduction, the proposed method can overcome the small-sample-size (SSS) problem under the situation where labeled data are scant. In SSLDP, the labeled data points, combined with the unlabeled data ones, are used to construct the within-class and between-class weight matrices incorporating the neighborhood information of the data set. The experiments on plant leaf and palmprint databases demonstrate that SSLDP is effective and feasible for plant leaf and palmprint classification.