|
|
|
@inproceedings{DBLP:conf/ssdbm/Meier97,
author = {Kathrin Anne Meier},
editor = {Yannis E. Ioannidis and
David M. Hansen},
title = {Data Abstraction through Density Estimation by Storage Management},
booktitle = {Ninth International Conference on Scientific and Statistical
Database Management, Proceedings, August 11-13, 1997, Olympia,
Washington, USA},
publisher = {IEEE Computer Society},
year = {1997},
isbn = {0-8186-7952-2},
pages = {39-47},
ee = {db/conf/ssdbm/Meier97.html},
crossref = {DBLP:conf/ssdbm/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
One way to cope with the constantly growing amount of scientific data to be analyzed is to derive data abstractions from the original data. Data abstractions can provide a representation of the data in compressed form where the data's semantic structure is maintained. We have explored data abstractions based on} density estimation. Our method to estimate the density of scientific data sets is based on the directory of a multidimensional data access structure. This data density estimator is called directory estimator. It is based on multidimensional adaptive histograms and is therefore computationally efficient, even for large data sets and many dimensions.
This paper describes the methodology in general and focuses on the estimator's accuracy in particular. The accuracy of the directory estimator depends on the parameters of the access structures used, such as the bucket capacity. We evaluate the choice of bucket capacity theoretically as well as empirically with the ISE (Integrated Squared Error) being the measure of error and using a gridfile as the data access structure.
A useful application of the directory estimator in the field of scientific data is presented with a practical example from astronomy.
Copyright © 1997 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.