KNN-Based Modeling and Its Application in Aftershock Prediction

Sales data analysis is an important aspect of modern businesses, as it enables them to gain insights into customer preferences and behavior, optimize marketing strategies, and improve revenue. With the rise of big data and machine learning, businesses can now leverage these tools to analyze sales data and gain even deeper insights. This paperfocuses on analyzing sales data using machine learning algorithms, with a specific emphasis on the K-Nearest Neighbors (KNN) algorithm. KNN is a popular machine learning algorithm used in classification and regression problems, and it works by identifying the K closest data points to a new observation and predicting its class or value based on the majority class or average value of its nearest neighbors. The dataset used in this paperis from a retail store and includes information on product type, sales channel, customer demographics, and sales volume over a period of several years. The paper will use Python and various machine learning libraries to perform data preprocessing, exploratory data analysis, feature engineering, and modeling. Specifically, KNN will be used to develop a predictive model for sales forecasting, which can help businesses optimize their inventory and production planning. The paper will also use clustering techniques, such as K-Means, to identify customer segments based on their purchasing behavior and demographics, and association rule mining to identify product affinities and recommend complementary products. The results of this analysis can help businesses gain a deeper understanding of their sales data and make data-driven decisions to improve their bottom line. By leveraging the power of KNN and other machine learning algorithms, businesses can gain insights into customer behavior and preferences, optimize their marketing strategies, and improve their overall revenue. Keywords: KNN Algorithm, Data Analytics, Machine Learning, Support Vector Machine.

Abstract. This system was developed to determine the accuracy of sentiment analysis on Twitter regarding the COVID-19 issue using the Nazief-Adriani and Porter stemmers with TF-IDF weighting, along with a classification process using K-Nearest Neighbor (KNN) that resulted in a comparison of 48.24% for Nazief-Adriani and 48.24% for Porter. Purpose: This research aims to determine the accuracy of the Nazief-Adriani and Porter stemmer algorithms in performing text preprocessing using a dataset from Indonesian-language Twitter. This research involves word weighting using TF-IDF and classification using the K-Nearest Neighbor (KNN) algorithm. Methods/Study design/approach: The experimentation was conducted by applying the Nazief-Adriani and Porter stemmer algorithm methods, utilizing data sourced from Twitter related to COVID-19. Subsequently, the data underwent text preprocessing, stemming, TF-IDF weighting, accuracy testing of training and testing data using K-Nearest Neighbor (KNN) algorithm, and the accuracy of both stemmers was calculated employing a confusion matrix table. Result/Findings: This study obtained reasonably accurate results in testing the Nazief-Adriani stemmer with an accuracy of 50.98%, applied to sentiment analysis of COVID-19-related Twitter data using the Indonesian language. As for the accuracy of the Porter stemmer, it achieved an accuracy rate of 48.24%. Novelty/Originality/Value: Feature selection is crucial in stemmer accuracy testing. Therefore, in this study, feature selection is carried out using the Nazief-Adriani and Porter stemmers for testing purposes, and the accuracy data classification is conducted using the K-Nearest Neighbor (KNN) algorithm

Ornamental cork fish is a type of fish that is in great demand among the public as an ornamental fish. Ornamental cork fish have various types and colors; each variation has its own name and is a selling point among ornamental cork fish lovers. With a good motif, ornamental cork fish will have an expensive market value. However, for the most part, there are still many who do not know for sure what type of ornamental cork fish is included in the variation type classification because the colors are varied and seem similar. Because of this, this research created a system that can classify types of ornamental cork fish automatically based on data while still paying attention to the level of accuracy of the classification. The algorithm used for the initial classification process is KNN, which is chosen for its accuracy comparison level value. This algorithm does not consider the weight of each data point to be classified. The data processing process carried out only looks at the highest number of classes, which becomes the benchmark for labels from the classification results. In the classification process method using the KNN algorithm, there are still shortcomings in the classification process, so this research carried out a process of comparing classification accuracy using the Weight-KNN algorithm to increase the classification accuracy value. The process of the Weight-KNN algorithm stages is to carry out classification based on nearest neighbors first but still paying attention to the weight of each data. So that the classification process of determining the type of ornamental cork fish variation will be more accurate. Based on the results of experiments conducted, this research will focus on comparing the classification results between the KNN and Weight-KNN algorithms on ornamental cork fish. The results obtained state that the Weight-KNN algorithm has a higher level of accuracy with a weight of 83.6%, whereas using the KNN algorithm, it is only 80.6%.

