Outlier detection under interval uncertainty: algorithmic solvability and computational complexity

DOI10.1007/S11155-005-5943-7MaRDI QIDQ2484030zbMATHOpenAlexFDO

Authors Luc Longpré, Praveen Patangay, Scott A. Ferson, Vladik Kreinovich, Lev R. Ginzburg

Publication date 2 August 2005

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1283&context=cs_techrep

zbMATH Keywords

computational complexitynonlinear optimizationefficient quadratic-time algorithmsexact ranges of interval boundsguaranteed outliersinterval rangesinterval uncertainty approachoutlier detection problempossible outliers

Mathematics Subject Classification ID

Parametric tolerance and confidence regions (62F25) Complexity and performance of numerical algorithms (65Y20) Interval and finite arithmetic (65G30)

Recommendations

• Large-Scale Scientific Computing
• Discovery Science
• scientific article; zbMATH DE number 863578
• scientific article; zbMATH DE number 1143761

Cites work

• scientific article; zbMATH DE number 429516 (Why is no real title available?)
• scientific article; zbMATH DE number 824929 (Why is no real title available?)
• Computational complexity and feasibility of data processing and interval computations
• Interval methods in non-destructive testing of material structures
• Introduction to algorithms
• Large-Scale Scientific Computing
• STATISTICAL AND DEMPSTER-SHAFER TECHNIQUES IN TESTING STRUCTURAL INTEGRITY OF AEROSPACE STRUCTURES

Cited in

(10)

• Discovery Science
• Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity
• Outlier detection in interval data
• Should data ever be thrown away? Pooling interval-censored data sets with different precision
• Large-Scale Scientific Computing
• Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms
• NP-hardness of some data cleaning problem
• Computing population variance and entropy under interval uncertainty: Linear-time algorithms
• The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
• On outlier detection with the Chebyshev type inequalities

This page was built for publication: Outlier detection under interval uncertainty: algorithmic solvability and computational complexity

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