Skip to main content
Skip to main menu Skip to spotlight region Skip to secondary region Skip to UGA region Skip to Tertiary region Skip to Quaternary region Skip to unit footer


Myung Hee Lee

<a href="">Colorado State University</a>

We propose linear discrimination methods which regularize piling of the low dimensional projections for high dimensional, low sample size data. The maximal data piling achieves the extreme regularization by yielding zero scatter within the class while maximizing the separation between the classes. Two different piling regularization methods are studied in this article. Our first attempt to regularize data piling is done by employing linear paths connecting the maximal data piling direction and least data piling direction. An alternative approach is to use optimal classification rules under milder piling constraints. We show that this is equivalent to the ridge LDA in HDLSS setting. This piling regularization idea is extended to multi category classification problems, which leads us to build sequential discriminating direction vectors. The simulation and data analysis shows competitive performance of the piling regularized classification methods.

Support us

We appreciate your financial support. Your gift is important to us and helps support critical opportunities for students and faculty alike, including lectures, travel support, and any number of educational events that augment the classroom experience. Click here to learn more about giving.

Every dollar givenĀ has a direct impact upon ourĀ students and faculty.