scholarly journals A Nonparametric Lack-of-Fit Test of Constant Regression in the Presence of Heteroscedastic Variances

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1264
Author(s):  
Mohammed M. Gharaibeh ◽  
Mohammad Sahtout ◽  
Haiyan Wang ◽  
Suojin Wang
Keyword(s):  
Binary Data ◽  
Nearest Neighbor ◽  
Regression Function ◽  
Fixed Number ◽  
Function Estimation ◽  
Sample Sizes ◽  
K Nearest Neighbor ◽  
Test Statistic ◽  
Lack Of Fit ◽  
Constant Regression

We consider a k-nearest neighbor-based nonparametric lack-of-fit test of constant regression in presence of heteroscedastic variances. The asymptotic distribution of the test statistic is derived under the null and local alternatives for a fixed number of nearest neighbors. Advantages of our test compared to classical methods include: (1) The response variable can be discrete or continuous regardless of whether the conditional distribution is symmetric or not and can have variations depending on the predictor. This allows our test to have broad applicability to data from many practical fields; (2) this approach does not need nonlinear regression function estimation that often affects the power for moderate sample sizes; (3) our test statistic achieves the parametric standardizing rate, which gives more power than smoothing-based nonparametric methods for moderate sample sizes. Our numerical simulation shows that the proposed test is powerful and has noticeably better performance than some well known tests when the data were generated from high frequency alternatives or binary data. The test is illustrated with an application to gene expression data and an assessment of Richards growth curve fit to COVID-19 data.

scholarly journals MAT-Net: Medial Axis Transform Network for 3D Object Recognition

2019 ◽  
Author(s):  
Jianwei Hu ◽  
Bin Wang ◽  
Lihui Qian ◽  
Yiling Pan ◽  
Xiaohu Guo ◽  
...  
Keyword(s):  
Deep Learning ◽  
Object Representation ◽  
Nearest Neighbor ◽  
Medial Axis ◽  
Fixed Number ◽  
Learning Performance ◽  
Medial Axis Transform ◽  
K Nearest Neighbor ◽  
Global Features ◽  
Local Feature Extraction

3D deep learning performance depends on object representation and local feature extraction. In this work, we present MAT-Net, a neural network which captures local and global features from the Medial Axis Transform (MAT). Different from K-Nearest-Neighbor method which extracts local features by a fixed number of neighbors, our MAT-Net exploits effective modules Group-MAT and Edge-Net to process topological structure. Experimental results illustrate that MAT-Net demonstrates competitive or better performance on 3D shape recognition than state-of-the-art methods, and prove that MAT representation has excellent capacity in 3D deep learning, even in the case of low resolution.

scholarly journals Nonlinear generalization of the monotone single index model

2020 ◽  
Author(s):  
Željko Kereta ◽  
Timo Klock ◽  
Valeriya Naumova
Keyword(s):  
Nearest Neighbor ◽  
Regression Function ◽  
K Nearest Neighbor ◽  
Real World Data ◽  
Local Index ◽  
Single Index ◽  
Index Model ◽  
Single Index Model ◽  
Geodesic Metric ◽  
Nonlinear Generalization

Abstract Single index model is a powerful yet simple model, widely used in statistics, machine learning and other scientific fields. It models the regression function as $g(\left <{a},{x}\right>)$, where $a$ is an unknown index vector and $x$ are the features. This paper deals with a nonlinear generalization of this framework to allow for a regressor that uses multiple index vectors, adapting to local changes in the responses. To do so, we exploit the conditional distribution over function-driven partitions and use linear regression to locally estimate index vectors. We then regress by applying a k-nearest neighbor-type estimator that uses a localized proxy of the geodesic metric. We present theoretical guarantees for estimation of local index vectors and out-of-sample prediction and demonstrate the performance of our method with experiments on synthetic and real-world data sets, comparing it with state-of-the-art methods.

Machine Learning Verdict of EEG Signals in Brain Computer Interface

2018 ◽  
pp. 429-441
Author(s):  
M. Jeyanthi ◽  
C. Velayutham
Keyword(s):  
Nearest Neighbor ◽  
Technology Development ◽  
Vital Role ◽  
Svm Classifier ◽  
K Nearest Neighbor ◽  
Data Mining Technique ◽  
Data Set ◽  
Eeg Data ◽  
Irrelevant Attributes

In Science and Technology Development BCI plays a vital role in the field of Research. Classification is a data mining technique used to predict group membership for data instances. Analyses of BCI data are challenging because feature extraction and classification of these data are more difficult as compared with those applied to raw data. In this paper, We extracted features using statistical Haralick features from the raw EEG data . Then the features are Normalized, Binning is used to improve the accuracy of the predictive models by reducing noise and eliminate some irrelevant attributes and then the classification is performed using different classification techniques such as Naïve Bayes, k-nearest neighbor classifier, SVM classifier using BCI dataset. Finally we propose the SVM classification algorithm for the BCI data set.

PENENTUAN DAERAH PRIORITAS PELAYANAN AKTA KELAHIRAN DENGAN METODE K-NN DAN K-MEANS