The availability of a lot of existing Standard Operating Procedures (SOP) document information, users often need time to find SOPs that fit their preference. Therefore, this requires a recommendation system based on user content consumption by personalized usage logs to support the establishment of SOP documents managed according to user preferences. The k-nearest neighbor (KNN) algorithm is used to identify the most relevant SOP document for the user by utilizing implicit feedback based on extraction data by monitoring the document search behavior. From the research results obtained 5 classifications as parameters, with a final value of 3:2 ratio that shows the best distance value with the majority of labels according to the concept of calculation KNN algorithm that sees from the nearest neighbor in the dataset. This shows the precision of applying the KNN algorithm in determining SOP documents according to user preferences based on implicit feedback resulting in 80% presentation for SOPs corresponding to profiles and 20% for SOPs that do not fit the user profile. To establish SOP documents to show more accurate results, it should be used in a broad SOP management system and utilize implicit feedback with parameters not only in search logs and more on performance evaluation evaluations.

Algorithms based on Nested Generalized Exemplar (NGE) theory (Salzberg, 1991) classify new data points by computing their distance to the nearest “generalized exemplar” (i.e., either a point or an axis-parallel rectangle). They combine the distance-based character of nearest neighbor (NN) classifiers with the axis-parallel rectangle representation employed in many rule-learning systems. An implementation of NGE was compared to the k-nearest neighbor (kNN) algorithm in 11 domains and found to be significantly inferior to kNN in 9 of them. Several modifications of NGE were studied to understand the cause of its poor performance. These show that its performance can be substantially improved by preventing NGE from creating overlapping rectangles, while still allowing complete nesting of rectangles. Performance can be further improved by modifying the distance metric to allow weights on each of the features (Salzberg, 1991). Best results were obtained in this study when the weights were computed using mutual information between the features and the output class. The best version of NGE developed is a batch algorithm (BNGE FWMI) that has no user-tunable parameters. BNGE FWMI's performance is comparable to the first-nearest neighbor algorithm (also incorporating feature weights). However, the k-nearest neighbor algorithm is still significantly superior to BNGE FWMI in 7 of the 11 domains, and inferior to it in only 2. We conclude that, even with our improvements, the NGE approach is very sensitive to the shape of the decision boundaries in classification problems. In domains where the decision boundaries are axis-parallel, the NGE approach can produce excellent generalization with interpretable hypotheses. In all domains tested, NGE algorithms require much less memory to store generalized exemplars than is required by NN algorithms.

This paper proposes a new k Nearest Neighbor (kNN) algorithm based on sparse learning, so as to overcome the drawbacks of the previous kNN algorithm, such as the fixed k value for each test sample and the neglect of the correlation of samples. Specifically, the paper reconstructs test samples by training samples to learn the optimal k value for each test sample, and then uses kNN algorithm with the learnt k value to conduct all kinds of tasks, such as classification, regression, and missing value imputation. The rationale of the proposed method is that different test samples should be assigned different k values in kNN algorithm, and learning the optimal k value for each test sample should be taken the correlation of data into account. To this end, in the reconstruction process, the proposed method is designed to achieve the minimal reconstruction error via a least square loss function, and employ an l1-norm regularization term to create the element-wise sparsity in the reconstruction coefficient, i.e., sparsity appearing in the element of the coefficient matrix. For achieving effectiveness, the Locality Preserving Projection (LPP) is employed to keep the local structures of data. Finally, the experimental results on real datasets, and the experimental results show that the proposed kNN algorithm is better than the state-of-the-art algorithms in terms of different learning tasks, such as classification, regression, and missing value imputation.

The security and integrity of computer systems and networks highly depend on malware detection. In the realm of malware detection, the K-Nearest Neighbors (KNN) algorithm is a well-liked and successful machine learning algorithm. However, the choice of an acceptable distance metric parameter has a significant impact on the KNN algorithm's performance. This study tries to improve malware detection by adjusting the KNN algorithm's distance metric parameter. The distance metric greatly influences the similarity or dissimilarity between instances in the feature space. The KNN algorithm for malware detection can be more accurate and effective by carefully choosing or modifying the distance metric. This paper analyzes multiple distance metrics, including Minkowski distance, Manhattan distance, and Euclidean distance. These metrics account for the traits of malware samples while capturing various aspects of similarity. The effectiveness of the KNN algorithm is evaluated using the MalMem-2022 malware dataset, and the results are broken down into these three-distance metrics. The experimental findings show that, among the three distance metric parameters, the Euclidean and Minkowski distance metric parameters considerably produced the best outcomes with binary classification. While with multiclass classification, the KNN algorithm has achieved the highest outcomes using Manhattan distance.

