An Evaluation of Rule-Based Classification Models Induced by a Fuzzy Method and Two Classic Learning Algorithms

Classical machine learning (ML) provides a potentially powerful approach to solving challenging quantum many-body problems in physics and chemistry. However, the advantages of ML over traditional methods have not been firmly established. In this work, we prove that classical ML algorithms can efficiently predict ground-state properties of gapped Hamiltonians after learning from other Hamiltonians in the same quantum phase of matter. By contrast, under a widely accepted conjecture, classical algorithms that do not learn from data cannot achieve the same guarantee. We also prove that classical ML algorithms can efficiently classify a wide range of quantum phases. Extensive numerical experiments corroborate our theoretical results in a variety of scenarios, including Rydberg atom systems, two-dimensional random Heisenberg models, symmetry-protected topological phases, and topologically ordered phases.

Machine learning today becomes more and more effective instrument to solve many particular problems, where there are difficulties to apply well known and described math model. In other words - it is a great tool to describe nonlinear phenomena. We tried to use this technique to improve existing process of stratigraphy and lithology interpretation and reduce costs on site by applying computer leaded predictions on the basis of existing on-field collected data. Article describes usage of machine learning algorithms for several geology data stratigraphy and lithology boundaries classification based on geophysics logging data for deposits in Kazakhstan. Correct marking of stratigraphy and lithology from geophysics logging data is complex non-linear task. To solve this task we applied several algorithms of machine learning: random forest, logistic regression, gradient boosting (scikit-learn library), k - nearest neighbour (KNN) and XGBoost.

Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been only realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of theoretically suggested classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data.

System modeling (identification) in complex systems like kinesiological and biological in general is extremely difficult due to the high dimensions of parameters and usually non-linear functional dependencies. Data Science and especially Machine Learning (Deep Learning) algorithms seem to be quite a good tool for analysis and problem-solving in sports today. Data Science (Machine or Deep Learning) algorithms rely on basic use of statistical algorithms, but extend those with models such as Decision tree, K-means clustering, Neural networks, and Reinforcement learning, creating new algorithms that handle input data by predicting outputs that describe correlation relations or predict future states at time points (regression). This study is an attempt to analyze and research applications of machine learning in Sport science - Kinanthropometry related problem of determining somatotype by using the Microsoft Azure Machine Learning platform and comparing several supervised classifier algorithms (Multiclass Neural Network, Multiclass Decision Forest, Multiclass Decision Jungle and Multiclass Logistic Regression) which were compared versus classical somatotype categorization algorithms with dataset based on the Heath-Carter method Somatotype determination to gain experience and expertise.

