<title>Target classification using morphological features</title>

Aim: Coronary illness is one of the main sources of mortality in this current world. A basic test in the field of clinical information assessment is the expectation of cardiovascular infection. The fundamental target of this paper is to work on the exactness of the Data mining algorithms being used to improve heart disease prediction. We will be comparing the novel Random forest with K Nearest Neighbor to find out which of these can give us the best accuracy. Material and Methods: The study used 98 samples with Novel Random Forest and K Nearest Neighbor is executed with varying training and testing splits for predicting the accuracy for heart disease prediction with the 80% of G-power value and data about cardiovascular disease was gathered from numerous web sources, including latest research findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the accuracy rate of the classifiers is examined using the heart disease dataset.. There was a statistical insignificant difference among Innovative Random Forest and K Nearest Neighbor p = 0.484 (p>0.05). Results and Discussion: The accuracy of predicting heart disease in Novel Random Forest 90.16% and K Nearest Neighbor 67.21% is obtained. Conclusion: Prediction of Heart disease using the innovative Random Forest (RF) technique appears to be a significant improvement over the K Nearest Neighbor (KNN) algorithm in terms of accuracy.

This paper proposes a method for recognition and classification of 3D objects using 2D moments and HMLP network. The 2D moments are calculated based on 2D intensity images taken from multiple cameras that have been arranged using multiple views technique. 2D moments are commonly used for 2D pattern recognition. However, the current study proves that with some adaptation to multiple views technique, 2D moments are sufficient to model 3D objects. In addition, the simplicity of 2D moment's calculation reduces the processing time for feature extraction, thus decreases the recognition time. The 2D moments were then fed into a neural network for classification of the 3D objects. In the current study, hybrid multi-layered perceptron (HMLP) network is proposed to perform the classification. Two distinct groups of objects that are polyhedral and free-form objects were used to access the performance of the proposed method. The recognition results show that the proposed method has successfully classified the 3D object with the accuracy of up to 100%.

Aim: Prediction of coronary illness utilizing novel Novel k nearest neighbor (KNN) and contrasting its accuracy with decision tree algorithm. Materials and Methods: Two gatherings are proposed for foreseeing the accuracy (%) of coronary illness. To be specific, novel Novel k nearest neighbor and decision tree algorithm. Here we take 20 examples each for assessment and look at. The sample size was calculated using G power with pretest power at 80% and the alpha of 0.05 value. Result: The decision tree gives better accuracy (84.95%) contrasted with the Novel k nearest neighbor accuracy (76.29 %). Along these lines the factual meaning of the decision tree is superior to the novel k nearest neighbor algorithm with significance value of 0.115. Conclusion: From the outcome, it may very well be inferred that the decision tree helps in anticipating the coronary illness with more precision contrasted with the novel k nearest neighbor algorithm.

FSKNN: Multi-label text categorization based on fuzzy similarity and k nearest neighbors

<p>Satellite based rainfall estimates (SBRE) are used as an alternative to gauge rainfall in hydrological studies particularly for basins with data issues. However, these data products exhibit errors which cannot be always corrected by bias correction methods such as Ratio Bias Correction (RBC). Data fusion or data merging can be a potentially good approach in merging various SBREs to obtain a fused dataset, which can benefit from all the data sources and may minimise the error in rainfall estimates. Data merging methods which are commonly applied in meteorology and hydrology are: Arithmetic merging method (AMM), Inverse error squared weighting (IESW) and Error variance (EV). Among these methods EV is popular, which merges bias corrected SBREs using the minimisation of variance principle.</p><p>In this research we propose using K Nearest Neighbour (KNN) as a data merging method. KNN has a particular advantage as it does not depend upon any specific statistical model to merge data and presents a great flexibility as the value of K (the number of neighbours to be chosen) can be varied to suit the purpose (for example, choosing different K values for different seasons). In this research it is proposed to compute the distances of bias corrected SBREs of the training data from the gauge data and to assign the SBRE with the minimum distance as the class C where C = 1, 2, 3,…, number of SBREs. In validation each data point consisting of a value of each SBRE may be compared with the data points from the training set and the class of the data point(s) closest to this data point is assigned as the class of the validation data point.</p><p>The KNN approach as a data merging method was applied to the Indus basin in Pakistan. Three satellite rainfall products CMORPH, PERSIANN CDR and TRMM 3B42 with 0.25° x 0.25° spatial and daily temporal resolution were used. Based on the climatic and physiographic features the Indus basin was divided into four zones. Rainfall products were compared at daily, weekly, fortnightly, monthly and seasonally whereas spatial scales were gauge location, zonal scales and basin scale. The RBC method was used to correct the bias. The KNN method with K=1, 3 and 5 was used and compared with other merging methods namely AMM, IESW and EV. The results were compared in two seasons i.e. non-wet and wet season. AMM and EV methods performed similarly whereas IESW performed poorly at zonal scales. KNN merging method outperformed all other merging methods and gave lowest error across the basin. The daily normalised root mean square error at the Indus basin scale was reduced to 0.3, 0.45 and 0.45 respectively with KNN, AMM and EV whereas this error was 0.8, 0.65 and 0.53 respectively in CMORPH, PERSIANN CDR and TRMM datasets. The KNN merged product gave lowest error at daily scale in calibration and validation period which justifies that merging with KNN improves rainfall estimates in sparsely gauged basins.</p><p> </p><p><strong>Key words:</strong> Merging, data fusion, K nearest neighbour, KNN, error variance, Indus.</p>