2020 ◽  
Vol 17 (1) ◽  
pp. 319-328
Author(s):  
Ade Muchlis Maulana Anwar ◽  
Prihastuti Harsani ◽  
Aries Maesya
Keyword(s):  
Nearest Neighbor ◽  
Information Gain ◽  
Birth Certificate ◽  
Population Data ◽  
Community Services ◽  
Birth Certificates ◽  
Similar Data ◽  
K Nearest Neighbor ◽  
Civil Registration ◽  
The Family

Population Data is individual data or aggregate data that is structured as a result of Population Registration and Civil Registration activities. Birth Certificate is a Civil Registration Deed as a result of recording the birth event of a baby whose birth is reported to be registered on the Family Card and given a Population Identification Number (NIK) as a basis for obtaining other community services. From the total number of integrated birth certificate reporting for the 2018 Population Administration Information System (SIAK) totaling 570,637 there were 503,946 reported late and only 66,691 were reported publicly. Clustering is a method used to classify data that is similar to others in one group or similar data to other groups. K-Nearest Neighbor is a method for classifying objects based on learning data that is the closest distance to the test data. k-means is a method used to divide a number of objects into groups based on existing categories by looking at the midpoint. In data mining preprocesses, data is cleaned by filling in the blank data with the most dominating data, and selecting attributes using the information gain method. Based on the k-nearest neighbor method to predict delays in reporting and the k-means method to classify priority areas of service with 10,000 birth certificate data on birth certificates in 2019 that have good enough performance to produce predictions with an accuracy of 74.00% and with K = 2 on k-means produces a index davies bouldin of 1,179.

Optimizing Error Rate in Intrusion Detection System Using Artificial Neural Network Algorithm

2018 ◽  
Vol 6 (9) ◽  
pp. 152
Author(s):  
S. Vijaya Rani ◽  
G. N. K. Suresh Babu
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Intrusion Detection ◽  
Error Rate ◽  
Learning Process ◽  
Nearest Neighbor ◽  
Detection System ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Artificial Neural

The illegal hackers  penetrate the servers and networks of corporate and financial institutions to gain money and extract vital information. The hacking varies from one computing system to many system. They gain access by sending malicious packets in the network through virus, worms, Trojan horses etc. The hackers scan a network through various tools and collect information of network and host. Hence it is very much essential to detect the attacks as they enter into a network. The methods  available for intrusion detection are Naive Bayes, Decision tree, Support Vector Machine, K-Nearest Neighbor, Artificial Neural Networks. A neural network consists of processing units in complex manner and able to store information and make it functional for use. It acts like human brain and takes knowledge from the environment through training and learning process. Many algorithms are available for learning process This work carry out research on analysis of malicious packets and predicting the error rate in detection of injured packets through artificial neural network algorithms.

Perancangan Aplikasi Prediksi Kelulusan Tepat Waktu Bagi Mahasiswa Baru Dengan Teknik Data Mining (Studi Kasus: Data Akademik Mahasiswa STMIK Dipanegara Makassar)

2015 ◽  
Vol 1 (4) ◽  
pp. 270
Author(s):  
Muhammad Syukri Mustafa ◽  
I. Wayan Simpen
Keyword(s):  
Data Mining ◽  
Nearest Neighbor ◽  
Test Results ◽  
K Nearest Neighbor ◽  
Accuracy Rate ◽  
Sample Data ◽  
New Students ◽  
K Nearest Neighbor Algorithm ◽  
Using Data ◽  
Existing Data

Penelitian ini dimaksudkan untuk melakukan prediksi terhadap kemungkian mahasiswa baru dapat menyelesaikan studi tepat waktu dengan menggunakan analisis data mining untuk menggali tumpukan histori data dengan menggunakan algoritma K-Nearest Neighbor (KNN). Aplikasi yang dihasilkan pada penelitian ini akan menggunakan berbagai atribut yang klasifikasikan dalam suatu data mining antara lain nilai ujian nasional (UN), asal sekolah/ daerah, jenis kelamin, pekerjaan dan penghasilan orang tua, jumlah bersaudara, dan lain-lain sehingga dengan menerapkan analysis KNN dapat dilakukan suatu prediksi berdasarkan kedekatan histori data yang ada dengan data yang baru, apakah mahasiswa tersebut berpeluang untuk menyelesaikan studi tepat waktu atau tidak. Dari hasil pengujian dengan menerapkan algoritma KNN dan menggunakan data sampel alumni tahun wisuda 2004 s.d. 2010 untuk kasus lama dan data alumni tahun wisuda 2011 untuk kasus baru diperoleh tingkat akurasi sebesar 83,36%.This research is intended to predict the possibility of new students time to complete studies using data mining analysis to explore the history stack data using K-Nearest Neighbor algorithm (KNN). Applications generated in this study will use a variety of attributes in a data mining classified among other Ujian Nasional scores (UN), the origin of the school / area, gender, occupation and income of parents, number of siblings, and others that by applying the analysis KNN can do a prediction based on historical proximity of existing data with new data, whether the student is likely to complete the study on time or not. From the test results by applying the KNN algorithm and uses sample data alumnus graduation year 2004 s.d 2010 for the case of a long and alumni data graduation year 2011 for new cases obtained accuracy rate of 83.36%.

Sign in / Sign up

Export Citation Format

Share Document