Purpose In order to analyze the text complexity of Chinese and foreign academic English writings, the artificial neural network (ANN) under deep learning (DL) is applied to the study of text complexity. Firstly, the research status and existing problems of text complexity are introduced based on DL. Secondly, based on Back Propagation Neural Network (BPNN) algorithm, analyzation is made on the text complexity of Chinese and foreign academic English writings. And the research establishes a BPNN syntactic complexity evaluation system. Thirdly, MATLAB2013b is used for simulation analysis of the model. The proposed model algorithm BPANN is compared with other classical algorithms, and the weight value of each index and the model training effect are further analyzed by statistical methods. Finally, L2 Syntactic Complexity Analyzer (L2SCA) is used to calculate the syntactic complexity of the two libraries, and Mann–Whitney U test is used to compare the syntactic complexity of Chinese English learners and native English speakers. The experimental results show that compared with the shallow neural network, the deep neural network algorithm has more hidden layers and richer features, and better performance of feature extraction. BPNN algorithm shows excellent performance in the training process, and the actual output value is very close to the expected value. Meantime, the error of sample test is analyzed, and it is found that the evaluation error of BPNN algorithm is less than 1.8%, of high accuracy. However, there are significant differences in grammatical complexity among students with different English writing proficiency. Some measurement methods cannot effectively reflect the types and characteristics of written language, or may have a negative relationship with writing quality. In addition, the research also finds that the measurement of syntactic complexity is more sensitive to the language ability of writing. Therefore, BPNN algorithm can effectively analyze the text complexity of academic English writing. The results of the research provide reference for improving the evaluation system of text complexity of academic paper writing. Design/methodology/approach In order to analyze the text complexity of Chinese and foreign academic English writings, the artificial neural network (ANN) under deep learning (DL) is applied to the study of text complexity. Firstly, the research status and existing problems of text complexity are introduced based on DL. Secondly, based on Back Propagation Neural Network (BPNN) algorithm, analyzation is made on the text complexity of Chinese and foreign academic English writings. And the research establishes a BPNN syntactic complexity evaluation system. Thirdly, MATLAB2013b is used for simulation analysis of the model. The proposed model algorithm BPANN is compared with other classical algorithms, and the weight value of each index and the model training effect are further analyzed by statistical methods. Finally, L2 Syntactic Complexity Analyzer (L2SCA) is used to calculate the syntactic complexity of the two libraries, and Mann–Whitney U test is used to compare the syntactic complexity of Chinese English learners and native English speakers. The experimental results show that compared with the shallow neural network, the deep neural network algorithm has more hidden layers and richer features, and better performance of feature extraction. BPNN algorithm shows excellent performance in the training process, and the actual output value is very close to the expected value. Meantime, the error of sample test is analyzed, and it is found that the evaluation error of BPNN algorithm is less than 1.8%, of high accuracy. However, there are significant differences in grammatical complexity among students with different English writing proficiency. Some measurement methods cannot effectively reflect the types and characteristics of written language, or may have a negative relationship with writing quality. In addition, the research also finds that the measurement of syntactic complexity is more sensitive to the language ability of writing. Therefore, BPNN algorithm can effectively analyze the text complexity of academic English writing. The results of the research provide reference for improving the evaluation system of text complexity of academic paper writing. Findings In order to analyze the text complexity of Chinese and foreign academic English writings, the artificial neural network (ANN) under deep learning (DL) is applied to the study of text complexity. Firstly, the research status and existing problems of text complexity are introduced based on DL. Secondly, based on Back Propagation Neural Network (BPNN) algorithm, analyzation is made on the text complexity of Chinese and foreign academic English writings. And the research establishes a BPNN syntactic complexity evaluation system. Thirdly, MATLAB2013b is used for simulation analysis of the model. The proposed model algorithm BPANN is compared with other classical algorithms, and the weight value of each index and the model training effect are further analyzed by statistical methods. Finally, L2 Syntactic Complexity Analyzer (L2SCA) is used to calculate the syntactic complexity of the two libraries, and Mann–Whitney U test is used to compare the syntactic complexity of Chinese English learners and native English speakers. The experimental results show that compared with the shallow neural network, the deep neural network algorithm has more hidden layers and richer features, and better performance of feature extraction. BPNN algorithm shows excellent performance in the training process, and the actual output value is very close to the expected value. Meantime, the error of sample test is analyzed, and it is found that the evaluation error of BPNN algorithm is less than 1.8%, of high accuracy. However, there are significant differences in grammatical complexity among students with different English writing proficiency. Some measurement methods cannot effectively reflect the types and characteristics of written language, or may have a negative relationship with writing quality. In addition, the research also finds that the measurement of syntactic complexity is more sensitive to the language ability of writing. Therefore, BPNN algorithm can effectively analyze the text complexity of academic English writing. The results of the research provide reference for improving the evaluation system of text complexity of academic paper writing. Originality/value In order to analyze the text complexity of Chinese and foreign academic English writings, the artificial neural network (ANN) under deep learning (DL) is applied to the study of text complexity. Firstly, the research status and existing problems of text complexity are introduced based on DL. Secondly, based on Back Propagation Neural Network (BPNN) algorithm, analyzation is made on the text complexity of Chinese and foreign academic English writings. And the research establishes a BPNN syntactic complexity evaluation system. Thirdly, MATLAB2013b is used for simulation analysis of the model. The proposed model algorithm BPANN is compared with other classical algorithms, and the weight value of each index and the model training effect are further analyzed by statistical methods. Finally, L2 Syntactic Complexity Analyzer (L2SCA) is used to calculate the syntactic complexity of the two libraries, and Mann–Whitney U test is used to compare the syntactic complexity of Chinese English learners and native English speakers. The experimental results show that compared with the shallow neural network, the deep neural network algorithm has more hidden layers and richer features, and better performance of feature extraction. BPNN algorithm shows excellent performance in the training process, and the actual output value is very close to the expected value. Meantime, the error of sample test is analyzed, and it is found that the evaluation error of BPNN algorithm is less than 1.8%, of high accuracy. However, there are significant differences in grammatical complexity among students with different English writing proficiency. Some measurement methods cannot effectively reflect the types and characteristics of written language, or may have a negative relationship with writing quality. In addition, the research also finds that the measurement of syntactic complexity is more sensitive to the language ability of writing. Therefore, BPNN algorithm can effectively analyze the text complexity of academic English writing. The results of the research provide reference for improving the evaluation system of text complexity of academic paper writing.

