We explore the effect of dimensionality on the nearest neighbor problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective, we present empirical results on both real and synthetic data sets that demonstrate that this effect can occur for as few as 10-15 dimensions. These results should not be interpreted to mean that high-dimensional indexing is never meaningful; we illustrate this point by identifying some high-dimensional workloads for which this effect does not occur. However, our results do emphasize that the methodology used almost universally in the database literature to evaluate high-dimensional indexing techniques is flawed, and should be modified. In particular, most such techniques proposed in the literature are not evaluated versus simple linear scan, and are evaluated over workloads for which nearest neighbor is not meaningful. Often, even the reported experiments, when analyzed carefully, show that linear scan would outperform the techniques being proposed on the workloads studied in high (10-15) dimensionality!.

When is nearest neighbor meaningful

Simulation and the monte carlo method

Cengage Learning, 2000. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary:

Applied Nonparametric Statistics

Weak coupling for isogeometric analysis of non-matching and trimmed multi-patch geometries

Applications of Bayesian networks and Petri nets in safety, reliability, and risk assessments: A review

MCMC algorithms for Subset Simulation

Numerical methods for the discretization of random fields by means of the Karhunen–Loève expansion

Bayesian updating is a powerful method to learn and calibrate models with data and observations. Because of the difficulties involved in computing the high-dimensional integrals necessary for Bayesian updating, Markov chain Monte Carlo (MCMC) sampling methods have been developed and successfully applied for this task. The disadvantage of MCMC methods is the difficulty of ensuring the stationarity of the Markov chain. We present an alternative to MCMC that is particularly effective for updating mechanical and other computational models, termed Bayesian updating with structural reliability methods (BUS). With BUS, structural reliability methods are applied to compute the posterior distribution of uncertain model parameters and model outputs in general. An algorithm for the implementation of BUS is proposed, which can be interpreted as an enhancement of the classic rejection sampling algorithm for Bayesian updating. This algorithm is based on the subset simulation, and its efficiency is not dependent on the number of random variables in the model. The method is demonstrated by application to parameter identification in a dynamic system, Bayesian updating of the material parameters of a structural system, and Bayesian updating of a random field–based finite-element model of a geotechnical site.

Iason Papaioannou

Papers

MCMC algorithms for Subset Simulation

Numerical methods for the discretization of random fields by means of the Karhunen–Loève expansion

Bayesian Updating with Structural Reliability Methods

Sequential importance sampling for structural reliability analysis

Reliability updating in geotechnical engineering including spatial variability of soil