Log in

Relevant bibliographies by topics / Data approximation / Journal articles

To see the other types of publications on this topic, follow the link: Data approximation.

Journal articles on the topic 'Data approximation'

Author: Grafiati

Published: 7 December 2024

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Data approximation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

FROYLAND, GARY, KEVIN JUDD, ALISTAIR I. MEES, DAVID WATSON, and KENJI MURAO. "CONSTRUCTING INVARIANT MEASURES FROM DATA." International Journal of Bifurcation and Chaos 05, no. 04 (1995): 1181–92. http://dx.doi.org/10.1142/s0218127495000843.

Full text

Abstract:

We present a method of approximating an invariant measure of a dynamical system from a finite set of experimental data. Our reconstruction technique automatically provides us with a partition of phase space, and we assign each set in the partition a certain weight. By refining the partition, we may make our approximation to an invariant measure of the reconstructed system as accurate as we wish. Our method provides us with both a singular and an absolutely continuous approximation, so that the most suitable representation may be chosen for a particular problem.

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Jing-Bo, Hong Liu, and Zhi-Fu Zhang. "A separable-kernel decomposition method for approximating the DSR continuation operator." GEOPHYSICS 72, no. 1 (2007): S25—S31. http://dx.doi.org/10.1190/1.2399368.

Full text

Abstract:

We develop a separable-kernel decomposition method for approximating the double-square-root (DSR) continuation operator in one-way migrations in this paper. This new approach is a further development of separable approximations of the single-square-root (SSR) operator. The separable approximation of the DSR operator generally involves solving a complicated nonlinear system of integral equations. Instead of solving this nonlinear system directly, our new method consists of repeatedly applying the separable-kernel technique developed for the two-variable SSR operator to the multivariable DSR ope

APA, Harvard, Vancouver, ISO, and other styles

3

STOJANOVIĆ, MIRJANA. "PERTURBED SCHRÖDINGER EQUATION WITH SINGULAR POTENTIAL AND INITIAL DATA." Communications in Contemporary Mathematics 08, no. 04 (2006): 433–52. http://dx.doi.org/10.1142/s0219199706002180.

Full text

Abstract:

We consider linear Schrödinger equation perturbed by delta distribution with singular potential and the initial data. Due to the singularities appearing in the equation, we introduce two kinds of approximations: the parameter's approximation for potential and the initial data given by mollifiers of different growth and the approximation for the Green function for Schrödinger equation with regularized derivatives. These approximations reduce the perturbed Schrödinger equation to the family of singular integral equations. We prove the existence-uniqueness theorems in Colombeau space [Formula: se

APA, Harvard, Vancouver, ISO, and other styles

4

Grubas, Serafim I., Georgy N. Loginov, and Anton A. Duchkov. "Traveltime-table compression using artificial neural networks for Kirchhoff-migration processing of microseismic data." GEOPHYSICS 85, no. 5 (2020): U121—U128. http://dx.doi.org/10.1190/geo2019-0427.1.

Full text

Abstract:

Massive computation of seismic traveltimes is widely used in seismic processing, for example, for the Kirchhoff migration of seismic and microseismic data. Implementation of the Kirchhoff migration operators uses large precomputed traveltime tables (for all sources, receivers, and densely sampled imaging points). We have tested the idea of using artificial neural networks for approximating these traveltime tables. The neural network has to be trained for each velocity model, but then the whole traveltime table can be compressed by several orders of magnitude (up to six orders) to the size of l

APA, Harvard, Vancouver, ISO, and other styles

5

FRAHLING, GEREON, PIOTR INDYK, and CHRISTIAN SOHLER. "SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS." International Journal of Computational Geometry & Applications 18, no. 01n02 (2008): 3–28. http://dx.doi.org/10.1142/s0218195908002520.

Full text

Abstract:

A dynamic geometric data stream is a sequence of m ADD/REMOVE operations of points from a discrete geometric space {1,…, Δ} d ?. ADD (p) inserts a point p from {1,…, Δ} d into the current point set P , REMOVE(p) deletes p from P . We develop low-storage data structures to (i) maintain ε-nets and ε-approximations of range spaces of P with small VC-dimension and (ii) maintain a (1 + ε)-approximation of the weight of the Euclidean minimum spanning tree of P . Our data structure for ε-nets uses [Formula: see text] bits of memory and returns with probability 1 – δ a set of [Formula: see text] point

