Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
DOI10.1007/s11155-005-5943-7zbMath1076.65014OpenAlexW1992344407MaRDI 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
computational complexitynonlinear optimizationefficient quadratic-time algorithmsexact ranges of interval boundsguaranteed outliersinterval rangesinterval uncertainty approachoutlier detection problempossible outliers
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
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
This page was built for publication: Outlier detection under interval uncertainty: algorithmic solvability and computational complexity