A novel online tool condition monitoring method for milling titanium alloy with consideration of tool wear law

Image classification is critical in computer vision, with numerous applications ranging from e-commerce to medical imaging. This study provides a comprehensive evaluation of traditional machine learning algorithms for image classification, implementing and analysing novel fault tolerance mechanisms amongst these algorithms. The authors compared the performance of K-Nearest Neighbors (KNN), Decision Trees, Random Forest, and XGBoost on both Fashion MNIST and CIFAR-10 datasets. The comparison was extended to include Support Vector Machine (SVM), Logistic Regression, and Naive Bayes classifiers in order to expand the evaluation of these models on the indicated datasets. Key findings demonstrated the superiority of ensemble methods, particularly XGBoost, which achieved 89.31% of accuracy on Fashion MNIST and 54.93% on CIFAR-10, consistently outperforming other models across various configurations. Random Forest exhibited robust performance as the secondbest model, reaching 87.42% and 51.64% of accuracy on the respective datasets. The significant performance gap between datasets demonstrated the challenges that traditional machine learning models face with complex image data. Implementing the fault tolerance framework in this study has also shown a remarkable effectiveness, achieved a 94.6% recovery rate while maintaining model accuracy within 0.1% of standard implementations. This was achieved with minimal computational overhead (2.3% of training time and 1.8% of memory usage), making it highly practical for production deployments. The system significantly reduced operational failures, decreasing crashes from 5.2 to 0.3 per day and increasing average uptime from 4.3 to 12.0 hours. The study also reveals important insights regarding model scalability and resource requirements, with memory usage varying significantly across models (325MB to 8,923MB). These findings provide valuable guidance for practitioners in selecting and implementing machine learning models for image classification tasks, particularly in scenarios where both performance and system reliability are critical. This research contributes to the field by demonstrating the feasibility of implementing robust fault tolerance in machine learning systems without compromising accuracy while also providing comprehensive performance comparisons across different model architectures and dataset complexities. The developed framework serves as a foundation for building more reliable machine-learning systems for real-world applications.

Thyroid disorders, affecting millions of individuals across the globe, require prompt and reliable diagnosis for optimal treatment and better patient results. On the other hand, conventional diagnostic tools are usually time-consuming and human-biased. This paper reviews an exploratory comparison of several machine learning (ML) algorithms for early diagnosis and classification of thyroid diseases based on their ability to automatize and hence the medical diagnosis. Through the comparison of the strengths and weaknesses of various ML methods, we assess them in terms of accuracy, precision, F1 score, and their applicability to clinical use. Our study utilizes datasets containing thyroid-related factors such as age, gender, TSH, T3 followed by feature selection and compares the performance of various ML techniques for thyroid disease. The purpose of this study is to contribute to the expanding literature on how machine learning can be effectively used for diagnosis enhancement of thyroid diseases and classify it into: hypothyroid, hyperthyroid, euthyroid.

Machine Learning Algorithms for Stratigraphy Classification on Uranium Deposits

In this work, we studied the use of Quantum Machine Learning (QML) algorithms for binary classification and compared their performance with classical Machine Learning (ML) methods. QML merges principles of Quantum Computing (QC) and ML, offering improved efficiency and potential quantum advantage in data-driven tasks and when solving complex problems. In binary classification, where the goal is to assign data to one of two categories, QML uses quantum algorithms to process large datasets efficiently. Quantum algorithms like Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) exploit quantum parallelism and entanglement to enhance performance over classical methods. This study focuses on two common QML algorithms, Quantum Support Vector Classifier (QSVC) and QNN. We used the Qiskit software and conducted the experiments with three different datasets. Data preprocessing included dimensionality reduction using Principal Component Analysis (PCA) and standardization using scalers. The results showed that quantum algorithms demonstrated competitive performance against their classical counterparts in terms of accuracy, while QSVC performed better than QNN. These findings suggest that QML holds potential for improving computational efficiency in binary classification tasks. This opens the way for more efficient and scalable solutions in complex classification challenges and shows the complementary role of quantum computing.