We propose a framework for three-dimensional (3D) object recognition and classification in very low illumination environments using convolutional neural networks (CNNs). 3D images are reconstructed using 3D integral imaging (InIm) with conventional visible spectrum image sensors. After imaging the low light scene using 3D InIm, the 3D reconstructed image has a higher signal-to-noise ratio than a single 2D image, which is a result of 3D InIm being optimal in the maximum likelihood sense for read-noise dominant images. Once 3D reconstruction has been performed, the 3D image is denoised and regions of interest are extracted to detect 3D objects in a scene. The extracted regions are then inputted into a CNN, which was trained under low illumination conditions using 3D InIm reconstructed images, to perform object recognition. To the best of our knowledge, this is the first report of utilizing 3D InIm and convolutional neural networks for 3D training and 3D object classification under very low illumination conditions.

Traditional k-nearest neighbor methods couldn’t be able to correctly classify objects when their k nearest neighbors are dominated by other classes. This paper formulates a two-class classification problem, and applies a modified k-nearest neighbors (KNN) classifier algorithm based on maximal coherence, validity ratings, and k-fold cross validation to classify the test samples. We build a validity score for the pairs of sample and their surroundings according to their labels. The k nearest neighbors (including the unknown test object) of each sample in the training set as well as the unknown test object itself will be determined. The unknown test object will be tentatively assigned to a class membership. Then we use the validity scores to quantify the degree to which a pre-determined group of samples resemble their k nearest neighbors. A classifier is designed which take into account the coherence and validity ratings. A numerical example demonstrates the effectiveness of the algorithm in detail. The enhanced KNN method is compared with the conventional KNN and the modified KNN method on both real world wine data and photo-thermal infrared imaging spectroscopy (PT-IRIS) data for up to 20 different k values. Classification accuracy of KNN method and our method in terms of various combinations of k-value and k-fold cross validation are compared. The experimental results show that the proposed enhanced KNN method outperforms the conventional KNN and the modified KNN method on both real world wine data and PT-IRIS data. In addition, the classification accuracy of both the conventional KNN and our method increase drastically when k = 5. The average classification accuracy of our method on the PT-IRIS data featuring small sample size and high overlap is 97.87%.

A very important part of machine learning is classification. One of the most important classification algorithms is the k-nearest neighbour algorithm. This algorithm works on the principle that a point belongs to the same class as the majority of its closest neighbours. In this approach, a point qualifies as one of the closest neighbours of another point based on the parameter ‘k’. We determine whether a point has a bearing on another neighbour’s class if it is one of the first ‘k’-nearest neighbours of the point in question. A major disadvantage of this algorithm is the fact that we are bound to take exactly ‘k’-nearest neighbours irrespective of the distance between a point and the neighbour. This is a major anomaly. We decide that we shall determine the importance of a point in an algorithm based on proximity to another point but do not pay any heed to the distance between those two points. Many solutions have been proposed to reduce the effect of this problem in the algorithm. This paper gets rid of this problem altogether and adds another dimension to the nearest neighbour classification model.

The k Nearest Neighbors (KNN) algorithm has been widely applied in various supervised learning tasks due to its simplicity and effectiveness. However, the quality of KNN decision making is directly affected by the quality of the neighborhoods in the modeling space. Efforts have been made to map data to a better feature space either implicitly with kernel functions, or explicitly through learning linear or nonlinear transformations. However, all these methods use pre-determined distance or similarity functions, which may limit their learning capacity. In this paper, we propose a novel deep learning architecture, which is called the Deep Similarity-Enhanced K Nearest Neighbors (DSE-KNN), to learn an optimized similarity function of the data directly towards the goal of optimizing the KNN decision making. In other words, the type of similarity function that is used in our method is not pre-determined but rather learned to map data to a high-dimensional feature space where the accuracy of the KNN decision making is maximized. Experimental results show that DSE-KNN outperforms other common machine learning methods on classifying different types of disease datasets and predicting daily price direction of different stock ETFs.