This research aims to analyze the application of the K-Nearest Neighbor (KNN) algorithm in classifying regional structures in Medan City. Medan, one of the largest cities in Indonesia, has a variety of characteristics of regional structure that requires an appropriate analysis approach for spatial management and spatial planning. The KNN algorithm was chosen because of its ability to categorize data based on its proximity to other data points, which is very suitable for the needs of spatial planning and management. other data points, which is very suitable for the needs of regional classification analysis. In this research, the data used includes various attributes of the regional structure such as structure attributes such as population density, land use, and infrastructure in each sub-district. infrastructure in each sub-district in Medan City. In this research, the method used is statistical data processing statistical data processing to group areas with similar characteristics, using the KNN algorithm as a classification method. The classification process process involves selecting the right parameters, calculating the distance between data points, and selecting the optimal number of nearest neighbors. data points, as well as selecting the optimal number of nearest neighbors. The expected results The expected results of this analysis will provide a clear picture of the distribution pattern of the distribution pattern of the regional structure in Medan City, as well as assisting in the planning and development of a more efficient and directed city. The accuracy of the KNN model in classifying the regions will also be compared with other algorithms to assess its effectiveness and reliability in the context of this study.

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.

Location estimation as one of the most popular research areas has been recently attended because of wide range of its applications. K Nearest Neighbor (KNN) is a basic deterministic algorithm for locating which is widely used in fingerprinting approach. The performance of the KNN can be improved extensively by employing appropriate selection algorithm. In this paper, a novel algorithm called Dynamic KNN (D-KNN) which uses Angle of Arrival (AOA) and KNN as a hybrid method is proposed. This method comparing with KNN algorithm with constant K, selects the best number of nearest neighbors dynamically. It utilizes the adaptive antenna system to determine the user locative area by intersection of several obtained AOA. The best K neighbors which are located in the determined area can be selected to employ in the KNN. Analysis and simulation results are reported the best overall performance of D-KNN in different conditions.

Currently, mental health is an unresolved mental health problem both at the national and international levels. Mental health disorders are conditions where a person has difficulty in adjusting to the conditions around them. Mental Health is an important aspect of overall health. Efforts to maintain and improve it can help a person achieve better well-being in everyday life. This research aims to conduct Early Prediction Analysis related to mental health problems experienced by students by measuring the accuracy level of the analysis. This research was conducted using the CART (Classification and Regression Trees) and KNN (K-Nearest Neighbor) algorithms with a set of Mental Health Datasets consisting of 11 attributes and 101 data. The data is processed using the Weka Application and the accuracy results of each algorithm are obtained, amounting to 94.0594% for the CART Algorithm and 91.0891% for the KNN Algorithm. From this achievement, it can be concluded that the performance of the CART and KNN algorithms falls into the Excellent Classification category. Judging from the accuracy obtained, the CART algorithm has a higher accuracy value than the KNN algorithm, so the CART algorithm has a high performance for analyzing early prediction of mental health of students who do not take steps in seeking mental health support.

The support vector machine (SVM) combined with the K-nearest neighbor (KNN) algorithm is applied to the 3D image recognition algorithm to cope with the issues of 3D image recognition in the image processing process. In this paper, the KNN algorithm is used to extend the eigenvalues of the residual network from frequency to complex plane according to the eigenvalues of 3D images, and the relevant data are extracted from the images by using the corresponding separation rules of the SVM. Subsequently, a sparse observation model is established based on the SVM combined with the KNN, and the 3D image processing issue is converted to a residual network visualization issue of 3D image recognition by establishing a parameterized database. Meanwhile, detection of high-resolution distance of 3D images is conducted, and the variational inference method is used to visualize and analyze the 3D images accordingly. Finally, through the experimental study, it can be known that the method of SVM combined with the KNN algorithm can reach an accuracy of up to 94.18% in the dataset of the Princeton 3D polygonal models. After comparison with the existing SVM-KNN method and deep learning, it can be concluded that the method put forward in this paper has a higher recognition rate and stronger anti-interference capacity, and the algorithm has a superior convergence speed with less adjustment parameters.

Location estimation has become one of the most popular research areas for the wide application of Location Based Services (LBS). K nearest neighbors (KNN) algorithm is commonly used in fingerprinting approach, and it has been widely used for decades due to its simplicity and effectiveness. However, the main drawback of KNN algorithm is obvious. Theoretical behavior can hardly be obtained because KNN is sensitive to the value of K and it often fails to work well with inappropriate choice of distance metric or due to the presence of numerous irrelevant features. In order to fill this gap, an improved KNN algorithm is introduced. And this algorithm is beneficial to location estimation in a real GSM network.

As the most widely known data mining algorithm, classification algorithms have attracted wide attention. K-Nearest Neighbor (KNN) algorithm and decision tree algorithm are the two widely known algorithms in classification algorithms. Sometimes, people not sure how to choose the suitable to solve the classification problems. In this paper, we establish KNN algorithm model and decision tree ID3 algorithm model to analyze the accuracy of the two algorithms in the same data set with different number of features. Through the learning curve and cross validation, we find ID3 algorithm is better than KNN algorithm, and when the number of feature increased the accuracy of KNN is increasing while ID3 is decreased.

K-Nearest Neighbors hybrid method for maximum power point tracking under partial shading for photovoltaic power systems