Beyond class imbalance and the sample size per class, this research paper studies the effect of knowledge-driven class generalization (KCG) on the accuracy of classical machine learning algorithms for mono-label classification. We apply our analysis on five classical machine learning models (Perception, Support Vectors, Random Forest, K-nearest neighbors, and Decision Tree) to classify a set of animal image files generated from Wikimedia Commons, a large-scale repository of free images. Thanks to our analysis, we found that the accuracy rates of mono-label classification models, mainly Support Vectors and K-nearest neighbors, are affected by KCG. The increasing or decreasing behavior of accuracy rates is driven by the settings of the classification categories and the generalization. The analysis of KCG should be useful to understand the limitations of classical machine-learning algorithms and to fuel debates about the improvement of classical models and supervised classification evaluation methods within the framework of Explainable Artificial Intelligence.KeywordsMono-label classificationClass generalizationEvaluationClassical machine learningKnowledge-driven generalizationExplainable Artificial Intelligence

Despite the promise for performance and accuracy improvements of quantum inspired (QI) algorithms over classical machine learning (ML) algorithms, such gains have not been realized in practice. The quantum inspired algorithms can theoretically achieve significant speed up based on sampling assumptions and have thus far failed to outperform the existing classical ML models in practical applications. The speedup of quantum machine learning (QML) algorithms assume the access to data in quantum random access memory (QRAM) which is a strong assumption with current quantum architectures. QI algorithms assume sample and query (SQ) access to input vector and norms of matrices using a dynamic data structure. We explore the components of these models and the assumptions in this paper by surveying the recent works in QML and QI Machine learning (QIML) algorithms. We limit our study to QML and QIML models on achieving a speed up over classical ML techniques rather than individual proofs of these algorithms. This study highlights the assumptions being made that are currently not practical for QML and QIML algorithms in achieving performance advantage over classical ML algorithms.

Building machine learning (ML) tools, or systems, for use in manufacturing environments is a challenge that extends far beyond the understanding of the ML algorithm. Yet, these challenges, outside of the algorithm, are less discussed in literature. Therefore, the purpose of this work is to practically illustrate several best practices, and challenges, discovered while building an ML system to detect tool wear in metal CNC machining. Namely, one should focus on the data infrastructure first; begin modeling with simple models; be cognizant of data leakage; use open-source software; and leverage advances in computational power. The ML system developed in this work is built upon classical ML algorithms and is applied to a real-world manufacturing CNC dataset. The best-performing random forest model on the CNC dataset achieves a true positive rate (sensitivity) of 90.3% and a true negative rate (specificity) of 98.3%. The results are suitable for deployment in a production environment and demonstrate the practicality of the classical ML algorithms and techniques used. The system is also tested on the publicly available UC Berkeley milling dataset. All the code is available online so others can reproduce and learn from the results.

Recently, Deep Learning has been showing promising results in various Artificial Intelligence applications like image recognition, natural language processing, language modeling, neural machine translation, etc. Although, in general, it is computationally more expensive as compared to classical machine learning techniques, their results are found to be more effective in some cases. Therefore, in this paper, we investigated and compared one of the Deep Learning Architecture called Deep Neural Network (DNN) with the classical Random Forest (RF) machine learning algorithm for the malware classification. We studied the performance of the classical RF and DNN with 2, 4 & 7 layers architectures with the four different feature sets, and found that irrespective of the features inputs, the classical RF accuracy outperforms the DNN.

In this chapter, the authors discuss the use of quantum computing concepts to optimize the decision-making capability of classical machine learning algorithms. Machine learning, a subfield of artificial intelligence, implements various techniques to train a computer to learn and adapt to various real-time tasks. With the volume of data exponentially increasing, solving the same problems using classical algorithms becomes more tedious and time consuming. Quantum computing has varied applications in many areas of computer science. One such area which has been transformed a lot through the introduction of quantum computing is machine learning. Quantum computing, with its ability to perform tasks in logarithmic time, aids in overcoming the limitations of classical machine learning algorithms.