Semi-Supervised Linear Discriminant Clustering
Our Price
₹3,000.00
10000 in stock
Support
Ready to Ship
Description
Clustering and dimensionality reduction simultaneously by connecting K-means and linear discriminant analysis (LDA) to find a feature space where the K-means can perform well in the new space To exploit the information brought by unlabeled examples Analyze the influence of soft labels on classification performance by conducting experiments with different percentages of labeled examples. The finding shows that using soft labels can improve performance particularly since different soft label estimation methods can be used in the proposed method according to application requirements. Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing the between class covariance and simultaneously minimizing the within class covariance. In practice, when there are no sufficient training samples, the covariance matrix of each class may not be accurately estimated. In this paper, we propose a novel method, called Semi-supervised Discriminant Analysis (SDA), which makes use of both labeled and unlabeled samples. The labeled data points are used to maximize the separability between different classes and the unlabeled data points are used to estimate the intrinsic geometric structure of the data. Specifically, we aim to learn a discriminant function which is as smooth as possible on the data manifold. Experimental results on single training image face recognition and relevance feedback image retrieval demonstrate the effectiveness of our algorithm.
Tags: 2014, Data Mining Projects, Java