Algorithmic complexity: threeNP- hard problems in computational statistics

DOI10.1080/00949658208810560MaRDI QIDQ3940795zbMATH OpenOpenAlexFDO

Authors William J. Welch

Publication date 1982

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic complexitycluster analysisD-optimaldesign of experimentsNP-completeNP-hardregressionsubset selection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) General nonlinear regression (62J02) Probabilistic methods, stochastic differential equations (65C99) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
• Complexity of Combinatorial Algorithms
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3800811 (Why is no real title available?)
• Optimum Designs in Regression Problems

Cited in

(31)

• The weighted sum of split and diameter clustering
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Cluster analysis and mathematical programming
• An algorithm based on semidefinite programming for finding minimax optimal designs
• Adaptive grid semidefinite programming for finding optimal designs
• A branch-and-bound algorithm for the exact optimal experimental design problem
• OWA fuzzy regression
• Multidimensional sum-up rounding for integer programming in optimal experimental design
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• A polynomial case of the cardinality-constrained quadratic optimization problem
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• \( \mathcal{G} \)-LIME: statistical learning for local interpretations of deep neural networks using global priors
• Approximation algorithms for \(D\)-optimal design
• Efficient computational algorithms for approximate optimal designs
• Complexity of penalized likelihood estimation
• Subset selection in sparse matrices
• A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints
• A Local Search Framework for Experimental Design
• A whale optimization algorithm (WOA) approach for clustering
• Generation of collocation points in the method of fundamental solutions for 2D Laplace's equation
• Minimum sum of diameters clustering
• Generalized maximum-entropy sampling
• Genetic clustering algorithms.
• Fuzzy modeling using the similarity-based approximate reasoning system
• A greedy feature selection algorithm for big data of high dimensionality
• Sign consistency of the generalized elastic net estimator
• Subsample selection methods in the lake management
• Removal of redundant candidate points for the exact D-optimal design problem
• Multi-model subset selection
• Bayesian D-optimal experimental designs via column subset selection
• Set partition by globally optimized cluster seed points

This page was built for publication: Algorithmic complexity: threeNP- hard problems in computational statistics

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