Outlier detection under interval uncertainty: algorithmic solvability and computational complexity

DOI10.1007/s11155-005-5943-7zbMath1076.65014MaRDI QIDQ2484030

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

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 complexity; nonlinear optimization; efficient quadratic-time algorithms; exact ranges of interval bounds; guaranteed outliers; interval ranges; interval uncertainty approach; outlier detection problem; possible outliers

Mathematics Subject Classification ID

62F25: Parametric tolerance and confidence regions

65G30: Interval and finite arithmetic

65Y20: Complexity and performance of numerical algorithms

Related Items

Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity, The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data, Computing population variance and entropy under interval uncertainty: Linear-time algorithms, Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity and feasibility of data processing and interval computations
• STATISTICAL AND DEMPSTER-SHAFER TECHNIQUES IN TESTING STRUCTURAL INTEGRITY OF AEROSPACE STRUCTURES
• Large-Scale Scientific Computing
• Interval methods in non-destructive testing of material structures