APA, Harvard, Vancouver, ISO, and other styles

6

Mardia, K. V., and I. L. Dryden. "Shape distributions for landmark data." Advances in Applied Probability 21, no. 4 (1989): 742–55. http://dx.doi.org/10.2307/1427764.

Full text

Abstract:

The paper obtains the exact distribution of Bookstein's shape variables under his plausible model for landmark data. We consider its properties including invariances, marginal distributions and the relationship with Kendall's uniform measure. Particular cases for triangles and quadrilaterals are highlighted. A normal approximation to the distribution is obtained, extending Bookstein's result for three landmarks. The adequacy of these approximations is also studied.

APA, Harvard, Vancouver, ISO, and other styles

7

Mardia, K. V., and I. L. Dryden. "Shape distributions for landmark data." Advances in Applied Probability 21, no. 04 (1989): 742–55. http://dx.doi.org/10.1017/s0001867800019029.

Full text

Abstract:

The paper obtains the exact distribution of Bookstein's shape variables under his plausible model for landmark data. We consider its properties including invariances, marginal distributions and the relationship with Kendall's uniform measure. Particular cases for triangles and quadrilaterals are highlighted. A normal approximation to the distribution is obtained, extending Bookstein's result for three landmarks. The adequacy of these approximations is also studied.

APA, Harvard, Vancouver, ISO, and other styles

8

Birch, A. C., and A. G. Kosovichev. "Towards a Wave Theory Interpretation of Time-Distance Helioseismology Data." Symposium - International Astronomical Union 203 (2001): 180–82. http://dx.doi.org/10.1017/s0074180900219025.

Full text

Abstract:

Time-distance helioseismology, which measures the time for acoustic waves to travel between points on the solar surface, has been used to study small-scale three-dimensional features in the sun, for example active regions, as well as large-scale features, such as meridional flow, that are not accessible by standard global helioseismology. Traditionally, travel times have been interpreted using geometrical ray theory, which is not always a good approximation. In order to develop a wave interpretation of time-distance data we employ the first Born approximation, which takes into account finite-w

APA, Harvard, Vancouver, ISO, and other styles

9

Nawar, A. S., R. Abu-Gdairi, M. K. El-Bably, and H. M. Atallah. "Enhancing Rheumatic Fever Analysis via Tritopological Approximation Spaces for Data Reduction." Malaysian Journal of Mathematical Sciences 18, no. 2 (2024): 321–41. http://dx.doi.org/10.47836/mjms.18.2.07.

Full text

Abstract:

This paper introduces the concept of tritopological approximation space, extending conventional approximation space by drawing upon topological spaces and precisely defined binary relations within a universe of discourse. Through meticulous construction of subbases, this progressive paradigm shift facilitates a comprehensive analysis of rough sets within the domain of tritopological approximation spaces. Additionally, the study pioneer's multiple membership functions and inclusion functions, enhancing the analytical framework and enabling more effective redefinition of rough approximations. To

APA, Harvard, Vancouver, ISO, and other styles

10

Bathie, Gabriel, and Guillaume Lagarde. "A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 15 (2025): 15516–23. https://doi.org/10.1609/aaai.v39i15.33703.

Full text

Abstract:

Efficiently computing accurate representations of high-dimensional data is essential for data analysis and unsupervised learning. Dendrograms, also known as ultrametrics, are widely used representations that preserve hierarchical relationships within the data. However, popular methods for computing them, such as *linkage* algorithms, suffer from quadratic time and space complexity, making them impractical for large datasets. The "best ultrametric embedding" (a.k.a. "best ultrametric fit") problem, which aims to find the ultrametric that best preserves the distances between points in the origin

APA, Harvard, Vancouver, ISO, and other styles

11

Chervov, Alexander, Jonathan Bac, and Andrei Zinovyev. "Minimum Spanning vs. Principal Trees for Structured Approximations of Multi-Dimensional Datasets." Entropy 22, no. 11 (2020): 1274. http://dx.doi.org/10.3390/e22111274.

