A data-driven multidimensional indexing method for data mining in astrophysical databases (Q2502697)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A data-driven multidimensional indexing method for data mining in astrophysical databases |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A data-driven multidimensional indexing method for data mining in astrophysical databases |
scientific article |
Statements
A data-driven multidimensional indexing method for data mining in astrophysical databases (English)
0 references
13 September 2006
0 references
Summary: Large archives and digital sky surveys with dimensions of 1012 bytes currently exist, while in the near future they will reach sizes of the order of 1015. Numerical simulations are also producing comparable volumes of information. Data mining tools are needed for information extraction from such large datasets. In this work, we propose a multidimensional indexing method, based on a static R-tree data structure, to efficiently query and mine large astrophysical datasets. We follow a top-down construction method, called VAMSplit, which recursively splits the dataset on a near median element along the dimension with maximum variance. The obtained index partitions the dataset into nonoverlapping bounding boxes, with volumes proportional to the local data density. Finally, we show an application of this method for the detection of point sources from a gamma-ray photon list.
0 references
multidimensional indexing
0 references
VAMSplit R-tree
0 references
nearest-neighbor query
0 references
one-class SVM
0 references
point sources
0 references
0.8118516
0 references