Explainable modelling of quality anomaly traceability in industrial processes

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.

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.

Nowadays, research and development for optimal setting control (OSC) of complex industrial processes is becoming a hot topic. However, there is no configurable software for OSC design. In this paper, a novel software platform is proposed. The major superiority is that it not only integrates intelligent and data-driven mainstream algorithms within a unified framework, but also provides a powerful controller design tool and employs a Petri net engine to schedule control units in a parallel computation environment. The overall framework and key technologies are introduced in detail. The platform is verified and validated through a case of application to the design and development of OSC system of grinding process in a hardware-in-the-loop simulation environment.

The operation control for complex industrial processes consists of two layer — loop control layer and operational control layer. The former aims at achieving the required loop control for each production unit along production line whilst the later optimizes the set-points to the control loops so that certain performance indexes (such as product quality and energy cost) is optimized when the closed loop controlled variables follow their set-points well. This paper presents a novel method that can be used to analyze the performance deterioration of the optimized operational control, where the impact of tracking errors of loop control to the optimized performance is quantitatively formulated when the tracking errors are small. It has been shown that loop tracking errors would generally deteriorate the optimized performance in a quadratic way — leading to the establishment of the square impact principle (SIP). Moreover, it has been shown that the production infrastructure will also affect the deterioration of the optimized performance. Formulation on the analysis on the flat robustness (FR) and randomness of the optimized performance indexes will also be made and several issues on the future studies are listed.

Introduction: Propensity score matching (PSM) is a method to reduce the impact of essential and confounders. When the number of confounders is high, there may be a problem of matching, in which, finding matched pairs for the case group is difficult, or impossible. The propensity score (PS) minimizes the effect of the confounders, and it is reduced to one dimension. There are various algorithms in the field of PSM. This study aimed to compared the nearest neighbor and caliper algorithms. Methods: Data obtained in this study were from patients undergoing angiography at Ghaem Hospital in Mashhad, between 2011-12. The study was a retrospective case-control using PSM. In total, 604 patients were included in the case and control groups. A logistic regression model was used to calculate the propensity score and adjust the variables, such as age, gender, Body Mass Index (BMI), systolic blood pressure, smoking status, and triglyceride. Then, the Odds Ratios (ORs) with 95% Confidence Intervals (CIs) for the raw data and two matching algorithms were determined to examine the relationship between type 2 diabetes and coronary artery disease (CAD). Results: Propensity score in the nearest neighbor and caliper algorithms matched the total number of 604 samples, 200 and 178 pairs, respectively. All variables were significantly different between the two groups before matching (P<0.05). The gender was significantly different between the two groups after matching using the nearest neighbor algorithm (P=0.002). No variables created a significant difference between the two groups after matching with the caliper algorithm. Conclusion: Bias reduction in the caliper algorithm was greater than for the nearest neighbor algorithm for all variables except the triglyceride variable.

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.

Artificial intelligence algorithms demonstrate exceptional potential for decision optimization in adaptive control of complex industrial processes. Addressing nonlinear coupling, signal fluctuations, and operational uncertainties in sand and gravel crushing processes, this study employs reinforcement learning to construct a multimodal perception-driven adaptive control framework. The objective is to achieve dynamic adjustment of crushing parameters and energy consumption optimization through intelligent algorithms, thereby enhancing system stability and precision. Methodologically, Deep Reinforcement Learning (DRL) integrates signal and image features to construct the state space. Based on the DQN algorithm, state perception, reward functions, and policy network structures are designed. Adaptive learning rates and online update mechanisms are introduced to enable real-time iteration of control strategies. Results demonstrate that during experimental platform validation, this model significantly reduces crushing particle size error by 57.3%, lowers energy consumption by 29.3%, and shortens response time by 46.4% compared to traditional PID and fuzzy control methods, achieving rapid convergence and stable control under complex operating conditions. Conclusions indicate that the reinforcement learning-based adaptive control architecture effectively enhances the intelligence level of sand and gravel crushing systems, providing an extensible and transferable algorithmic pathway for industrial process control with broad engineering application prospects.