Full text

Abstract:

Construction of graph-based approximations for multi-dimensional data point clouds is widely used in a variety of areas. Notable examples of applications of such approximators are cellular trajectory inference in single-cell data analysis, analysis of clinical trajectories from synchronic datasets, and skeletonization of images. Several methods have been proposed to construct such approximating graphs, with some based on computation of minimum spanning trees and some based on principal graphs generalizing principal curves. In this article we propose a methodology to compare and benchmark these

APA, Harvard, Vancouver, ISO, and other styles

12

Ullah, Insha, Sudhir Paul, Zhenjie Hong, and You-Gan Wang. "Significance tests for analyzing gene expression data with small sample sizes." Bioinformatics 35, no. 20 (2019): 3996–4003. http://dx.doi.org/10.1093/bioinformatics/btz189.

Full text

Abstract:

Abstract Motivation Under two biologically different conditions, we are often interested in identifying differentially expressed genes. It is usually the case that the assumption of equal variances on the two groups is violated for many genes where a large number of them are required to be filtered or ranked. In these cases, exact tests are unavailable and the Welch’s approximate test is most reliable one. The Welch’s test involves two layers of approximations: approximating the distribution of the statistic by a t-distribution, which in turn depends on approximate degrees of freedom. This stu

APA, Harvard, Vancouver, ISO, and other styles

13

Dong, Bin, Zuowei Shen, and Jianbin Yang. "Approximation from Noisy Data." SIAM Journal on Numerical Analysis 59, no. 5 (2021): 2722–45. http://dx.doi.org/10.1137/20m1389091.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Piegl, L. A., and W. Tiller. "Data Approximation Using Biarcs." Engineering with Computers 18, no. 1 (2002): 59–65. http://dx.doi.org/10.1007/s003660200005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Abd El-Raheem, Abd El-Raheem M., and Mona Hosny. "Saddlepoint p-values for a class of nonparametric tests for the current status and panel count data under generalized permuted block design." AIMS Mathematics 8, no. 8 (2023): 18866–80. http://dx.doi.org/10.3934/math.2023960.

Full text

Abstract:

<abstract><p>Current status and panel count data appear in many applied fields, including medicine, clinical trials, epidemiology, econometrics, demography, engineering and public health. Therefore, in this article, we use the saddlepoint approximation method to approximate the exact p-value of a number of nonparametric tests for the current status and panel count data under a generalized permuted block design. The saddlepoint approximation is referred to as higher-order approximation and it is more accurate than the methods that lead to approximations that are accurate to the firs

APA, Harvard, Vancouver, ISO, and other styles

16

Grzymala-Busse, Jerzy W., and Wojciech Rz�sa. "Approximation Space and LEM2-like Algorithms for Computing Local Coverings." Fundamenta Informaticae 85, no. 1-4 (2008): 205–17. https://doi.org/10.3233/fun-2008-851-415.

Full text

Abstract:

In this paper we discuss approximation spaces that are useful for studying local lower and upper approximations. Set definability and properties of the approximation space, including best approximations, are considered as well. Finding best approximations is a NP-hard problem. Finally, we present LEM2-like algorithms for determining local lower and upper coverings for a given incomplete data set. Lower and upper approximations, associated with these coverings, are sub-optimal.

APA, Harvard, Vancouver, ISO, and other styles

17

Bochkov, A. P., V. A. Prourzin, and O. V. Prourzin. "BIG DATA ANALYSIS OF RELIABILITY OF NON-RESTORABLE MULTICHANNEL SYSTEMS." H&ES Research 13, no. 4 (2021): 49–55. http://dx.doi.org/10.36724/2409-5419-2021-13-4-49-55.

Full text

Abstract:

Introduction: methods for analyzing big data of reliability of multichannel systems with a loaded reserve with nonrecoverable elements are considered. Big data contains information on the operating time to failure of elements, obtained by monitoring the operation of similar systems. The main problem that arises when analyzing big data is related to its variety and veracity. Reliability data of system elements correspond to different operating conditions and different laws of failure distribution. The exponential approximation of failure distributions greatly simplifies reliability analysis. Ho

APA, Harvard, Vancouver, ISO, and other styles

18

El, Sayed. "Nano simply alpha open set and novel neighborhood techniques for accurate symptom detection in medical applications." Thermal Science 28, no. 6 Part B (2024): 5125–41. https://doi.org/10.2298/tsci2406125s.

Full text

Abstract:

This study introduces the nano simply alpha open set and proposes a new approximation space extending Pawlak?s approximation. This new space includes the nano simply alpha lower and nano simply alpha upper approximations, denoted by specific notations, offering a refined framework for analyzing data. The ? n?-lower and ? n?-upper approximations for any set Also, we study nano ? n?-rough approximation. Those investigations look at the connections between various approximation types and their characteristics, proposing methods applicable to medical diagnosis and other decision-making fields. The

APA, Harvard, Vancouver, ISO, and other styles

19

Siswantining, Titin, Muhammad Ihsan, Saskya Mary Soemartojo, Devvi Sarwinda, Herley Shaori Al-Ash, and Ika Marta Sari. "MULTIPLE IMPUTATION FOR ORDINARY COUNT DATA BY NORMAL DISTRIBUTION APPROXIMATION." MEDIA STATISTIKA 14, no. 1 (2021): 68–78. http://dx.doi.org/10.14710/medstat.14.1.68-78.

Full text

Abstract:

Missing values are a problem that is often encountered in various fields and must be addressed to obtain good statistical inference such as parameter estimation. Missing values can be found in any type of data, included count data that has Poisson distributed. One solution to overcome that problem is applying multiple imputation techniques. The multiple imputation technique for the case of count data consists of three main stages, namely the imputation, the analysis, and pooling parameter. The use of the normal distribution refers to the sampling distribution using the central limit theorem fo

APA, Harvard, Vancouver, ISO, and other styles

20

Pratiwi, Indah Nur, Mohammad Syamsu Rosid, and Humbang Purba. "Reducing Residual Moveout for Long Offset Data in VTI Media Using Padé Approximation." E3S Web of Conferences 125 (2019): 15005. http://dx.doi.org/10.1051/e3sconf/201912515005.

Full text

Abstract:

Modification of the hyperbolic travel time equation into non-hyperbolic travel time equation is important to increase the reduction residual moveout for long offset data. Some researchers have modified hyperbolic travel time equation into a non-hyperbolic travel time equation to obtain a more accurate value NMO velocity and parameter an-ellipticity or etha on the large offset to depth ratio (ODR) so that the residual moveout value is smaller mainly in large offset to depth ratio. The aims of research is to increase the reduction value of error residue at long offset data using Padé approximati

APA, Harvard, Vancouver, ISO, and other styles

21

Jauch, Jens, Felix Bleimund, Michael Frey, and Frank Gauterin. "An Iterative Method Based on the Marginalized Particle Filter for Nonlinear B-Spline Data Approximation and Trajectory Optimization." Mathematics 7, no. 4 (2019): 355. http://dx.doi.org/10.3390/math7040355.

Full text

Abstract:

The B-spline function representation is commonly used for data approximation and trajectory definition, but filter-based methods for NWLS approximation are restricted to a bounded definition range. We present an algorithm termed NRBA for an iterative NWLS approximation of an unbounded set of data points by a B-spline function. NRBA is based on a MPF, in which a KF solves the linear subproblem optimally while a PF deals with nonlinear approximation goals. NRBA can adjust the bounded definition range of the approximating B-spline function during run-time such that, regardless of the initially ch

APA, Harvard, Vancouver, ISO, and other styles

22

Wille, Emilio. "APPROXIMATING PROBABILITY DISTRIBUTION FUNCTIONS WITH FEW MOMENTS." Latin American Applied Research - An international journal 50, no. 1 (2019): 21–25. http://dx.doi.org/10.52292/j.laar.2020.132.

Full text

Abstract:

A procedure is presented for approximating a given probability distribution function or statistical data considering a subset of their moments.This is done by a method of fitting moments of a piecewise linear functionto the moments of the known data. The approach has many advantages over popular approximation approaches. The procedure is demonstrated with commonly used cdfs (Exponential, Gamma, Log-Normal, Normal) andmore difficult problems involving sum and product of random variables,obtaining good agreement between the theoretical/simulation curves and the piecewise linear approximations.

APA, Harvard, Vancouver, ISO, and other styles

23

Sil, Samik. "Fracture parameter estimation from well-log data." GEOPHYSICS 78, no. 3 (2013): D129—D134. http://dx.doi.org/10.1190/geo2012-0407.1.

Full text

Abstract:

We evaluated a method of deriving seismic fracture parameters from vertical-well-log data with the assumption that the fractured medium is transversely isotropic with a horizontal axis of symmetry (HTI). One approximation we used is that the observed vertical P-wave velocity is the same as the background isotropic P-wave velocity of the HTI medium. Another assumption was that the fractures and cracks are noninteractive and penny shaped. Using these approximations, we generated the fracture compliance matrix for each layer. Fracture parameters were then derived by constructing the HTI stiffness

APA, Harvard, Vancouver, ISO, and other styles

24

Ma, Shuai, and Jinpeng Huai. "Approximate computation for big data analytics." ACM SIGWEB Newsletter, Winter (January 2021): 1–8. http://dx.doi.org/10.1145/3447879.3447883.

Full text

Abstract:

Over the past a few years, research and development has made significant progresses on big data analytics. A fundamental issue for big data analytics is the efficiency. If the optimal solution is unable to attain or unnecessary or has a price to high to pay, it is reasonable to sacrifice optimality with a "good" feasible solution that can be computed efficiently. Existing approximation techniques can be in general classified into approximation algorithms, approximate query processing for aggregate SQL queries and approximation computing for multiple layers of the system stack. In this article,

APA, Harvard, Vancouver, ISO, and other styles

25

Li, Renpu. "Set Approximation in Incomplete Data." Journal of Applied Sciences 13, no. 9 (2013): 1621–28. http://dx.doi.org/10.3923/jas.2013.1621.1628.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Piegl, L. A., and W. Tiller. "Surface approximation to scanned data." Visual Computer 16, no. 7 (2000): 386–95. http://dx.doi.org/10.1007/pl00013393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Can, Emine. "Piecewise Cubic Approximation for Data." American Journal of Applied Mathematics 1, no. 2 (2013): 24. http://dx.doi.org/10.11648/j.ajam.20130102.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Grohs, Philipp, Markus Sprecher, and Thomas Yu. "Scattered manifold-valued data approximation." Numerische Mathematik 135, no. 4 (2016): 987–1010. http://dx.doi.org/10.1007/s00211-016-0823-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Gorban, A. N., N. R. Sumner, and A. Y. Zinovyev. "Topological grammars for data approximation." Applied Mathematics Letters 20, no. 4 (2007): 382–86. http://dx.doi.org/10.1016/j.aml.2006.04.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hřebíček, Jiří, Jan Kučera, Petr Švenda, and Vladimír A. Vasilenko. "IDA — interactive data approximation package." Computer Physics Communications 61, no. 1-2 (1990): 231–33. http://dx.doi.org/10.1016/0010-4655(90)90121-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Narayanan, Swathi J., Ilango Paramasivam, Rajen B. Bhatt, and M. Khalid. "A Study on the Approximation of Clustered Data to Parameterized Family of Fuzzy Membership Functions for the Induction of Fuzzy Decision Trees." Cybernetics and Information Technologies 15, no. 2 (2015): 75–96. http://dx.doi.org/10.1515/cait-2015-0030.

Full text

Abstract:

Abstract This paper investigates the Triangular, Trapezoidal and Gaussian approximation methods for the purpose of induction of Fuzzy Decision Trees (FDT). The generation of FDT is done using a Fuzzy ID3 induction algorithm. In this work three fuzzy partitioning techniques which form the basis for our investigation are given attention, namely Fuzzy C Means clustering (FCM), Grid partitioning and Subtractive clustering (Subclust). Our contribution lies in studying the effect of various approximations on the generation of FDT giving specific attention to the classification accuracy of FDT. In th

APA, Harvard, Vancouver, ISO, and other styles

32

Borovsky, Andrei Viktorovich, Andrey Leonidovich Galkin, and Svetlana Sergeevna Kozlova. "Mathematical modeling of statistical data on the incidence of new coronavirus infection, taking into account the stratification by concomitant diagnoses." Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics 2024, no. 3 (2024): 95–106. http://dx.doi.org/10.24143/2072-9502-2024-3-95-106.

Full text

Abstract:

The article considers the stratification of concomitant diagnoses of Covid-19 recovery statistics for the city of Irkutsk for 2020-2021. The previous study was conducted without taking into account such stratification. Various options for approximating real statistics by Gaussian and Lorentz functions, gamma distribution, and Johnson curves are considered. It is shown that the stratification of recovery statistics improves the approximation of Gaussian and Lorentz functions in comparison with integral statistics, and the construction of an approximation based on the Lorentz function always des

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Jiani, Jennifer Erway, Xiaofei Hu, Qiang Zhang, and Robert Plemmons. "Randomized SVD Methods in Hyperspectral Imaging." Journal of Electrical and Computer Engineering 2012 (2012): 1–15. http://dx.doi.org/10.1155/2012/409357.

Full text

Abstract:

We present a randomized singular value decomposition (rSVD) method for the purposes of lossless compression, reconstruction, classification, and target detection with hyperspectral (HSI) data. Recent work in low-rank matrix approximations obtained from random projections suggests that these approximations are well suited for randomized dimensionality reduction. Approximation errors for the rSVD are evaluated on HSI, and comparisons are made to deterministic techniques and as well as to other randomized low-rank matrix approximation methods involving compressive principal component analysis. Nu

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Ziming, Chang Liu, Junjie Zhao, and Lijing Shao. "Extending the Fisher Information Matrix in Gravitational-wave Data Analysis." Astrophysical Journal 932, no. 2 (2022): 102. http://dx.doi.org/10.3847/1538-4357/ac6b99.

Full text

Abstract:

Abstract The Fisher information matrix (FM) plays an important role in forecasts and inferences in many areas of physics. While giving fast parameter estimation with Gaussian likelihood approximation in the parameter space, the FM can only give the ellipsoidal posterior contours of the parameters and it loses the higher-order information beyond Gaussianity. We extend the FM in gravitational-wave (GW) data analysis by using the Derivative Approximation for LIkelihoods (DALI), a method to expand the likelihood, while keeping it positive definite and normalizable at every order, for more accurate

APA, Harvard, Vancouver, ISO, and other styles

35

DeVore, Ronald, Boris Hanin, and Guergana Petrova. "Neural network approximation." Acta Numerica 30 (May 2021): 327–444. http://dx.doi.org/10.1017/s0962492921000052.

Full text

Abstract:

Neural networks (NNs) are the method of choice for building learning algorithms. They are now being investigated for other numerical tasks such as solving high-dimensional partial differential equations. Their popularity stems from their empirical success on several challenging learning problems (computer chess/Go, autonomous navigation, face recognition). However, most scholars agree that a convincing theoretical explanation for this success is still lacking. Since these applications revolve around approximating an unknown function from data observations, part of the answer must involve the a

APA, Harvard, Vancouver, ISO, and other styles

36

Marshalko, Grigory, and Julia Trufanova. "Polynomial Approximations for Several Neural Network Activation Functions." Informatics and Automation 21, no. 1 (2021): 161–80. http://dx.doi.org/10.15622/ia.2022.21.6.

Full text

Abstract:

Active deployment of machine learning systems sets a task of their protection against different types of attacks that threaten confidentiality, integrity and accessibility of both processed data and trained models. One of the promising ways for such protection is the development of privacy-preserving machine learning systems, that use homomorphic encryption schemes to protect data and models. However, such schemes can only process polynomial functions, which means that we need to construct polynomial approximations for nonlinear functions used in neural models. The goal of this paper is the co

APA, Harvard, Vancouver, ISO, and other styles

37

Skala, Vaclav, and Eliska Mourycova. "Meshfree Interpolation of Multidimensional Time-Varying Scattered Data." Computers 12, no. 12 (2023): 243. http://dx.doi.org/10.3390/computers12120243.

Full text

Abstract:

