New Algorithms for Statistical Analysis of Interval Data
Author(s) -
Gang Xiang,
Scott A. Starks,
Владик Крейнович,
Luc Longpré
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-29067-2
DOI - 10.1007/11558958_21
Subject(s) - interval (graph theory) , computer science , interval data , algorithm , variance (accounting) , interval arithmetic , data mining , mathematics , measure (data warehouse) , combinatorics , mathematical analysis , accounting , business , bounded function
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one case was known for which a feasible algorithm can compute the variance of interval data: the case when all the measurements are accurate enough – so that even after the measurement, we can distinguish between different measured values $\widetilde x_i$. In this paper, we describe several new cases in which feasible algorithms are possible – e.g., the case when all the measurements are done by using the same (not necessarily very accurate) measurement instrument – or at least a limited number of different measuring instruments.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom