Principal minimax support vector machine for sufficient dimension reduction with contaminated data

Jingke Zhou and Lixing Zhu

Computational Statistics & Data Analysis, 2016, vol. 94, issue C, 33-48

Abstract: To make sufficient dimension reduction methods be able to handle contaminated data, a principal minimax support vector machine is suggested to identifying the central subspace. For sparse sufficient dimension reduction, this method of adaptive elastic net type is suggested to make estimation more accurate. The methods are extended to deal with transformed sufficient dimension reduction against contaminated data. The asymptotic unbiasedness and exhaustiveness are proved from the viewpoint of sufficient dimension reduction, and the sparseness and model selection consistency are showed from the viewpoint of variable selection. Simulations and real data analysis are conducted to examine the finite sample performances of the proposed methods.

Keywords: Minimax robust support vector machines; Robust sufficient dimension reduction; Sparse sufficient dimension reduction; Transformed sufficient dimension reduction (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167947315001498
Full text for ScienceDirect subscribers only.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:94:y:2016:i:c:p:33-48

DOI: 10.1016/j.csda.2015.06.011

Access Statistics for this article

Computational Statistics & Data Analysis is currently edited by S.P. Azen

More articles in Computational Statistics & Data Analysis from Elsevier
Bibliographic data for series maintained by Catherine Liu ().