Results 1  10
of
4,160
doi:10.1155/2010/597373 Research Article OPKNN: Method and Applications
, 2010
"... permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This paper presents a methodology named Optimally Pruned KNearest Neighbors (OPKNNs) which has the advantage of competing with stateoftheart methods while remaining fast. It bui ..."
Abstract
 Add to MetaCart
the generalization performances. Since computational time of this method is small, this paper presents a strategy using OPKNN to perform Variable Selection which is tested successfully on eight reallife data sets from different application fields. In summary, the most significant characteristic of this method
Optimal pruned knearest neighbors: OPKNN  application to financial modeling
 In HIS 2008, 8th International Conference on Hybrid Intelligent Systems
"... The paper proposes a methodology called OPKNN, which builds a one hidden layer feedforward neural network, using nearest neighbors neurons with extremely small computational time. The main strategy is to select the most relevant variables beforehand, then to build the model using KNN kernels. Mult ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper proposes a methodology called OPKNN, which builds a one hidden layer feedforward neural network, using nearest neighbors neurons with extremely small computational time. The main strategy is to select the most relevant variables beforehand, then to build the model using KNN kernels
Optimal Pruned KNearest Neighbors: OPKNN – Application to Financial Modeling
, 2008
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Tabu Search with Delta Test for Time Series Prediction using OPKNN
"... Abstract. This paper presents a working combination of input selection strategy and a fast approximator for time series prediction. The input selection is performed using Tabu Search with the Delta Test. The approximation methodology is called OptimallyPruned kNearest Neighbors (OPKNN), which has ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. This paper presents a working combination of input selection strategy and a fast approximator for time series prediction. The input selection is performed using Tabu Search with the Delta Test. The approximation methodology is called OptimallyPruned kNearest Neighbors (OPKNN), which
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 652 (38 self)
 Add to MetaCart
are reported, considering as th performance criteria th number of page I/O's and th number of distance computations. Th results demonstratethm th Mtree indeed extendsth domain of applicability beyond th traditional vector spaces, performs reasonably well inhE[94Kv#E44V[vh data spaces, and scales well
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 560 (10 self)
 Add to MetaCart
We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that for large n, and for all Φ’s except a negligible fraction, the following property holds: For every y having a representation y = Φα0 by a coefficient vector α0 ∈ R m with fewer than ρ · n nonzeros, the solution α1 of the ℓ 1 minimization problem min �x�1 subject to Φα = y is unique and equal to α0. In contrast, heuristic attempts to sparsely solve such systems – greedy algorithms and thresholding – perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almostspherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices.
Orientifolds and Mirror symmetry
, 2003
"... We study parity symmetries and crosscap states in classes of N = 2 supersymmetric quantum field theories in 1+1 dimensions, including nonlinear sigma models, gauged WZW models, LandauGinzburg models, and linear sigma models. The parity anomaly and its cancellation play important roles in many of t ..."
Abstract

Cited by 277 (14 self)
 Add to MetaCart
We study parity symmetries and crosscap states in classes of N = 2 supersymmetric quantum field theories in 1+1 dimensions, including nonlinear sigma models, gauged WZW models, LandauGinzburg models, and linear sigma models. The parity anomaly and its cancellation play important roles in many of them. The case of the N = 2 minimal model are studied in RCFT, and LG models. We also identify mirror pairs of orientifolds, extending the correspondence between symplectic geometry and algebraic geometry by including unorientable worldsheets. Through the analysis in various models and comparison in the overlapping regimes, we obtain a global picture of orientifolds and Dbranes.
Results 1  10
of
4,160