Mainly, the holy Quran is the holy book for all Muslims. Reading the holy Quran is a special reading with rules. Reading the Holy Quran is called recitation. One of the Muslim essential activities is reading or listening to the Holy Quran. In this paper, a machine learning approach for recognizing the reader of the holy Quran (reciter) is proposed. The proposed system contains basic traditional phases for a recognition system, including data acquisition, pre-processing, feature extraction, and classification. A dataset is created for ten well-known reciters. The reciters are the prayer leaders in the holy mosques in Mecca and Madinah. The audio dataset set is analyzed using the Mel Frequency Cepstral Coefficients (MFCC). Both the K nearest neighbor (KNN) classifier, and the artificial neural network (ANN) classifier are applied for classification purpose. The pitch is used as features which are utilized to train the ANN and the KNN for classification. Two chapters from the Holy Quran are selected in this paper for system validation. Excellent accuracy is achieved. Using the ANN, the proposed system gives 97.62% accuracy for chapter 18 and 96.7% accuracy for chapter 36. On the other hand, the proposed system gives 97.03% accuracy for chapter 18 and 96.08% accuracy for chapter 36 by using the KNN.

The major challenge related to data management lies in healthcare sector due to increase in patients proportional to the population growth and change in lifestyle. The data analytics and big data are becoming trends to provide solution to all analytical problems that can be obtained by using machine learning techniques. Today, cancer is evolving as one of the major attention seeking phenomenon in developed as well as in developing countries that may lead to death if not diagnosed at the early stage. The late diagnosis, and hence delayed treatment increase the risk for the survival. Thus, early detection to improve the cancer outcome is very critical. This study is intended towards early diagnosis of cancer using more efficient analytical techniques. Moreover, accuracy plays an important role in prediction to improve the quality of care, thereby increasing the survival rate. For this study, the datasets are extracted from UCI Machine Learning Repository prepared by University of Wisconsin Hospitals. For the diagnosis and classification process, K Nearest Neighbor (KNN) classifier is applied with different values of K variable, introducing the process called KNN Clustering. Later the performance of KNN is compared with K-Means clustering on the same datasets.

A new k-harmonic nearest neighbor classifier based on the multi-local means

Hotel adalah bentuk akomodasi yang dikelola secara komersial, disediakan bagi semua orang untuk mendapatkan layanan dan penginapan termasuk untuk makan dan minum. Tujuan pembuatan aplikasi ini adalah untuk memudahkan para konsumen guna mendapatkan/memesan hotel secara mudah dengan menggunakan aplikasi. Sistem pendukung keputusan dapat merekomendasikan kepada calon pelanggan untuk menentukan hotel pilihan secara cepat, tepat, dan akurat. Dalam aplikasi ini, dirancang sistem berbasis web yang menggunakan bahasa pemograman PHP berdasarkan database MariaDB. Aplikasi ini juga hanya melakukan pencarian hotel di Depok dan mencari hotel terdekat berdasarkan jarak, harga, dan rating berdasarkan tempat kita berada, yaitu di daerah Kota Depok. Sistem dikembangkan dengan menggunakan algoritma KNearest Neighbor (K-NN). Metode ini dipilih karena metode K- Nearest Neighbor adalah bentuk model pendukung keputusan yang dapat mengklasifikasikan data berdasarkan jarak terdekat. K-Nearest Neighbor adalah formula paling sederhana yang sering digunakan untuk mengimplementasikan pencarian jarak jauh. Hasil penelitian menunjukan bahwa Metode K-NN (K-Nearest Neighbor) dapat diterapkan dengan rumus Euclidean Distance untuk perancangan aplikasi sistem pencarian hotel yang menggunakan K- Nearest Neighbor dengan menerapkan kriteria seperti alamat dari pelanggan, harga, dan peringkat yang ditentukan sehingga dapat diimplementasikan sebagai media rekomendasi untuk pencarian hotel. Semakin banyak data training hotel yang di-input dan digunakan, tingkat keakuratan akan semakin baik dan tepat.
 
 Kata Kunci: perancangan aplikasi, K-Nearest Neighbor, pemesanan hotel

Missing data is a common problem in many domains that rely on data analysis. The k Nearest Neighbors imputation method has been widely used to address this issue, but it has limitations in accurately imputing missing values, especially for datasets with small pairwise correlations and small values of k. In this study, we proposed a method, Ranked k Nearest Neighbors imputation that uses a similar approach to k Nearest Neighbor, but utilizing the concept of Ranked set sampling to select the most relevant neighbors for imputation. Our results show that the proposed method outperforms the standard k nearest neighbor method in terms of imputation accuracy both in case of Missing Completely at Random and Missing at Random mechanism, as demonstrated by consistently lower MSIE and MAIE values across all datasets. This suggests that the proposed method is a promising alternative for imputing missing values in datasets with small pairwise correlations and small values of k. Thus, the proposed Ranked k Nearest Neighbor method has important implications for data imputation in various domains and can contribute to the development of more efficient and accurate imputation methods without adding any computational complexity to an algorithm.

This paper proposes an approach based on fuzzy rough set theory to improve nearest neighbor based classification. Six measures are introduced to evaluate the quality of the nearest neighbors. This quality is combined with the frequency at which classes occur among the nearest neighbors and the similarity w.r.t. the nearest neighbor, to decide which class to pick among the neighbor's classes. The importance of each aspect is weighted using optimized weights. An experimental study shows that our method, Quality, Frequency and Similarity based Fuzzy Nearest Neighbor (QFSNN), outperforms state-of-the-art nearest neighbor classifiers.