The aim of this article is to measure the performance metrics of an accuracy, sensitivity and specificity of the Novel Support Vector Machine (SVM) algorithm for diabetics detection and compared with a K Nearest Neighbour (KNN) algorithm. Materials and Methods: A total of 768 samples are collected from diabetics detection datasets found in kaggle. These samples are divided into a training dataset (n=500) and test dataset (n=268). Results: By comparing the Novel Support Vector Machine with KNN. The SVM has achieved better accuracy and specificity than the KNN and the KNN has better Sensitivity than the SVM algorithm. The output values of accuracy, specificity and sensitivity of the SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100%. The significance value is Pi0.05. The G power is taken as 0.8. Conclusion: The output values of accuracy, specificity and sensitivity of the Novel SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100

This research paper aims to assess and predict the Quality of Service (QoS) of wireless networks based on K- Nearest Neighbor (k-NN) Algorithm. QoS for the wireless network is mainly dependent on the parameters like packet loss, latency and jitter. In this paper, we have implemented classification of QoS and also ensured the accuracy of our results using regression analysis.KeywordsVertical Handover (VHO)Quality of Service (QoS)Vertical Handover Decision Algorithm (VHDA)K-Nearest Neighbor (k-NN) AlgorithmPacket-lossLatencyJitter

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.

Classwms: A MATLAB GUI for water masses classification using clustering analysis and K Nearest Neighbors

Autonomous navigation is an important feature that allows the robot to move independently from a point to another without a tele-operator. This feature makes mobile robots useful in many tasks that require transportation, exploration, surveillance, guidance, inspection …etc. Furthermore, autonomous robots deal with real time environments that tend to be complex, nonlinear and partially observed. They also operate with limited memory resources and tight time constraints. In this paper, we present an investigation related to mobile robot navigation. We first compare a group of classification algorithms using real traces of wall following robot navigation. Then we focus on the k Nearest Neighbors (KNN) algorithm to improve it and help it be more applicable in autonomous robot navigation. We applied a Nearest Neighbor set reduction technique to help reduce the high running time of KNN. The results indicate that KNN is a competing algorithm especially after decreasing the running time significantly by a factor of 19 and combining that with the KNN’s existing features. Results are further improved by applying an attribute selection method.

k-nearest neighbor and centroid-based classification algorithms are frequently used in text classification due to their simplicity and performance. While k-nearest neighbor algorithm usually performs well in terms of accuracy, it is slow in recognition phase. Because the distances/similarities between the new data point to be recognized and all the training data need to be computed. On the other hand, centroid-based classification algorithms are very fast, because only as many distance/similarity computations as the number of centroids (i.e. classes) needs to be done. In this paper, we evaluate the performance of centroid-based classification algorithm and compare it to nearest mean and nearest neighbor algorithms on 9 data sets. We propose and evaluate an improvement on centroid based classification algorithm. Proposed algorithm starts from the centroids of each class and increases the weight of misclassified training data points on the centroid computation until the validation error starts increasing. The weight increase is done based on the training confusion matrix entries for misclassified points. Vie proposed algorithm results in smaller test error than centroid-based classification algorithm in 7 out of 9 data sets. It is also better than 10-nearest neighbor algorithm in 8 out of 9 data sets. We also evaluate different similarity metrics together with centroid and nearest neighbor algorithms. We find out that, when Euclidean distance is turned into a similarity measure using division as opposed to exponentiation. Euclidean-based similarity can perform almost as good as cosine similarity.

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.

URLLC is the key feature of 5G enabling extensive V2X applications and control of complex industrial processes via wireless communication systems. In order to ensure the highest reliability requirements with low latency communication, the fluctuating characteristics of a wireless link must not become a limiting factor for the use case. Cooperative communication approaches eliminate this problem by exploiting additional links via relay nodes to transmit data redundantly on different paths in the network to the destination node. We present a suitable multi-path scheme for integration in 5G and B5G systems. The theoretical analysis shows nearly one order of magnitude improvement of reliability for each additional path with the proposed architecture. Furthermore, we demonstrate a significant gain in terms of reliability for the overall link even for highly disrupted relay paths. Using experimental vehicle platooning measurements in real-world traffic based on LTE and IEEE802.11p, we confirm the conceptual advantage of our multi-path approach.