Search results for "Nearest neighbor"
showing 10 items of 63 documents
A global descriptor of spatial pattern interaction in the galaxy distribution
1997
We present the function J as a morphological descriptor for point patterns formed by the distribution of galaxies in the Universe. This function was recently introduced in the field of spatial statistics, and is based on the nearest neighbor distribution and the void probability function. The J descriptor allows to distinguish clustered (i.e. correlated) from ``regular'' (i.e. anti-correlated) point distributions. We outline the theoretical foundations of the method, perform tests with a Matern cluster process as an idealised model of galaxy clustering, and apply the descriptor to galaxies and loose groups in the Perseus-Pisces Survey. A comparison with mock-samples extracted from a mixed d…
Clustering statistics in cosmology
2002
The main tools in cosmology for comparing theoretical models with the observations of the galaxy distribution are statistical. We will review the applications of spatial statistics to the description of the large-scale structure of the universe. Special topics discussed in this talk will be: description of the galaxy samples, selection effects and biases, correlation functions, Fourier analysis, nearest neighbor statistics, Minkowski functionals and structure statistics. Special attention will be devoted to scaling laws and the use of the lacunarity measures in the description of the cosmic texture.
Slowing down in the three-dimensional three-state Potts glass with nearest neighbor exchange : A Monte Carlo study
1998
,Static and dynamic properties of the Potts model on the simple cubic lattice with nearest neighbor ±Ĵ-interaction are obtained from Monte Carlo simulations in a temperature range where full thermal equilibrium still can be achieved (T/Ĵ ≥ 0.6). For a lattice size L = 16, in this range finite size effects are still negligible, but the data for the spin glass susceptibility agree with previous extrapolations based on finite size scaling of very small lattices. While the static properties are compatible with a zero temperature transition, they certainly do not prove it. Unlike the Ising spin glass, the decay of the time-dependent order parameter is compatible with a simple Kohlrausch function…
Statistics of Galaxy Clustering
2006
In this introductory talk we will establish connections between the statistical analysis of galaxy clustering in cosmology and recent work in mainstream spatial statistics. The lecture will review the methods of spatial statistics used by both sets of scholars, having in mind the cross-fertilizing purpose of the meeting series. Special topics will be: description of the galaxy samples, selection effects and biases, correlation functions, nearest neighbor distances, void probability functions, Fourier analysis, and structure statistics.
Mutual nonlinear prediction as a tool to evaluate coupling strength and directionality in bivariate time series: Comparison among different strategie…
2008
We compare the different existing strategies of mutual nonlinear prediction regarding their ability to assess the coupling strength and directionality of the interactions in bivariate time series. Under the common framework of $k$-nearest neighbor local linear prediction, we test three approaches based on cross prediction, mixed prediction, and predictability improvement. The measures of interdependence provided by these approaches are first evaluated on short realizations of bivariate time series generated by coupled Henon models, investigating also the effects of noise. The usefulness of the three mutual nonlinear prediction schemes is then assessed in a common physiological application d…
Quantifying the complexity of short-term heart period variability through K nearest neighbor local linear prediction
2008
The complexity of short-term heart period (HP) variability was quantified exploiting the paradigm that associates the degree of unpredictability of a time series to its dynamical complexity. Complexity was assessed through k-nearest neighbor local linear prediction. A proper selection of the parameter k allowed us to perform either linear or nonlinear prediction, and the comparison of the two approaches to infer the presence of nonlinear dynamics. The method was validated on simulations reproducing linear and nonlinear time series with varying levels of predictability. It was then applied to HP variability series measured from healthy subjects during head-up tilt test, showing that short-te…
Exploiting Correlation between Body Gestures and Spoken Sentences for Real-time Emotion Recognition
2017
Humans communicate their affective states through different media, both verbal and non-verbal, often used at the same time. The knowledge of the emotional state plays a key role to provide personalized and context-related information and services. This is the main reason why several algorithms have been proposed in the last few years for the automatic emotion recognition. In this work we exploit the correlation between one's affective state and the simultaneous body expressions in terms of speech and gestures. Here we propose a system for real-time emotion recognition from gestures. In a first step, the system builds a trusted dataset of association pairs (motion data -> emotion pattern), a…
An Online Metric Learning Approach through Margin Maximization
2011
This work introduces a method based on learning similarity measures between pairs of objects in any representation space that allows to develop convenient recognition algorithms. The problem is formulated through margin maximization over distance values so that it can discriminate between similar (intra-class) and dissimilar (inter-class) elements without enforcing positive definiteness of the metric matrix as in most competing approaches. A passive-aggressive approach has been adopted to carry out the corresponding optimization procedure. The proposed approach has been empirically compared to state of the art metric learning on several publicly available databases showing its potential bot…
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
2012
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering
2002
Abstract A generalized prototype-based classification scheme founded on hierarchical clustering is proposed. The basic idea is to obtain a condensed 1-NN classification rule by merging the two same-class nearest clusters, provided that the set of cluster representatives correctly classifies all the original points. Apart from the quality of the obtained sets and its flexibility which comes from the fact that different intercluster measures and criteria can be used, the proposed scheme includes a very efficient four-stage procedure which conveniently exploits geometric cluster properties to decide about each possible merge. Empirical results demonstrate the merits of the proposed algorithm t…