Search results for "K-Nearest Neighbor"

showing 10 items of 59 documents

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…

PhysicsThermal equilibriumSpin glassCondensed matter physicsMonte Carlo methodExponentCondensed Matter PhysicsCondensed Matter::Disordered Systems and Neural NetworksPower lawScalingElectronic Optical and Magnetic Materialsk-nearest neighbors algorithmPotts modelThe European Physical Journal B
researchProduct

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.

Physicssymbols.namesakeFourier analysisStatisticssymbolsAstrophysics::Cosmology and Extragalactic AstrophysicsCluster analysisSpatial analysisPoint processCosmologyGalaxyGalaxy clusterk-nearest neighbors algorithm
researchProduct

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…

Series (mathematics)Computer scienceBivariate analysisCondensed Matter PhysicSynchronizationk-nearest neighbors algorithmNoisePhysics and Astronomy (all)StatisticsSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaPredictabilityTime seriesAlgorithmMathematical PhysicsInterpretabilityStatistical and Nonlinear Physic
researchProduct

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…

Series (mathematics)Degree (graph theory)Computer Science Applications1707 Computer Vision and Pattern Recognitionk-nearest neighbors algorithmTerm (time)Nonlinear systemPosition (vector)Control theorySettore ING-INF/06 - Bioingegneria Elettronica E InformaticaComputer Science Applications1707 Computer Vision and Pattern Recognition; Cardiology and Cardiovascular MedicineTime seriesPredictabilityCardiology and Cardiovascular MedicineAlgorithmMathematics
researchProduct

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…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGround truthSettore INF/01 - InformaticaExploitK-nearest neighborbusiness.industrySpeech recognitioncomputer.software_genreMotion (physics)CorrelationDynamic Time Warping Emotion Recognition K-nearest neighborEmotion RecognitionKey (cryptography)Artificial intelligenceState (computer science)businessAssociation (psychology)PsychologycomputerNatural language processingGestureDynamic Time Warping
researchProduct

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…

Similarity (geometry)business.industryComputationDimensionality reductionSemi-supervised learningMachine learningcomputer.software_genrek-nearest neighbors algorithmPositive definitenessMetric (mathematics)Artificial intelligenceRepresentation (mathematics)businesscomputerMathematics
researchProduct

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…

Single-linkage clusteringcomputer.software_genreComplete-linkage clusteringHierarchical clusteringk-nearest neighbors algorithmArtificial IntelligenceNearest-neighbor chain algorithmClassification ruleSignal ProcessingCluster (physics)Computer Vision and Pattern RecognitionData miningMerge (version control)computerSoftwareMathematicsPattern Recognition
researchProduct

Delineation of Malignant Skin Tumors by Hyperspectral Imaging

2018

This chapter outlines a new non-invasive method for delineation of skin lesions such as lentigo maligna and lentigo maligna melanoma. The method is based on the analysis of hyperspectral (HS) images taken in vivo before surgical excision of the lesions. For this, characteristic features of the spectral signatures of diseased pixels and healthy pixels are extracted, which combine the intensities in a few selected wavebands with the coefficients of the wavelet frame transforms of the spectral curves. To reduce dimensionality and to reveal the internal structure of the datasets, the diffusion maps (DM) technique is applied. The averaged Nearest Neighbor and the Classification and Regression Tr…

Spectral signaturePixelbusiness.industryComputer scienceDiffusion mapHyperspectral imagingPattern recognitionLentigo malignamedicine.diseasek-nearest neighbors algorithmWaveletmedicineArtificial intelligenceLentigo maligna melanomabusiness
researchProduct

Phase transition shifts in films

1991

Abstract We present a Monte Carlo computer simulation study of phase transitions in a three-dimensional Ising/lattice gas model with nearest neighbor attractive coupling and confined to a slit-like capillary with absorbing walls. Data are generated for thicknesses D ⩽ 40 and are used to study the shift of the phase boundaries due to finite wall separation.

Statistics and ProbabilityPhysicsPhase transitionCondensed matter physicsCapillary actionLattice (order)Monte Carlo methodIsing modelCondensed Matter Physicsk-nearest neighbors algorithmPhysica A: Statistical Mechanics and its Applications
researchProduct

Phase Transitions in the Multicomponent Widom-Rowlinson Model and in Hard Cubes on the BCC--Lattice

1997

We use Monte Carlo techniques and analytical methods to study the phase diagram of the M--component Widom-Rowlinson model on the bcc-lattice: there are M species all with the same fugacity z and a nearest neighbor hard core exclusion between unlike particles. Simulations show that for M greater or equal 3 there is a ``crystal phase'' for z lying between z_c(M) and z_d(M) while for z > z_d(M) there are M demixed phases each consisting mostly of one species. For M=2 there is a direct second order transition from the gas phase to the demixed phase while for M greater or equal 3 the transition at z_d(M) appears to be first order putting it in the Potts model universality class. For M large, …

Statistics and ProbabilityPhysicsPhase transitionCondensed matter physicsStatistical Mechanics (cond-mat.stat-mech)FOS: Physical sciencesRenormalization groupCondensed Matter Physicsk-nearest neighbors algorithmLattice (order)Ising modelFugacityCondensed Matter - Statistical MechanicsPhase diagramPotts model
researchProduct