Search results for "algorithm"
showing 10 items of 4887 documents
Computing Sum of Products about the Mean with Pairwise Algorithms
1997
We discuss pairwise algorithms, a kind of computational algorithm which can be useful in dynamically updating statistics as new samples of data are collected. Since test data are usually collected through time as individual data sets, these algorithms would be profitably used in computer programs to treat this situation. Pair-wise algorithms are presented for calculating the sum of products of deviations about the mean for adding a sample of data (or removing one) to the whole data set.
A Novel Self-organizing Neural Technique for Wind Speed Mapping
2009
Systems with high nonlinearities are, in general, very difficult to model. This is particularly true in geostatistics, where the problem of the estimation of a regionalized variable (RV) given only a small amount of measurement stations and a complex terrain surface is very challenging. This paper introduces a novel strategy, which couples the Curvilinear Component Analysis (CCA) and the Generalized Mapping Regressor (GMR). CCA, which is a nonlinear projector of a data manifold, is here used in order to find the intrinsic dimension of the data manifold, just giving an insight on the nonlinearities of the problem. This analysis drives the pre-processing of the data set used for the training …
The Analysis of Auxological Data by Means of Nonlinear Multivariate Growth Curves
1999
In this paper we treat the problem to analyse a data set constituted by multivariate growth curves for different subjects; thus in this context we deal with 3-way data tables. Nevertheless, it is not possible using factorial techniques proposed to deal with 3-way data matrices, because the observations are generally not equally spaced; moreover a multilevel approach founded on polynomial models is not suitable to deal with intrinsic nonlinear models. We propose a non-factorial technique to analyse auxological data sets using an intrinsic nonlinear multivariate growth model with autocorrelated errors. The application to a real data set of growing children gave easily interpretable results.
Polar Classification of Nominal Data
2013
Many modern systems record various types of parameter values. Numerical values are relatively convenient for data analysis tools because there are many methods to measure distances and similarities between them. The application of dimensionality reduction techniques for data sets with such values is also a well known practice. Nominal (i.e., categorical) values, on the other hand, encompass some problems for current methods. Most of all, there is no meaningful distance between possible nominal values, which are either equal or unequal to each other. Since many dimensionality reduction methods rely on preserving some form of similarity or distance measure, their application to such data sets…
Algorithms for Image Reconstruction
2010
Three-dimensional (3D) imaging is becoming one of the most important applications of radioactive materials in medicine. It offers good spatial resolution, a 3D insight into the human body, and a high sensitivity in the picomolar range because markers for biological processes can be detected well when labeled with radioactive materials. In addition, the technical equipment has undergone many technological achievements. This is true for single-photon emission computed tomography (SPECT), positron emission tomography (PET), and X-ray computed tomography (CT), which is often used in connection with the nuclear medical imaging systems, as also described in chapter 5 about sources in nuclear medi…
Forest of Normalized Trees: Fast and Accurate Density Estimation of Streaming Data
2018
Density estimation of streaming data is a relevant task in numerous domains. In this paper, a novel non-parametric density estimator called FRONT (forest of normalized trees) is introduced. It uses a structure of multiple normalized trees, segments the feature space of the data stream through a periodically updated linear transformation and is able to adapt to ever evolving data streams. FRONT provides accurate density estimation and performs favorably compared to existing online density estimators in terms of the average log score on multiple standard data sets. Its low complexity, linear runtime as well as constant memory usage, makes FRONT by design suitable for large data streams. Final…
New results for finding common neighborhoods in massive graphs in the data stream model
2008
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]
Sequential Learning with LS-SVM for Large-Scale Data Sets
2006
We present a subspace-based variant of LS-SVMs (i.e. regularization networks) that sequentially processes the data and is hence especially suited for online learning tasks. The algorithm works by selecting from the data set a small subset of basis functions that is subsequently used to approximate the full kernel on arbitrary points. This subset is identified online from the data stream. We improve upon existing approaches (esp. the kernel recursive least squares algorithm) by proposing a new, supervised criterion for the selection of the relevant basis functions that takes into account the approximation error incurred from approximating the kernel as well as the reduction of the cost in th…
Reverse-Safe Text Indexing
2021
We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z - reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D . The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z , we propose an algorithm that constructs a z -reverse-safe data structure ( z -RSDS) that has size O(n) and answers decision and counting pattern matc…
Datorzinātne un informācijas tehnoloģijas: Informācijas apstrādes automatizācija
2004
The first volume in the new series " Automation of Information Processing""contains recent results of young researchers, most of them doctoral students at the University of Latvia. Though the topics of the papers are quite different, they are all centered around the problem of providing theory, methodology, development tools and supporting environment for the development of information systems. All the papers in the volume are related to the most up-to-date issues in the respective area.