Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
From MaRDI portal
Publication:1048653
DOI10.1007/s11336-009-9130-3zbMath1179.62085OpenAlexW2090151809MaRDI QIDQ1048653
Renu Singh, Michael J. Brusco, Douglas Steinley
Publication date: 7 January 2010
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-009-9130-3
principal component analysiscombinatorial optimizationtabu searchvariable neighborhood searchvariable selection
Factor analysis and principal components; correspondence analysis (62H25) Combinatorial optimization (90C27)
Related Items
Exact methods for variable selection in principal component analysis: guide functions and pre-selection ⋮ A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis ⋮ Variable neighbourhood search: methods and applications ⋮ Quantile lower bounds to reliability based on locally optimal splits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational aspects of algorithms for variable selection in the context of principal components
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- The varimax criterion for analytic rotation in factor analysis
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- A general vehicle routing problem
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- How many principal components? Stopping rules for determining the number of non-trivial axes revisited
- On the number of principal components: a test of dimensionality based on measurements of similarity between matrices
- Matrix correlation
- An index of factorial simplicity
- Factor simplicity index and transformations
- Variable neighborhood search
- Principal component analysis.
- Discarding variables in a principal component analysis: algorithms for all-subsets comparisons
- Stepwise variable selection in factor analysis
- Selection of variables in exploratory factor analysis: an empirical comparison of a stepwise and traditional approach
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Variable selection in multivariate methods using global score estimation
- A variable neighborhood decomposition search method for supply chain management planning problems
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Variable neighborhood search for the linear ordering problem
- A variable-selection heuristic for K-means clustering
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- An Automatic Method of Solving Discrete Programming Problems
- Principal Variables
- Variable selection techniques in discriminant analysis: I. Description
- Variable selection techniques in discriminant analysis: II. Allocation
- Regressions by Leaps and Bounds
- Computations for Variable Selection in Discriminant Analysis
- Bandwidth Packing: A Tabu Search Approach
- Variable neighborhood search for the p-median
- Tabu search model selection in multiple regression analysis
- Principal Component Analysis Based on a Subset of Variables: Variable Selection and Sensitivity Analysis
- Variable Neighborhood Search
- Evaluation of a Branch and Bound Algorithm for Clustering
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- 9. Multidimensional Data Analysis
- Efficient variable screening for multivariate analysis
