Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach
DOI10.1016/0885-064X(90)90010-BzbMath0713.62006OpenAlexW2070296043MaRDI QIDQ750027
Publication date: 1990
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(90)90010-b
random vectorclassification problemjoint entropySASGaussian componentshigh degree of dependencelow degree of interdependencemeasure of interdependenceminimax criterionMINITABreduction of the number of componentssum of entropies
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10)
Uses Software
Cites Work
- A Mathematical Theory of Communication
- Data. A collection of problems from many fields for the student and research worker
- Projection pursuit
- Asymptotics of graphical projection pursuit
- Clustering Criteria and Multivariate Normal Mixtures
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach