Sentence examples for data approximation from inspiring English sources

Considering a subset of singular values of size kdata approximation depends on how many singular values are used [ 6].

When considering only a subset of singular values of size k < p, where p is the rank of A, we can achieve A k, an approximate matrix of the original matrix A: Thus, data approximation depends on how many singular values are used [ 34].

We present an error analysis of advanced techniques for scattered data approximation based on truncated hierarchical B-spline (THB-spline) constructions.

It can be concluded that the suggested Weibull mixture with an arbitrary but finite number of components is suitable for lifetime data approximation.

To reduce the computational cost, this paper proposes a piece-wise moving least squares approximation method (PMLS) for scattered data approximation.

The proposed algorithm is based on a spatio-temporal statistical identification method using both empirical orthogonal functions (EOF) analysis and partitioned network data approximation.

In contrast, modeling, exchange and translation of geometric models in engineering applications usually involve data approximations and algorithms with different numerical precisions.

We have therefore explored the implications of using alternative data approximations.

Multi-resolution independent component analysis (MICA) is built from the discrete wavelet transforms (DWT), principal component analysis (PCA), the first loading vector based data reconstruction, inverse discrete wavelet transforms (IDWT) induced meta-data approximation, and independent component analysis (ICA) based subspace spanning.

This motivates us to study adapting the sparsity of random projections according to channel conditions for improving the data-approximation performance as well as the system delay.

The resulted data-approximation error rate is comparable to that of the optimal k-term approximation if the energy of the signal is not concentrated in a few elements.