Astronomy and Astrophysics – Astrophysics
Scientific paper
Jan 1998
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1998a%26as..127..319k&link_type=abstract
Astronomy and Astrophysics Supplement, v.127, p.319-325
Astronomy and Astrophysics
Astrophysics
Methods: Statistical, Astronomical Data Bases: Miscellaneous
Scientific paper
Many algorithms separating or detecting groups of similiar objects (for example the extraction of groups lying in a color-color-diagram) are based on two statistical methods: the Kernel Method (\cite[Silverman 1986]{si86}) or the Likelihood Statistic (\cite[van der Waerden 1957]{wa57}). These standard methods have one or more restrictions (e.g. known number or differentiability of the groups, \dots). We present here a new powerful algorithm and show results worked out with artificial data sets. The algorithm is based on Recursive Restoration Methods (neither on the Likelihood Statistic (\cite[Sutherland & Saunders 1992]{su92}) nor on the Kernel Method (\cite[De Jager et al. 1986]{de86})) and allows to detect substructures in a data set, even if they are overlapped or superimposed by any kind of dominating main structure. In comparison to the other methods mentioned above there are no restrictions concerning the form and the dimension of the components lying in the data set. The algorithm is easy to handle and therefore opens a wide range of applications for many fields of science (see \cite[Boller et al. 1992]{bo92}).
Kienel C.
Kimeswenger Stefan
No associations
LandOfFree
Covered data structures I. The algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Covered data structures I. The algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covered data structures I. The algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1650749