Pages that link to "Item:Q1020883"

The following pages link to A graph approach to generate all possible regression submodels (Q1020883):

Displaying 16 items.

• Serial and parallel implementations of model-based clustering via parsimonious Gaussian mixture models (Q107986) (← links)
• Subset selection in multiple linear regression models: a hybrid of genetic and simulated annealing algorithms (Q482456) (← links)
• A fast algorithm for non-negativity model selection (Q746289) (← links)
• An efficient branch-and-bound strategy for subset vector autoregressive model selection (Q844693) (← links)
• An \(O(N)\) parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice (Q961736) (← links)
• Editorial: Second special issue on statistical algorithms and software (Q962293) (← links)
• Unbiased generalized quasi-regression (Q962315) (← links)
• Efficient algorithms for computing the best subset regression models for large-scale problems (Q1020780) (← links)
• Editorial: Special issue on statistical algorithms and software (Q1020850) (← links)
• Bayesian inference in non-homogeneous Markov mixtures of periodic autoregressions with state-dependent exogenous variables (Q1023565) (← links)
• A geometric interpretation of Mallows' \(C_p\) statistic and an alternative plot in variable selection (Q1023683) (← links)
• A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis (Q1623574) (← links)
• Covariate unit root tests with good size and power (Q1927093) (← links)
• Exact methods for variable selection in principal component analysis: guide functions and pre-selection (Q2359463) (← links)
• A regression tree algorithm for the identification of convergence clubs (Q2445733) (← links)
• Simultaneous feature selection and outlier detection with optimality guarantees (Q6055709) (← links)