The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
From MaRDI portal
Publication:1623689
DOI10.1016/j.csda.2014.06.007zbMath1506.62034OpenAlexW2082209326MaRDI QIDQ1623689
Publication date: 23 November 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2014.06.007
computational complexityNP-hardnessinterval datainapproximabilitypseudopolynomial algorithms\(t\)-ratio
Related Items (5)
A mathematical programming approach to sample coefficient of variation with interval-valued observations ⋮ EIV regression with bounded errors in data: total `least squares' with Chebyshev norm ⋮ Two optimization problems in linear regression with interval data ⋮ Complexity of computing interval matrix powers for special classes of matrices. ⋮ Maximization of a PSD quadratic form and factorization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
- Computing statistics under interval and fuzzy uncertainty. Applications to computer science and engineering
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Computation of bounds on population parameters when the data are incomplete
- Credal ensembles of classifiers
- Stochastic dominance with imprecise information
- Why intervals? A simple limit theorem that is similar to limit theorems from statistics
- Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
- Exact bounds on finite populations of interval data
- Partial identification of spread parameters
- Symbolic Data Analysis
- Introduction to Interval Analysis
This page was built for publication: The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
