Sparse sufficient dimension reduction for Markov blanket discovery

DOI10.1080/03610918.2013.816560MaRDI QIDQ3178544zbMATH OpenOpenAlexFDO

Authors Xiaomao Li, Jianxing Yin

Publication date 14 July 2016

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2013.816560

zbMATH Keywords

sufficient dimension reductionMarkov blanketstructural learning

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12)

Recommendations

• Sparse sufficient dimension reduction
• Sparse MAVE with oracle panalties
• Coordinate-independent sparse sufficient dimension reduction and variable selection
• Sparse sufficient dimension reduction using optimal scoring
• High-dimensional sufficient dimension reduction through principal projections

Cites work

• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Class prediction and gene selection for DNA microarrays using regularized sliced inverse regression
• High-dimensional graphs and variable selection with the Lasso
• Shrinkage Inverse Regression Estimation for Model-Free Variable Selection
• Sufficient Dimension Reduction via Inverse Regression

Cited in

(1)

• Efficient score-based Markov blanket discovery

This page was built for publication: Sparse sufficient dimension reduction for Markov blanket discovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178544)