New concepts of principal component analysis based on maximum separation of clusters

DOI10.1080/03610918.2019.1697450MaRDI QIDQ5082987zbMATH OpenOpenAlexWikidataFDO

Authors Kaimeng Zhang, Chi Tim Ng, Yong Man Kwon, Myung Hwan Na

Publication date 21 June 2022

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

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

zbMATH Keywords

cluster analysisdata privacyknapsack problemprincipal component analysisrandomized multiple response

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A dynamic programming heuristic for the quadratic knapsack problem
• A near-optimal algorithm for differentially-private principal components
• Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
• Asking sensitive questions indirectly
• Finite mixture models
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• scientific article; zbMATH DE number 3396952 (Why is no real title available?)
• Randomized response: a survey technique for eliminating evasive answer bias
• Statistical analysis of factor models of high dimension

This page was built for publication: New concepts of principal component analysis based on maximum separation of clusters

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