Interpolating and approximating scattered scalar and vector data is fundamental in resolving numerous engineering challenges. These methodologies predominantly rely on establishing a triangulated structure within the data domain, typically constrained to the dimensions of 2D or 3D. Subsequently, an interpolation or approximation technique is employed to yield a smooth and coherent outcome. This contribution introduces a meshless methodology founded upon radial basis functions (RBFs). This approach exhibits a nearly dimensionless character, facilitating the interpolation of data evolving over t

APA, Harvard, Vancouver, ISO, and other styles

38

Lin, Zi Zhi, and Si Hui Shu. "B-Spline Surface Approximation to Scanned Data Using Least Square Approximation." Applied Mechanics and Materials 571-572 (June 2014): 711–16. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.711.

Full text

Abstract:

Lofting is widely used to approximate the scanned data in row-wise fashion, but this method is prone to result an astonishing number of control points in the process of making the rows curve compatible. A novel algorithm of B-spline surface approximation to the scanned data is presented in this paper to solve this problem. Firstly, the scanned data are interpolated by rows of curves; then these curves are approximated by other curves using least square approximation. In this process, all curves are approximated by a common knot vector, and it is different form the traditional method that each

APA, Harvard, Vancouver, ISO, and other styles

39

Allmeier, Sebastian, and Nicolas Gast. "rmf tool - A library to Compute (Refined) Mean Field Approximation(s)." ACM SIGMETRICS Performance Evaluation Review 49, no. 4 (2022): 35–40. http://dx.doi.org/10.1145/3543146.3543156.

Full text

Abstract:

Mean field approximation is a powerful technique to study the performance of large stochastic systems represented as systems of interacting objects. Applications include load balancing models, epidemic spreading, cache replacement policies, or large-scale data centers, for which mean field approximation gives very accurate estimates of the transient or steady-state behaviors. In a series of recent papers [9, 7], a new and more accurate approximation, called the refined mean field approximation is presented. Yet, computing this new approximation can be cumbersome. The purpose of this paper is t

APA, Harvard, Vancouver, ISO, and other styles

40

Hunt, P. J. "Asymptotic Behaviour of an Integrated Video-Data Network." Probability in the Engineering and Informational Sciences 5, no. 4 (1991): 429–47. http://dx.doi.org/10.1017/s0269964800002217.

Full text

Abstract:

We consider a communication network that can support both wideband video calls and narrowband data traffic. First we consider a single link and prove a weak convergence result to justify a piecewise-deterministic Markov process approximation to the system. We then generalize this approximation to allow priorities and more than one link. This second approximation is a generalization of the Erlang fixed-point approximation for loss networks and is justified via a diverse routing limit theorem.

APA, Harvard, Vancouver, ISO, and other styles

41

Yang, Fan, and John Paparrizos. "SPARTAN: Data-Adaptive Symbolic Time-Series Approximation." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–30. https://doi.org/10.1145/3725357.

Full text

Abstract:

Symbolic approximations are dimensionality reduction techniques that convert time series into sequences of discrete symbols, enhancing interpretability while reducing computational and storage costs. To construct symbolic representations, first numeric representations approximate and capture properties of raw time series, followed by a discretization step that converts these numeric dimensions into symbols. Despite decades of development, existing approaches have several key limitations that often result in unsatisfactory performance: they (i) rely on data-agnostic numeric approximations, disr

APA, Harvard, Vancouver, ISO, and other styles

42

Levin, David. "Reconstruction of Piecewise Smooth Multivariate Functions from Fourier Data." Axioms 9, no. 3 (2020): 88. http://dx.doi.org/10.3390/axioms9030088.

Full text

Abstract:

In some applications, one is interested in reconstructing a function f from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we suggest a method for deriving high order approximation to f using a Padé-like method. Namely, we do this by fitting some Fourier coefficients of the approximant to the given Fourier coefficients of f. Given the Fourier series coefficients of a function on a rectangular domain in Rd, assuming the function is piecewise smooth, we approximate the function by piec

APA, Harvard, Vancouver, ISO, and other styles

43

