Search results for "k-nearest neighbors algorithm"
showing 2 items of 52 documents
Cluster matching in time resolved imaging for VLSI analysis
2014
International audience; If scaling has the benefit of enabling manufacturers to design tomorrow's integrated circuits, from the failure analyst point of view it also has the drawback of making devices more complex. The test sequence for modern VLSI can be quite long, with thousands of vector. Dynamic photon emission databases can contain millions of photons representing thousands of state changes in the region of interest. Finding a candidate location where to perform physical analysis is quite challenging, especially if the fault occurs on a single vector. In this paper, we suggest a new methodology to find single vector fault in dynamic photon emission database. The process is applied at …
Comprehensive Strategy for Proton Chemical Shift Prediction: Linear Prediction with Nonlinear Corrections
2014
A fast 3D/4D structure-sensitive procedure was developed and assessed for the chemical shift prediction of protons bonded to sp3carbons, which poses the maybe greatest challenge in the NMR spectral parameter prediction. The LPNC (Linear Prediction with Nonlinear Corrections) approach combines three well-established multivariate methods viz. the principal component regression (PCR), the random forest (RF) algorithm, and the k nearest neighbors (kNN) method. The role of RF is to find nonlinear corrections for the PCR predicted shifts, while kNN is used to take full advantage of similar chemical environments. Two basic molecular models were also compared and discussed: in the MC model the desc…