An overview of mapping techniques for exploratory pattern analysis
cluster analysisexploratory data analysisexploratory pattern analysisFisher discriminantgeneralized declustering mappingk-nearest- neighbor mappingleast squares mappinglinear mappingspattern classifiersprincipal component mappingsprojection pursuit mappingsreview of mapping techniquestriangulation mapping
We present an extensive review of mapping techniques for exploratory pattern analysis. We place these techniques in eight major groups. Among them is our own innovation - the least squares mapping. We also introduce a method that accelerates and increases the precision of mappings based on the Fisher discriminant. In a sequel, to be published in this journal, we describe experiments that show that mapping techniques can be a versatile and powerful tool for cluster analysis and classifier design.
- A Declustering Criterion for Feature Extraction in Pattern Recognition
- A Fast-Converging Algorithm for Nonlinear Mapping of High-Dimensional Data to a Plane
- A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- An Optimal Discriminant Plane
- Application of the Karhunen-Loève Expansion to Feature Selection and Ordering
- Experiments on mapping techniques for exploratory pattern analysis
- scientific article; zbMATH DE number 3883434 (Why is no real title available?)
- scientific article; zbMATH DE number 3340933 (Why is no real title available?)
- Projection pursuit
This page was built for publication: An overview of mapping techniques for exploratory pattern analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102668)