Vygodchikova, Irina Yu. "Approximation of life expectancy in Russia based at interval data and minimax model." Journal of Applied Informatics 16, no. 91 (2021): 83–98. http://dx.doi.org/10.37791/2687-0649-2021-16-1-83-98.

Full text

Abstract:

Article provides automated processing of interval data on dynamics life expectancy in Russians over a long period of time (more than 100 years). Software product for approximation of dynamic processes in the demographic sphere that occur under unstable trend conditions is developed. Software product is based at the author's model of spline approximation the interval data by linear polynomials. The algorithm of program uses method for finding the moments of joining linear splines using reasonable properties of solving minimax problem for dynamic series whose values are interval data: the lower

APA, Harvard, Vancouver, ISO, and other styles

44

Cao, Zhixing, and Ramon Grima. "Accuracy of parameter estimation for auto-regulatory transcriptional feedback loops from noisy data." Journal of The Royal Society Interface 16, no. 153 (2019): 20180967. http://dx.doi.org/10.1098/rsif.2018.0967.

Full text

Abstract:

Bayesian and non-Bayesian moment-based inference methods are commonly used to estimate the parameters defining stochastic models of gene regulatory networks from noisy single cell or population snapshot data. However, a systematic investigation of the accuracy of the predictions of these methods remains missing. Here, we present the results of such a study using synthetic noisy data of a negative auto-regulatory transcriptional feedback loop, one of the most common building blocks of complex gene regulatory networks. We study the error in parameter estimation as a function of (i) number of cel

APA, Harvard, Vancouver, ISO, and other styles

45

Hamill, Colin D., Alexandria V. Johnson, Matt Lodge, et al. "The Effects of Cuboid Particle Scattering on Reflected Light Phase Curves: Insights from Laboratory Data and Theory." Astrophysical Journal 987, no. 2 (2025): 176. https://doi.org/10.3847/1538-4357/add7cf.

Full text

Abstract:

Abstract Understanding the optical properties of exoplanet cloud particles is a top priority. Many cloud condensates form as nonspherical particles and their optical properties can be very different from those of spheres. In this study, we focus on KCl particles, which likely form as cuboids in warm (T = 500–1000 K) exoplanet atmospheres. We compare the phase functions (at 532 nm wavelength) of KCl particles computed with Mie theory, the two-term Henyey–Greenstein (TTHG) approximation, laboratory data, and the discrete dipole approximation (DDA). Mie theory assumes scattering from spheres, whi

APA, Harvard, Vancouver, ISO, and other styles

46

Zhang, Xiao Lei, and Jin Ming Wu. "Positive Approximation for Positive Scattered Data." Applied Mechanics and Materials 50-51 (February 2011): 683–87. http://dx.doi.org/10.4028/www.scientific.net/amm.50-51.683.

Full text

Abstract:

The curve and surface fitting problem is very important in CAD and CAGD. However, it is important to construct a suitable function to interpolate or approximate which satisfies the underlying constraints since we have some additional information that is confined to interpolation or approximation. In this paper, we discuss the positive approximation for positive scattered data of any dimensionality by using radial basis functions. The approach is presented to compute positive approximation by solving a quadratic optimization problem. Numerical experiments are provided to illustrate the proposed

APA, Harvard, Vancouver, ISO, and other styles

47

Potts, Daniel, and Michael Schmischke. "Interpretable Approximation of High-Dimensional Data." SIAM Journal on Mathematics of Data Science 3, no. 4 (2021): 1301–23. http://dx.doi.org/10.1137/21m1407707.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Markovsky, Ivan, and Florian Dörfler. "Data-driven dynamic interpolation and approximation." Automatica 135 (January 2022): 110008. http://dx.doi.org/10.1016/j.automatica.2021.110008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Das, A., J. Gehrke, and M. Riedewald. "Semantic approximation of data stream joins." IEEE Transactions on Knowledge and Data Engineering 17, no. 1 (2005): 44–59. http://dx.doi.org/10.1109/tkde.2005.17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lazzeretti, Riccardo, Tommaso Pignata, and Mauro Barni. "Piecewise Function Approximation With Private Data." IEEE Transactions on Information Forensics and Security 11, no. 3 (2016): 642–57. http://dx.doi.org/10.1109/tifs.2015.2503268.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!