Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Linear discriminant analysis with worst between-class separation and average within-class compactness
by
Leilei YANG Songcan CHEN
in
Algorithms
/ Computer Science
/ dimensionality reduction
/ Discriminant analysis
/ LDA
/ linear discriminant analysis
/ Maximization
/ Optimization
/ Research Article
/ Scattering
/ Separation
/ the average compactness
/ the worst separation
/ 分离
/ 对比实验
/ 平均
/ 最小距离
/ 紧凑
/ 线性判别分析
/ 距离度量
2014
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Linear discriminant analysis with worst between-class separation and average within-class compactness
by
Leilei YANG Songcan CHEN
in
Algorithms
/ Computer Science
/ dimensionality reduction
/ Discriminant analysis
/ LDA
/ linear discriminant analysis
/ Maximization
/ Optimization
/ Research Article
/ Scattering
/ Separation
/ the average compactness
/ the worst separation
/ 分离
/ 对比实验
/ 平均
/ 最小距离
/ 紧凑
/ 线性判别分析
/ 距离度量
2014
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Linear discriminant analysis with worst between-class separation and average within-class compactness
by
Leilei YANG Songcan CHEN
in
Algorithms
/ Computer Science
/ dimensionality reduction
/ Discriminant analysis
/ LDA
/ linear discriminant analysis
/ Maximization
/ Optimization
/ Research Article
/ Scattering
/ Separation
/ the average compactness
/ the worst separation
/ 分离
/ 对比实验
/ 平均
/ 最小距离
/ 紧凑
/ 线性判别分析
/ 距离度量
2014
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Linear discriminant analysis with worst between-class separation and average within-class compactness
Journal Article
Linear discriminant analysis with worst between-class separation and average within-class compactness
2014
Request Book From Autostore
and Choose the Collection Method
Overview
Linear discriminant analysis (LDA) is one of the most popular supervised dimensionality reduction (DR) tech- niques and obtains discriminant projections by maximizing the ratio of average-case between-class scatter to average- case within-class scatter. Two recent discriminant analysis algorithms (DAS), minimal distance maximization (MDM) and worst-case LDA (WLDA), get projections by optimiz- ing worst-case scatters. In this paper, we develop a new LDA framework called LDA with worst between-class separation and average within-class compactness (WSAC) by maximiz- ing the ratio of worst-case between-class scatter to average- case within-class scatter. This can be achieved by relaxing the trace ratio optimization to a distance metric learning prob- lem. Comparative experiments demonstrate its effectiveness. In addition, DA counterparts using the local geometry of data and the kernel trick can likewise be embedded into our frame- work and be solved in the same way.
Publisher
Higher Education Press,Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.