Alternative methods for forecasting GDP

An empirical forecast accuracy comparison of the non-parametric method, known as multivariate Nearest Neighbor method, with parametric VAR modelling is conducted on the euro area GDP. Using both methods for nowcasting and forecasting the GDP, through the estimation of economic indicators plugged in the bridge equations, we get more accurate forecasts when using nearest neighbor method. We prove also the asymptotic normality of the multivariate k-nearest neighbor regression estimator for dependent time series, providing confidence intervals for point forecast in time series.Forecast, economic indicators, GDP, Euro area, VAR, multivariate k-nearest neighbor regression, asymptotic normality.

Analysis of Visitor Satisfaction Levels Using the K-Nearest Neighbor Method

Visitors are people who come to a place, entertainment, shopping, and tourism. Visitors are one of the important factors for the progress and development of a place. With visitors, an entertainment, tourism and shopping area can progress and develop. Therefore researchers will make a study of the level of visitor satisfaction. This research aims to improve the quality of an entertainment venue, shopping and increase the quantity of visitors. This research was conducted using the K-Nearest Neighbor method. The K-Nearest Neighbor method is a classification method based on training data (dataset). The data used by researchers is 45 visitor data. The classification carried out using the K-Nearest Neighbor method aims to classify data of satisfied visitors and dissatisfied visitors at an entertainment or tourism place. In using the K-Nearest Neighbor method, the first stage is selecting sample data, the data to be selected, then preprocessing, then designing the widget with the K-Nearest Neighbor method and finally testing data mining using the K-Nearest Neighbor method. The K-Nearest Neighbor Method. This visitor data was obtained by researchers through a questionnaire and the results of the questionnaire that 41 visitors were satisfied. After classifying visitor data using the K-Nearest Neighbor method, the classification results were 41 satisfied visitors. The conclusion is that many visitors are satisfied

An Efficient Nearest Neighbor Method for Protein Contact Prediction

A variety of approaches for protein inter-residue contact pre diction have been developed in recent years. However, this problem is far from being solved yet. In this article, we present an efficient nearest neigh bor (NN) approach, called PKK-PCP, and an application for the protein inter-residue contact prediction. The great strength of using this approach is its adaptability to that problem. Furthermore, our method improves considerably the efficiency with regard to other NN approaches. Our NN-based method combines parallel execution with k-d tree as search algorithm. The input data used by our algorithm is based on structural features and physico-chemical properties of amino acids besides of evo lutionary information. Results obtained show better efficiency rates, in terms of time and memory consumption, than other similar approaches.Ministerio de Educación y Ciencia TIN2011-28956-C02-0

A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification

$k$ Nearest Neighbors ($k$NN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based $k$NN algorithm which can effectively handle both Gaussian distributed data and nonlinear manifold distributed data. To achieve this goal, we first propose a constrained Tired Random Walk (TRW) by constructing an $R$-level nearest-neighbor strengthened tree over the graph, and then compute a TRW matrix for similarity measurement purposes. After this, the nearest neighbors are identified according to the TRW matrix and the class label of a query point is determined by the sum of all the TRW weights of its nearest neighbors. To deal with online situations, we also propose a new algorithm to handle sequential samples based a local neighborhood reconstruction. Comparison experiments are conducted on both synthetic data sets and real-world data sets to demonstrate the validity of the proposed new $k$NN algorithm and its improvements to other version of $k$NN algorithms. Given the widespread appearance of manifold structures in real-world problems and the popularity of the traditional $k$NN algorithm, the proposed manifold version $k$NN shows promising potential for classifying manifold-distributed data.Comment: 32 pages, 12 figures, 7 table

LECTURERS ADMISSIONS SELECTIONS MODEL USING FUZZY K-NEAREST NEIGHBOR METHOD

Higher Education, or tertiary education, is the final stage which is optional in formal education. It is usually organized in the form of a university, academy, seminary, high school, or institute. Every tertiary institution needs qualified and professional educators because they have an important role in the process of implementing the Tri Dharma of Higher Education. Recruitment for teaching staff usually has several stages and standardization of assessment in selection proces. In order for the process of selecting educators to be carried out objectively, a support system is need to carry out the assessment process. This study applies the Fuzzy K-Nearest Neighbor (FK-NN) method for the classification process in determining prospective educators who pass or not. Data classification is a new data or object grouping into classes or labels based on certain attributes. The application of the FK-NN method has several stages, namely weighting the criteria, then calculating the closeness of the test data and training data, finding the value of k-nearest neighbors between the training data and testing data and determining the membership of each data. Tests were carried out using the Confusion matrix method on several variations of the k value where the highest percentage was obtained from the value of k = 5. The test results for all k values obtained an average accuracy rate of 89.22%, 89.22% precision and 82.45% recall with 114 training data and 50 test data. Based on the average value of the test results, it can be concluded that the FK-NN method is feasible and good to use for the selection of educators with the classification of pass or not

Comparison of k-Nearest Neighbor and Naive Bayes Methods for SNP Data Classification

In an accident, sometimes the identity of a person who has an accident is hard to know, so it is necessary to use biological data such as Single Nucleotide Polymorphism (SNP) data to identify the person's origin. This research aims to compare the accuracy and the F1 score of the k-Nearest Neighbor method and the Naive Bayes method in classifying SNP data from 120 people who divide into groups, namely European (CEU) and Yoruba (YRI). Determination of the best method based on the average value of accuracy and the average value of F1 score from 1000 iterations with various percentage distributions of training datasets and testing datasets. In this research, the selection of SNP locations for the classification process was carried out by correlation analysis. The average accuracy obtained for the k-Nearest Neighbor method with the value of k=31 is 98.38% where the average F1 score is 98.39% while the Naive Bayes method obtained the average accuracy of 96.74% and the average F1 score of 96.63%. In this case, the k-Nearest Neighbor method is better than the Naive Bayes method in classifying SNP data to determine the origin of a person's ancestor tends to be from CEU or YRI

Identifikasi Bunga Kertas (Bougenville) Berdasarkan Warna dengan Metode K-Nearest Neighbor (KNN)

In this study, the process of determining the type of data was carried out. Bougenville flowers or commonly referred to as paper flowers are ornamental plants whose existence is quite popular among the public and is widespread in various regions in Indonesia. The data collected for this research are image files in Portable Network Graphics (PNG) format which were obtained using a digital camera. The image that becomes the input is the image of Bunga Bougenville. The sample data used are 3 data on each image sample, with each having 3 attributes, namely red, green, blue. The dataset is the result of image extraction which will be a data source for fruit image classification using the K-Nearest Neighbor method. As for the results of testing the K-Nearest Neighbor method in data classification. The author's test uses variations in the K value of K-Nearest Neighbor 3,4,5,6,7,8,9. Has a very good percentage of accuracy compared to only K-NN. The test results show the K-Nearest Neighbor method in data classification has a good percentage accuracy when using random data. The percentage of variation in the value of K K-Nearest Neighbor 3,4,5,6,7,8,9 has a percentage of 100%.  Keywords : K-Nearest Neighbor, Paper Flowers (Bougenville