• No se han encontrado resultados

Time series variability tree for fast light curve retrieval

N/A
N/A
Protected

Academic year: 2020

Share "Time series variability tree for fast light curve retrieval"

Copied!
55
0
0

Texto completo

Loading

Figure

Figure 2.1. The generic tree data structure with its main parts.
Table 2.1. Text retrieval concepts exemplified.
Figure 3.1. The Variability Tree building process.
Figure 3.3. Tree construction through top-down hierarchical k-medoids. For simplicity, light curves are represented as points in a 2-dimensional space
+7

Referencias

Documento similar

The k Nearest Neighbors (kNN) [32] algorithm is recognized as one of the top ten most influential algorithms in data mining because of its effectiveness on classification and

In two dimensions, this boundary is a contour, and these directional data will in fact form a curve, that manipulated as functional data can be used to encode the shapes in two

[8] proposed the method of Kriging to predict material properties from nanoindentation curves as an approach of curve fitting between experimental and numerical

This thesis is devoted to different quantum phenomena emerging from the interaction of light and matter in the strong coupling regime —the modification of the statistics of the

We detected the transit light-curve signature in the course of the TrES multi-site transiting planet survey, and confirmed the planetary nature of the companion via

Further, we considered the results obtained for the white light curve fit of the Run 2 as unreliable since a clear and dominant systematic noise signal in the data remained

In addition to the usual advantages of SUSY models, the µνSSM, through the presence of three families of right-handed neutrino superfields can simultaneously solve the µ-problem of

For the time being, however, we can conservatively state —based on an up-to-date compilation of rotation curve data and a comprehensive collection of data-inferred morphologies of