IEEE Transactions on Neural Networks and Learning Systems · 2012 · 45 citations · 45 references
ComputingComputer ScienceData MiningMachine LearningStatistical LearningClassificationDimension ReductionDimensionality ReductionKernel MethodsMaximum Likelihood EstimationPattern RecognitionExpectation-maximizationExpectation-maximization AlgorithmGaussian Mixture ModelsIterative LearningKernel Discriminant AnalysisKernel TrickLinear Discriminant AnalysisSubspace Learning
In this paper, a theoretical link between mixture subclass discriminant analysis (MSDA) and a restricted Gaussian model is first presented. Then, two further discriminant analysis (DA) methods, i.e., fractional step MSDA (FSMSDA) and kernel MSDA (KMSDA) are proposed. Linking MSDA to an appropriate Gaussian model allows the derivation of a new DA method under the expectation maximization (EM) framework (EM-MSDA), which simultaneously derives the discriminant subspace and the maximum likelihood estimates. The two other proposed methods generalize MSDA in order to solve problems inherited from conventional DA. FSMSDA solves the subclass separation problem, that is, the situation in which the dimensionality of the discriminant subspace is strictly smaller than the rank of the inter-between-subclass scatter matrix. This is done by an appropriate weighting scheme and the utilization of an iterative algorithm for preserving useful discriminant directions. On the other hand, KMSDA uses the kernel trick to separate data with nonlinearly separable subclass structure. Extensive experimentation shows that the proposed methods outperform conventional MSDA and other linear discriminant analysis variants.
45
Yuhai Wu, Vladimir Vapnik · Technometrics · 1999 · 27K citations
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
Pattern Recognition and Machine Learning
Kybernetes · 2007 · 8.4K citations