Search

Systematic reviews and meta-analyses are crucial for advancing research, yet they are time-consuming and resource-demanding. Although machine learning and natural language processing algorithms may reduce this time and these resources, their performance has not been tested in education and educational psychology, and there is a lack of clear information on when researchers should stop the reviewing process. In this study, we conducted a retrospective screening simulation using 27 systematic reviews in education and educational psychology. We evaluated the sensitivity, specificity, and estimated time savings of several learning algorithms and heuristic stopping criteria. The results showed, on average, a 58% (SD = 19%) reduction in the screening workload of irrelevant records when using learning algorithms for abstract screening and an estimated time savings of 1.66 days (SD = 1.80). The learning algorithm random forests with sentence bidirectional encoder representations from transformers outperformed other algorithms. This finding emphasizes the importance of incorporating semantic and contextual information during feature extraction and modeling in the screening process. Furthermore, we found that 95% of all relevant abstracts within a given dataset can be retrieved using heuristic stopping rules. Specifically, an approach that stops the screening process after classifying 20% of records and consecutively classifying 5% of irrelevant papers yielded the most significant gains in terms of specificity (M = 42%, SD = 28%). However, the performance of the heuristic stopping criteria depended on the learning algorithm used and the length and proportion of relevant papers in an abstract collection. Our study provides empirical evidence on the performance of machine learning screening algorithms for abstract screening in systematic reviews in education and educational psychology.

This research was triggered by the identified need in literature for large-scale studies about the kinds of designs that teachers create for mobile learning (m-learning). These studies require analyses of large datasets of learning designs. The common approach followed by researchers when analyzing designs has been to manually classify them following high-level pedagogically guided coding strategies, which demands extensive work. Therefore, the first goal of this paper is to explore the use of supervised machine learning (SML) to automatically classify the textual content of m-learning designs using pedagogically relevant classifications, such as the cognitive level demanded by students to carry out specific designed tasks, the phases of inquiry learning represented in the designs, or the role that the situated environment has in the designs. Because not all SML models are transparent, but researchers often need to understand their behaviour, the second goal of this paper is to consider the trade-off between models' performance and interpretability in the context of design analytics for m-learning. To achieve these goals, we compiled a dataset of designs deployed using two tools, Avastusrada and Smartzoos. With this dataset, we trained and compared different models and feature extraction techniques. We further optimized and compared the best performing and most interpretable algorithms (EstBERT and Logistic Regression) to consider the second goal with an illustrative case. We found that SML can reliably classify designs with accuracy > 0.86 and Cohen's kappa > 0.69.

This research is part of the Artificial Intelligence Virtual Trainer (AI-VT) project which aims to create a system that can identify the user's skills from a text by means of machine learning. AI-VT is a case-based reasoning learning support system can generate customized exercise lists that are specially adapted to user needs. To attain this outcome, the relevance of the first proposed exercise must be optimized to assist the system in creating personalized user profiles. To solve this problem, this project was designed to include a preliminary testing phase. As a generic tool, AI-VT was designed to be adapted to any field of learning. The most recent application of AI-VT was in the field of computer science specifically in the context of the fundamentals of algorithmic learning. AI-VT can and will also be useful in other disciplines. Developed in Python with the Keras API and the Tensorflow framework, this artificial intelligence-based tool encompasses a supervised learning environment, multi-label text classification techniques and deep neural networks. This paper presents and compares the performance levels of the different models tested on two different data sets in the context of computer programming and algorithms.

A crucial bottleneck in medical artificial intelligence (AI) is high-quality labeled medical datasets. In this paper, we test a large variety of wisdom of the crowd algorithms to label medical images that were initially classified by individuals recruited through an app-based platform. Individuals classified skin lesions from the International Skin Lesion Challenge 2018 into 7 different categories. There was a large dispersion in the geographical location, experience, training, and performance of the recruited individuals. We tested several wisdom of the crowd algorithms of varying complexity from a simple unweighted average to more complex Bayesian models that account for individual patterns of errors. Using a switchboard analysis, we observe that the best-performing algorithms rely on selecting top performers, weighting decisions by training accuracy, and take into account the task environment. These algorithms far exceed expert performance. We conclude by discussing the implications of these approaches for the development of medical AI.

With the advent of technological advancement in learning, such as context-awareness, ubiquity and personalisation, various innovations in teaching and learning have led to improved learning. This research paper aims to develop a system that supports personalised learning through adaptive content, adaptive learning path and context awareness to meet individual learner's requirements and promote the effectiveness and performance of the learning process. Furthermore, the study used an experimental control group to ascertain the significance of learners' learning styles and preferences in improving learning performance. The model considers different modules such as personalisation, location support, learning plan and context awareness while relying on the proper classification of learners' learning styles. The system was experimented using 127 learners of a Computer Science Course. The result obtained using 10-fold cross-validation on various algorithms shows better performance in ROC, Kappa and Accuracy, which were all used to evaluate the quality of classification outcome and compared with learners' performances in assessments. During classification, Naïve Bayes Model has the highest average ROC value of 0.979, TP Rate of 0.951 and FP Rate of 0.045. The results obtained show an improvement in learning.

Purpose: Course evaluations are formative and are used to evaluate learnings of the students for a course. Anomalies in the evaluation process can lead to a faulty educational outcome. Learning analytics and educational data mining provide a set of techniques that can be conveniently applied to extensive data collected as part of the evaluation process to ensure remedial actions. This study aims to conduct an experimental research to detect anomalies in the evaluation methods. Design/methodology/approach: Experimental research is conducted with scientific approach and design. The researchers categorized anomaly into three categories, namely, an anomaly in criteria assessment, subject anomaly and anomaly in subject marks allocation. The different anomaly detection algorithms are used to educate data through the software R, and the results are summarized in the tables. Findings: The data points occurring in all algorithms are finally detected as an anomaly. The anomaly identifies the data points that deviate from the data set's normal behavior. The subject which is consistently identified as anomalous by the different techniques is marked as an anomaly in evaluation. After identification, one can drill down to more details into the title of anomalies in the evaluation criteria. Originality/value: This paper proposes an analytical model for the course evaluation process and demonstrates the use of actionable analytics to detect anomalies in the evaluation process.

In recent years, smart learning environments have become central to modern education and support students and instructors through tools based on prediction and recommendation models. These methods often use learning material metadata, such as the knowledge contained in an exercise which is usually labeled by domain experts and is costly and difficult to scale. It recognizes that automated labeling eases the workload on experts, as seen in previous studies using automatic classification algorithms for research papers and Japanese mathematical exercises. However, these studies didn't delve into fine-grained labeling. In addition to that, as the use of materials in the system becomes more widespread, paper materials are transformed into PDF formats, which can lead to incomplete extraction. However, there is less emphasis on labeling incomplete mathematical sentences to tackle this problem in the previous research. This study aims to achieve precise automated classification even from incomplete text inputs. To tackle these challenges, we propose a mathematical exercise labeling algorithm that can handle detailed labels, even for incomplete sentences, using word n-grams, compared to the state-of-the-art word embedding method. The results of the experiment show that mono-gram features with Random Forest models achieved the best performance with a macro F-measure of 92.50%, 61.28% for 24-class labeling and 297-class labeling tasks, respectively. The contribution of this research is showing that the proposed method based on traditional simple n-grams has the ability to find context-independent similarities in incomplete sentences and outperforms state-of-the-art word embedding methods in specific tasks like classifying short and incomplete texts.

This volume is largely about nontraditional data; this paper is about a nontraditional visualization: classification trees. Using trees with data will be new to many students, so rather than beginning with a computer algorithm that produces optimal trees, we suggest that students first construct their own trees, one node at a time, to explore how they work, and how well. This build-it-yourself process is more transparent than using algorithms such as CART; we believe it will help students not only understand the fundamentals of trees, but also better understand tree-building algorithms when they do encounter them. And because classification is an important task in machine learning, a good foundation in trees can prepare students to better understand that emerging and important field. We also describe a free online tool--Arbor--that students can use to do this, and note some implications for instruction.

Churn in e-learning refers to learners who gradually perform less and become lethargic and may potentially drop out from the course. Churn prediction is a highly sensitive and critical task in an e-learning system because inaccurate predictions might cause undesired consequences. A lot of approaches proposed in the literature analyzed and modeled churn prediction using learner's personal attributes from learner profiles and their overall performance. The major concern with existing approaches is that the accuracy of prediction is not satisfactory as the model is built on the sample data with limited features. This paper addresses this issue by proposing a distributed iterative classifier that deploys an ensemble learning algorithm to generalize the model for predicting potential churn from personal attributes. Predictions from the base classifier are obtained using a distributed iterative classification algorithm that deploys a map-reduce framework. Iterative classification algorithm predicts signs of attrition in the learners through their online interactions. It can also process a very large network, which was lacking in the existing solution. The proposed system is evaluated using the features of five students and results are reported. Experimental results show that the proposed ensemble classifier not only improves the performance of churn prediction significantly but also runs faster than the other algorithms.

Purpose: The paper aims to present a new two stage local causal learning algorithm -- HEISA. In the first stage, the algorithm discoveries the subset of features that better explains a target variable. During the second stage, computes the causal effect, using partial correlation, of each feature of the selected subset. Using this new algorithm, the study aims to identify the actions that lead a student succeed or failure in a course. Design/methodology/approach: The paper presents a brief review of main concepts used in this study: Causal Learning and Causal effects. The paper also discusses the results of applying the algorithm in education data set. Data used in this study was extracted from the log of actions of a Learning Management System, Moodle. These actions represent the behavior of 229 engineering students that take Algorithm and Data Structure course offered in a blended model. Findings: The algorithm proposed in the paper identifies that features with weak relevance to a target may become relevant when computing the direct effect. Research limitations/implications: The algorithm needs to be improved to automatically discard attributes that are under a specific threshold of direct effect. Researchers are also encouraged to test the proposed propositions further. Practical implications: The algorithm presented in this paper can be used to identify the mostly relevant features given a classification task. Originality/value: This paper computes the direct effect of a selected subset of features in a target variable to evaluate if a variable in this subset is really a cause of the target or if it is a spurious correlation.

Document forgeries that involve modification of the materials used, such as ink and paper, provide evidence of any malpractices being performed. Forensic specialists use different techniques to identify and classify these samples; however, the most preferred method is to use nondestructive techniques to avoid any potential damage to the original specimen under investigation. Hyperspectral imaging has already been explored in several application domains and used as a powerful method in forensic investigations to extract information about the materials under examination. To precisely classify the material information and utilize the hyperspectral imaging technique's potential, we probed the potential of some hybrid spectral similarity measures to classify different commonly used paper samples. A comparison of these methods is quantitatively presented in this article. Hybrid spectral similarity algorithms are tested on forensic analysis of paper data. We compared the classification capabilities of various hybrid spectral similarity algorithms on hyperspectral data of 40 different paper samples. The overall accuracy (OA), kappa K̂, Z‐score of kappa (ZK̂), and the 95% confidence interval of kappa (CI(K̂)) are used for comparison. The SID‐SAM and SID‐SCA produced an overall accuracy of 88% and 87%, respectively, which is highest among the hybrid spectral similarity measures tested. [ABSTRACT FROM AUTHOR]

The digital trunking system has the characteristics that the calling mode is mainly group calling and the communication mode is mostly half duplex. For the problem that the traditional user classification method couldn't meet the classification requirements of digital cluster users, this paper proposed a digital cluster user classification method based on improved RFM model. Firstly, it introduced the average speech duration attribute to establish the recency vitality speak (RVS) model. Then, it used the analytic hierarchy process to determine the weight of each parameter in the model. Finally, it used the K-means + + clustering algorithm to classify digital cluster users. The simulation result shows that, by using the user classification method proposed in this paper, the accuracy of digital cluster user classification can reach more than 87. 9% . [ABSTRACT FROM AUTHOR]

This paper examines the work practices involved in making data legible to machines and machine output legible to humans. The study is based on ethnographic research of a team of art experts at DNArt – a data classification system that features a growing database of art images, a classification scheme, a similarity matching algorithm, and a website that together serve as a consumer judgment device in an emerging online market for art. I analyze interactions from meeting observations, interviews, documentation, and online interaction data to show how non-technical art experts explain and repair sociotechnical breakdowns – when their expectations for similarity between art images and artists differ from the similarity relations produced by the algorithm. By repairing breakdowns, the art experts construct the algorithm anew, as a legitimate revealer of similarity in art. In doing so, the team's repair work is folded back into the black box of the algorithm, rendering it invisible and unacknowledged, sometimes even by the experts themselves. [ABSTRACT FROM AUTHOR]

Abstract: Surface roughness is one of the most important attributes of paper and its measurement is normally used in quality control applications. Currently, measurement of surface roughness is done by using air leakage, optical, or subjective methods. In this article, an acoustical method for the determination of surface roughness of papers is described. The method is applied off-line and uses the friction noise recorded when a small brush slide over the surface of the paper. The analysis is done consider the friction noise ranging from 300Hz to 10kHz. Considering that friction noise is associated to surface roughness, a signal analysis algorithm was developed to take advantage of this fact. The algorithm consists of a frequency-domain feature extraction routine and an artificial neural network that represents the variation of the spectral features in a roughness scale. The results show that an affordable and efficient friction noise based system can be used for measuring surface roughness of tissue papers and other soft surfaces as an alternative to other methods. [Copyright &y& Elsevier]

The research of biomedical data is crucial for disease diagnosis, health management, and medicine development. However, biomedical data are usually characterized by high dimensionality and class imbalance, which increase computational cost and affect the classification performance of minority class, making accurate classification difficult. In this paper, we propose a biomedical data classification method based on feature selection and data resampling. First, use the minimal-redundancy maximal-relevance (mRMR) method to select biomedical data features, reduce the feature dimension, reduce the computational cost, and improve the generalization ability; then, a new SMOTE oversampling method (Spectral-SMOTE) is proposed, which solves the noise sensitivity problem of SMOTE by an improved spectral clustering method; finally, the marine predators algorithm is improved using piecewise linear chaotic maps and random opposition-based learning strategy to improve the algorithm's optimization seeking ability and convergence speed, and the key parameters of the spectral-SMOTE are optimized using the improved marine predators algorithm, which effectively improves the performance of the over-sampling approach. In this paper, five real biomedical datasets are selected to test and evaluate the proposed method using four classifiers, and three evaluation metrics are used to compare with seven data resampling methods. The experimental results show that the method effectively improves the classification performance of biomedical data. Statistical test results also show that the proposed PRMPA-Spectral-SMOTE method outperforms other data resampling methods. [ABSTRACT FROM AUTHOR]

The naive Bayes classification algorithm is a simple and practical method for classification. There were a lot of studieson the assumption of conditional independence between attributes. The researchwas committed to eliminate redundant attributes and to reduce the correlation between attributes, with the aim to obtain some new attributes beingmore independentof and adapted to naive Bayes algorithm. However, the independence between new attributes was not easy to measure. Therefore, the improvement of the naive Bayes algorithm was not supported sufficiently by theory but was more supported by data experiments. This paper definedGauss distributed data and proposedan improved naive Bayes algorithm using the Gram-Schmidt orthogonalization method, making it convenient for classification with Gaussian distribution data. The improved method was different from the previous method. Unlike previous methods that explicitly construct new attributes set or attributes transformation matrix, the approach in the current paper directly orthogonalized the sample data of attributes. It was also provedthat the abstract new attributes corresponding to the orthogonalized attributes datawere independence. This showedthat the assumption of conditional independence in the original naive Bayes algorithm will not cause obstacles to the use of the algorithm for the classification of Gauss distributed data, as this constraint can be satisfied after Gram-Schmidt orthogonalization. [ABSTRACT FROM AUTHOR]

The clinical diagnosis of heart disease in most situations is based on a difficult amalgamation of pathological and clinical information. Because of this complication, there is a significant level of curiosity among many diagnostic healthcare professionals and researchers who are keenly interested in the efficient, accurate, and early-stage forecasting of heart disease. Deep Learning Algorithms aid in the prediction of heart disease. The main focus of this paper is to develop a method for predicting heart disease through Modified Rough K means + + (MRK + +) clustering along with the Restricted Boltzmann Machine (RBM). This paper is categorized into two modules: (1) Propose a clustering component based on Modified Rough K-means + + ; (2) disease prediction based on RBM. The input Cleveland dataset is clustered using the stochastic probabilistic rough k-means + + clustering technique in the module for clustering. The clustered data is acquired and used in the RBM, and this hybrid structure is then used in the heart disease forecasting module. Throughout the testing procedure, the most valid result is chosen from the clustered test data, and the RBM classifier that correlates to the nearest cluster in the test data is based on the smallest distance or similar parameters. Furthermore, the output value is used to predict heart disease. There are three different types of experiments that are performed: In the first experiment comprises modifying the rough K-means + + clustering algorithm, the second experiment evaluates the classification result, and the third experiment suggests hybrid model representation. When the Hybrid Modified Rough k-means + + - RBM model is compared with any single model, it provides the highest accuracy. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new method for solving variational inclusion problems in Hilbert spaces. This algorithm uses two inertial terms to speed up the convergence. In order to avoid computing the Lipschitz stepsize, we use an updated stepsize which is not necessary to know the Lipschitz constant of the operator. The weak convergence is established under some mild conditions. We present numerical performance of the proposed algorithm and compare our algorithm with other algorithms in literature. Finally, we deduce our algorithm for solving the convex minimization problem and give an application to the data classification problem of heart failure dataset. [ABSTRACT FROM AUTHOR]

The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper introduces an innovative algorithm selection approach called the CNN-HT, which is a two-stage algorithm selection framework. In the first stage, a Convolutional Neural Network (CNN) is employed to classify problems. In the second stage, the Hypothesis Testing (HT) technique is used to suggest the best-performing algorithm based on the statistical analysis of the performance metric of algorithms that address various problem categories. The two-stage approach can adapt to different algorithm combinations without the need to retrain the entire model, and modifications can be made in the second stage only, which is an improvement of one-stage approaches. To provide a more general structure for the classification model, we adopt Exploratory Landscape Analysis (ELA) features of the problem as input and utilize feature selection techniques to reduce the redundant ones. In problem classification, the average accuracy of classifying problems using CNN is 96%, which demonstrates the advantages of CNN compared to Random Forest and Support Vector Machines. After feature selection, the accuracy increases to 98.8%, further improving the classification performance while reducing the computational cost. This demonstrates the effectiveness of the first stage of the CNN-HT method, which provides a basis for algorithm selection. In the experiments, CNN-HT shows the advantages of the second stage algorithm as well as good performance with better average rankings in different algorithm combinations compared to the individual algorithms and another algorithm combination approach. [ABSTRACT FROM AUTHOR]

This paper presents a practical contamination detection system for camera lenses using image analysis with deep learning. The proposed system can detect contamination in camera digital images through contamination learning utilizing deep learning, and it aims to prevent performance degradation of intelligent vision systems due to lens contamination in cameras. This system is based on the object detection algorithm YOLO (v5n, v5s, v5m, v5l, and v5x), which is trained with 4000 images captured under different lighting and background conditions. The trained models showed that the average precision improves as the algorithm size increases, especially for YOLOv5x, which showed excellent efficiency in detecting droplet contamination within 23 ms. They also achieved an average precision (mAP@0.5) of 87.46%, recall (mAP@0.5:0.95) of 51.90%, precision of 90.28%, recall of 81.47%, and F1 score of 85.64%. As a proof of concept, we demonstrated the identification and removal of contamination on camera lenses by integrating a contamination detection system and a transparent heater-based cleaning system. The proposed system is anticipated to be applied to autonomous driving systems, public safety surveillance cameras, environmental monitoring drones, etc., to increase operational safety and reliability. [ABSTRACT FROM AUTHOR]

Classification is a widely used supervised learning technique that enables models to discover the relationship between a set of features and a specified label using available data. Its applications span various fields such as engineering, telecommunication, astronomy, and medicine. In this paper, we propose a novel rule-based classifier called RUCIB (RUle-based Classifier Inspired by BRADO), which draws inspiration from the socio-inspired swarm intelligence algorithm known as BRADO. RUCIB introduces two key aspects: the ability to accommodate multiple values for features within a rule and the capability to explore all data features simultaneously. To evaluate the performance of RUCIB, we conducted experiments using ten databases sourced from the UCI machine learning database repository. In terms of classification accuracy, we compared RUCIB to ten well-known classifiers. Our results demonstrate that, on average, RUCIB outperforms Naive Bayes, SVM, PART, Hoeffding Tree, C4.5, ID3, Random Forest, CORER, CN2, and RACER by 9.32%, 8.97%, 7.58%, 7.4%, 7.34%, 7.34%, 7.22%, 5.06%, 5.01%, and 1.92%, respectively. [ABSTRACT FROM AUTHOR]

Class noise is a common issue that affects the performance of classification techniques on real-world data sets. Class noise appears when a class variable in data sets has incorrect class labels. In the case of noisy data, the robustness of classification techniques against noise could be more important than the performance results on noise-free data sets. The decision tree method is one of the most popular techniques for classification tasks. The C4.5, CART, and random forest (RF) algorithms are considered to be three of the most used algorithms in decision trees. The aim of this paper is to reach conclusions on which decision tree algorithm is better to use for building decision trees in terms of its performance and robustness against class noise. In order to achieve this aim, we study and compare the performance of the models when applied to class variables with noise. The results obtained indicate that the RF algorithm is more robust to data sets with noisy class variable than other algorithms. [ABSTRACT FROM AUTHOR]

Designers refer to existing product cases and innovate products to develop new products. However, when designers screen product cases, there is no user participation, which leads to the lack of user-side knowledge and emotional drive that is very important for design. Therefore, it is necessary to play the role of user emotional knowledge in promoting the whole design process. This paper proposes the concept of the positive perceptual sample, which applies the knowledge emotion integration of designers and users to the screening sample case stage at the beginning of the design process. This study is based on the lack of user-side knowledge and emotional drive of reference cases and integrates user emotion into the reference case screening process. Then, in the emotion measurement process, users' cognitive data in the screening process are obtained through the eye-brain fusion cognitive experiment. Finally, the XGBoost algorithm is used to process feature index data to realize the classification and recognition of cognitive data and applied to the positive perceptual classification of products. The results show that the classification accuracy of physiological cognitive data with user emotional representation by the XGBoost algorithm is 90.87%. The results of cognitive data classification are applied to the screening of positive perceptual samples, and the satisfaction rate is 98.35%. The results show that the method proposed in this paper provides a new source of ideas for obtaining positive perceptual samples and can be applied to new product development. [ABSTRACT FROM AUTHOR]

The existing YOLO target detection algorithm, based on one-stage concept, aims for multi-objective detection. But this algorithm performs not well for dual classification detection and add more performance overhead while detection. In order to improve the detection efficiency of dual classification mask wearing during the period of COVID-19, this paper proposes a real-time detection method based on YOLO for detecting the condition of bi-objective mask wearing. The optimization is based on the latest YOLO version 4: firstly, the feedforward input layer of the model is improved to optimize the data augment part and the adaptive image scaling is added to improve the efficiency of the detection for both dual classification and small objectives; secondly, the adaptive anchoring frame is added to replace the activation function so as to reduce the computation and thus improve its efficiency; thirdly, the optimization of Neck and the addition of Focus structure improve the capability of feature fusion and reduce the amount of parameters to raise the efficiency. The experimental results showed that, compared with the existing YOLO version 4, using this method in this paper improves F1 by 0.33% and mAp by 0.71% in the data set. Also, the detection efficiency is also improved significantly under the same experimental condition. [ABSTRACT FROM AUTHOR]

Consensus algorithm based on credit has significant advantages in consensus efficiency and security, which has received great attention from academy and industry in recent years. This paper made a comparative analysis of the current consensus algorithms based on credit to provide reference for researchers to study in depth. Firstly, this paper systematically reviewed the state-of-the-art consensus algorithms based on credit, gave its development history, classification and core working principle, and summarized its credit calculation model and performance evaluation indicators. Secondly, it analyzed the creditbased consensus algorithms qualitatively and quantitatively, and pointed out their advantages and disadvantages. Finally, aiming at the problems of insufficient credit incentive and low integration with the consensus process in the state-of-the-art consensus algorithms, this paper proposed to optimize from the credit incentive based on game theory and designing efficient communication topology, and gave the future research direction. [ABSTRACT FROM AUTHOR]

In reality, the data generated in many fields usually have multiple classes and are imbalanced. In multi-class imbalance classification, problems such as class overlap, noise and multiple minority classes reduce the capability of classifiers, and effective solution of multi-class imbalance problem has become an important research topic in the field of machine learning and data mining. Based on the recent literature on multi-class imbalance classification methods, this paper analyzed and summarized both data preprocessing and algorithm-level classification methods, and conducted a detailed analysis of all algorithms in terms of advantages, disadvantages and data sets. The data preprocessing methods introduced oversampling, under-sampling, hybrid sampling and feature selection methods to compare the performance of the algorithms using the same datasets. In addition, the algorithm-level classification methods described and analyzed base classifier optimization, ensemble learning and multi-class decomposition techniques. Finally, this paper summarizes the future development directions of the multi-class imbalanced data classification research field. [ABSTRACT FROM AUTHOR]

Machine learning techniques aim to mimic the human ability to automatically learn how to perform tasks through training examples. They have proven capable of tasks such as prediction, learning and adaptation based on experience and can be used in virtually any scientific application, ranging from biomedical, robotic, to business decision applications, and others. However, the lack of domain knowledge for a particular application can make feature extraction ineffective or even unattainable. Furthermore, even in the presence of pre-processed datasets, the iterative process of optimizing Machine Learning parameters, which do not translate from one domain to another, maybe difficult for inexperienced practitioners. To address these issues, we present in this paper a Vectorized Automated ML Pre-processIng and post-pRocEssing framework, approximately named (VAMPIRE), which implements feature extraction algorithms capable of converting large time-series recordings into datasets. Also, it introduces a new concept, the Activation Engine, which is attached to the output of a Multi Layer Perceptron and extracts the optimal threshold to apply binary classification. Moreover, a tree-based algorithm is used to achieve multi-class classification using the Activation Engine. Furthermore, the internet of things gives rise to new applications such as remote sensing and communications, so consequently applying Machine Learning to improve operation accuracy, latency, and reliability is beneficial in such systems. Therefore, all classifications in this paper were performed on the edge in order to reach high accuracy with limited resources. Moreover, forecasts were applied on three unrelated biomedical datasets, and on two other pre-processed urban and activity detection datasets. Features were extracted when required, and training and testing were performed on the Raspberry Pi remotely, where high accuracy and inference speed were achieved in every experiment. Additionally, the board remained competitive in terms of power consumption when compared with a laptop which was optimized using a Graphical Processing Unit. [ABSTRACT FROM AUTHOR]

Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes. Self-complementary linear codes are binary codes that, together with any vector, contain its complement as well. This paper is about binary linear self-complementary codes. A natural goal in coding theory is to find a linear code with a given length n and dimension k such that the minimum distance d is maximal. Codes with these properties are called optimal. Another important issue is classifying the optimal codes, i.e., finding exactly one representative of each equivalence class. In some sense, the classification problem is more general than the minimum distance bounds problem. In this work, we summarize the classification results for self-complementary codes with the maximum possible minimum distance and a length of up to 20. For the classification, we developed a new algorithm that is much more efficient compared to existing ones in some cases. [ABSTRACT FROM AUTHOR]

In the magnetic-suspension bearing-rotor system, the shape features of the rotor axis trajectory can directly reflect the system operation status and fault information. Accurately classifying the bearing faults can promptly find the cause of the fault and respond quickly and protect it. In this paper, in order to achieve fault identification by identifying and classifying the rotor axis trajectory, we use Hu moment invariants to extract feature vectors from the rotor axis trajectory to identify faults. We use imperial competitive algorithm to reduce redundant data and establish a directed acyclic graph support vector machine to classify and identify feature data. Compared with traditional classification models such as C4.5 and BP neural networks, the experimental results show that the support vector machine model based on Hu moment invariants and simulated annealing has a higher accuracy and robustness in small sample classification. It is suitable for intelligent identification and classification for bearing faults. [ABSTRACT FROM AUTHOR]

This paper presents a method for unsupervised classification of entities by a group of agents with unknown domains and levels of expertise. In contrast to the existing methods based on majority voting ("wisdom of the crowd") and their extensions by expectation-maximization procedures, the suggested method first determines the levels of the agents' expertise and then weights their opinions by their expertise level. In particular, we assume that agents will have relatively closer classifications in their field of expertise. Therefore, the expert agents are recognized by using a weighted Hamming distance between their classifications, and then the final classification of the group is determined from the agents' classifications by expectation-maximization techniques, with preference to the recognized experts. The algorithm was verified and tested on simulated and real-world datasets and benchmarked against known existing algorithms. We show that such a method reduces incorrect classifications and effectively solves the problem of unsupervised collaborative classification under uncertainty, while outperforming other known methods. [ABSTRACT FROM AUTHOR]

In this paper, we discuss applications of neural networks to recognizing knots and, in particular, to the unknotting problem. One of the motivations for this study is to understand how neural networks work on the example of a problem for which rigorous mathematical algorithms for its solution are known. We represent knots by rectangular Dynnikov diagrams and apply neural networks to distinguish a given diagram's class from a finite family of topological types. The data presented to the program is generated by applying Dynnikov moves to initial samples. The significance of using these diagrams and moves is that in this context the problem of determining whether a diagram is unknotted is a finite search of a bounded combinatorial space. In this way, this paper provides a foundation for further work where the neural network itself will learn to use the Dynnikov moves for knot recognition. Source code of the programs is available at https://github.com/nerusskikh/deepknots. [ABSTRACT FROM AUTHOR]

In the contemporary world, data pervades every facet of human life, and the information contained in this data plays a pivotal role in shaping decision-making and advancing technology. Among the plethora of techniques available, classification methods are highly effective tools for extracting valuable insights from vast volumes of data. The R ule A ggregation C lassifi ER (RACER) is a novel rule-based classification algorithm known for its exceptional performance. A notable limitation of RACER lies in its inability to handle continuous features. In this paper, we address the aforementioned limitation by employing various supervised discretization methods, including CAIM, MDLP, Decision Tree (CART), and ChiMerge. The impact of these methods on RACER's accuracy and understandability is evaluated across nine datasets from the UCI repository. Additionally, the paper conducts a comparative analysis of RACER's accuracy against well-known classifiers such as Naive Bayes, Logistic Regression, SVM, LightGBM, and Decision Tree. The findings indicate that RACER achieves the highest average accuracy when we utilize MDLP as the discretization method, surpassing its initial average accuracy. Moreover, RACER demonstrates superior understandability by generating the lowest number of rules when employing ChiMerge and Decision Tree for discretizing numerical features. Furthermore, RACER outperforms the other five classifiers when employing MDLP. • The discretization unit enables the RACER algorithm to handle continuous data. • The discretization unit improves the classification accuracy of the RACER. • The discretization unit increases the understandability of the RACER rules. [ABSTRACT FROM AUTHOR]

In this paper, we formulate the problem of estimating the resident population, i.e. correcting for over-counts in administrative register data, as a binary classification problem. We propose a solution based on machine learning algorithms. The selection and the optimisation of the best algorithm is shown to depend on the goal of prediction. We illustrate this method for two important cases of official statistics, Census resident population and survey design with minimum non-response. The performance of the algorithms, the uncertainty of estimates and of the evaluation metrics are described in detail and implemented in shared, open source code. We exemplify with the results obtained by applying this method to Icelandic register and survey data. [ABSTRACT FROM AUTHOR]

As a novel neural network learning framework, Twin Extreme Learning Machine (TELM) has received extensive attention and research in the field of machine learning. However, TELM is affected by noise or outliers in practical applications so that its generalization performance is reduced compared to robust learning algorithms. In this paper, we propose two novel distance metric optimization-driven robust twin extreme learning machine learning frameworks for pattern classification, namely, CWTELM and FCWTELM. By introducing the robust Welsch loss function and capped L 2 , p -distance metric, our methods reduce the effect of outliers and improve the generalization performance of the model compared to TELM. In addition, two efficient iterative algorithms are designed to solve the challenges brought by the non-convex optimization problems CWTELM and FCWTELM, and we theoretically guarantee their convergence, local optimality, and computational complexity. Then, the proposed algorithms are compared with five other classical algorithms under different noise and different datasets, and the statistical detection analysis is implemented. Finally, we conclude that our algorithm has excellent robustness and classification performance. [ABSTRACT FROM AUTHOR]

Intrusion Detection Systems (IDS) play a critical role in safeguarding corporate IT systems by providing automated protection against various attacks and intrusions. They efficiently identify suspicious attack scenarios and promptly alert or intervene to prevent an attack. This paper focuses on the research conducted to develop a classification module for Behavior-based IDSs (BIDS). Typically, these modules are built using a sample dataset that comprises a significant amount of data describing both benign and malicious network traffic. In our case, the CSE-CIC-IDS2018 dataset on AWS served as the foundation for this purpose. The investigation aimed to develop an effective classifier module for a BIDS system using the CatBoost algorithm. To evaluate the performance of the trained classifier, we compared it to three other well-known classifiers trained on the same data, employing the same selected features. Additionally, we utilized four different performance measures, namely accuracy, precision, recall, and F1 score. The results demonstrated that, overall, the CatBoost classifier delivered performance on par with or better than the baseline methods. This finding supports the initial assumption that a CatBoost-based solution could be a viable choice when developing a BIDS. [ABSTRACT FROM AUTHOR]

Weakly supervised temporal action localization (WTAL) aims to locate the start and end boundaries of action instances and identify the corresponding actions. Although the existing methods have made great progress, there are still problems of incomplete localization and missing detection of shorter motions. To this end, this paper proposed a localization method of feature mining and region enhancement (FMRE) Firstly it calculated the similarity score between video segments through the base branch, and aggregated the context information with this score to obtain a more differentiated segment classification score, further realizing the complete positioning of the action. Then, it added a enhance branch to dynamically up-sample action proposals with a shorter duration in the initial localization along the temporal dimension, and then utilized the multi-head self-attention mechanism to explicitly model the temporal structure between action proposals, which facilitated action localization with temporal dependencies and prevented missing detection of short actions. Finally, it constructed pseudo-labels of mutual supervision between the two branches to gradually improve the quality of action proposals during the training process. The algorithm achieves mAP of 70.3% and 40.7% detection performances on the THUMOS14 and ActivityNet1.3 datasets respectively, which proves the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem of low accuracy and poor robustness of Visual Simultaneous Localization and Mapping (VSLAM） in dynamic environment, This paper proposed an adaptive Dynamic SLAM（AD-SLAM）. The scene dynamic classification front-end based on epipolar geometry constraint perceives the dynamic changes of the working environment in real time. The dynamic feature culling in low dynamic environment based on geometric constraints and moving probability and the dynamic target processing in high dynamic environment based on semantic segmentation eliminates moving objects. Experimental verification on the computer vision dataset TUM shows that the proposed method can improve the accuracy and robustness of localization in the mapping process of mobile robots while ensuring the real-time performance of the algorithm. [ABSTRACT FROM AUTHOR]

Most of the existing multi-label learning techniques consider the correlation learning problem but ignore the inconsistency feature of structural properties, which can change the structural property of the label space obtained by function mapping and it can directly affect the classification performance. In order to deal with this problem, this paper proposed a multi-label classification algorithm based on structural property preserving policy and correlation learning policies. Firstly, the algorithm constructed a mapping function to realize the mapping between the feature space and the label space. Secondly, it used structural property preserving strategy based on feature data to reduce the difference between feature data caused by linear transformation. Finally, this paper introduced the correlation learning strategy based on label data to further optimize the parameters of the proposed algorithm to improve the classification performance. The experimental results through a group of benchmark instances show that compared with the other classical multi-label classification algorithm, the proposed algorithm is much superior in classification performance, and the algorithm has great effectiveness. [ABSTRACT FROM AUTHOR]

Background: HER2 gene expression is one of the main reference indicators for breast cancer detection and treatment, and it is also an important target for tumor targeted therapy drug selection. Therefore, the correct detection and evaluation of HER2 gene expression has important value for clinical treatment of breast cancer.Objective: The study goal is to better classify HER2 images.Methods: For general convolution neural network, with the increase of network layers, over fitting phenomenon is often very serious, which requires setting the value of random descent ratio, and parameter adjustment is often time-consuming and laborious, so this paper uses residual network, with the increase of network layer, the accuracy will not be reduced.Results: In this paper, a HER2 image classification algorithm based on improved residual network is proposed. Experimental results show that the proposed HER2 network has high accuracy in breast cancer assessment.Conclusion: Taking HER2 images in Stanford University database as experimental data, the accuracy of HER2 image automatic classification is improved through experiments. This method will help to reduce the detection intensity and improve the accuracy of HER2 image classification. [ABSTRACT FROM AUTHOR]

The paper presents a new method of optimization by the Layered Algorithm (LA). The proposed algorithm reduces the initial area to the sub-area containing the optimum. The proposed technique is based on the classification of the optimized function values (data sampled by sensors). The classification method uses a two-dimensional three-state Cellular Automata (CA). The CA classifies all area points ascribed to the CA cells based on their values. Specification of the categorization layers to the data gives a possibility to identify the different levels areas. Consequently, after analysis, a sub-area containing the optimum can be designated. In this paper, the proposed algorithm is applied to find the location of the airborne contaminant source by analyzing the concentration of released substances reported by mobile sensors distributed over the domain of interest. The Gaussian dispersion model simulation of the contaminant dispersion in the urbanized area is applied to generate the data used to verify the efficiency of the proposed Layered Algorithm. The LA successfully estimates the sub-area of the considered domain where the contamination source is located, taking to account data from sensors solely. • Optimization method reducing the initial area to the sub-area containing the optimum. • Verification of the Layered Algorithm (LA) with Selected Benchmark Functions. • Analysis of the LA efficiency to localize the airborne contaminant source. • LA results assessment by the measures: classification and accuracy error, relevance. [ABSTRACT FROM AUTHOR]

• An analysis of lexicographic optimization for feature selection and data classification. • Cooperative co-evolution for feature selection while the classifier hyperparameters are also being optimized. • Optimization of multiple objectives using a simple evolutionary algorithm. • A new lexicographic ranking methodology to compare the results of different feature selection methods. • Quite good results for real high-dimensional datasets. This paper starts with two hypotheses. The first one is that the simultaneous optimization of the hyperparameters regulating the classifier within a wrapper method, while the best subset of features is being determined, should improve the results with respect to those obtained with a pre-parameterized classifier. The second one is that solving these two problems can be formulated as a lexicographic optimization problem, allowing the use of a simple single-objective evolutionary algorithm to solve this multi-objective problem. The fitness function is of key importance for such wrapper methods. It is responsible for guiding the search towards potentially good solutions and it also consumes most of the runtime. Having these issues in mind, this paper also proposes a new lexicographic fitness function, designed to minimize the runtime of the algorithm and also to avoid over-fitting. Furthermore, the execution time and the quality of the results obtained by the wrapper procedure also depend on some algorithmic hyperparameters: the similarity thresholds used when comparing two different solutions lexicographically and the percentage of data samples used for validation during the training process. Thus, an experimental analysis has been carried out to find adequate values for these hyperparameters. Finally, the lexicographic cooperative co-evolutionary wrapper approach, using the new fitness function proposed in this paper, has been tested with several datasets belonging to the University of California, Irvine (UCI) repository and also with some real high-dimensional datasets, obtaining quite good results, compared to other state-of-the-art wrapper methods. The comparison has also been made lexicographically, with a new methodology proposed in this paper. [ABSTRACT FROM AUTHOR]

Clustering and classification-based pattern recognition techniques are widely used in various domains. While many approaches exist to perform these tasks, it remains a difficult process to perform clustering and classification simultaneously for particular datasets. In this paper, a method based on k-nearest neighbor (KNN) is presented to classify the dataset with PSO optimized k-medoids clustering. Initial clustering with k-medoids algorithm divides the dataset into smaller and disjoint clusters featuring similarity within clusters and dissimilarity with members of other clusters. Particle swarm optimization (PSO) is an evolutionary algorithm mainly used to optimize the issues in several research areas including data analytics. The fitness function of the PSO approach mentioned in this paper is based on inertia weights that identify the particles with the best positions and velocities for optimization. Additionally, PSO uses a novel elitism concept that allows massive searching capability between the swarm of particles to achieve a better convergence rate. Because of this property, it can be applied throughout different machine learning fields. Moreover, the KNN classifier outperforms the classification task in terms of classifying the optimized particles with high accuracy. The performance of the proposed technique is evaluated by experimenting with datasets taken from open sources. The simulation results revealed that the performance of the proposed method is better than the existing methods in terms of effective clustering as well as accurate classification. [ABSTRACT FROM AUTHOR]

Aiming at the problem of fine-grained visual categorization, this paper proposed an effective algorithm to achieve end-to-end fine-grained visual categorization. The ECA module in ECA-Net was a channel attention mechanism with significant performance advantages. It model-fused with the classic network ResNet-50 to form the ResEca. Then, it used the object-level image positioning module and the part-level image generation module to generate object-level and part-level images. Those images combined with original images could be as the input of the new constructed network Tb-ResEca-Net. This paper trained the 95. 1% and 95. 3% respectively on the test set of the corresponding dataset. The experimental results show that this method has higher classification accuracy and stronger robustness compares with other traditional fine-grained classification methods, which is an effective fine-grained image classification method. [ABSTRACT FROM AUTHOR]

Representation-based classification ( RC) usually uses all the training samples of all pattern classes to represent a test sample . However, whether it is necessary to use all pattern classes to represent the test sample remains to be investigated . So, this paper proposed two-stage representation-based classification framework. First, it used a RC algorithm to calculate the representation coefficients of the test sample w. r. t the training samples of all classes, and found the first k ( k≥1) classes with the minimum representation error. Then with the training samples of these k classes, it applied a RC algorithm again to represent the test sample, based on which, the label of the test sample was finally determined by finding the minimal representation error class among those k classes. In addition, this paper developed a nonnegative weighted collaborative RC ( NWCRC) algorithm. The first and second RC algorithm of the proposed RC framework could be the same or different. Setting the first and second RC algorithms to be the same, with five different RC, experiments were carried out on five databases, experimental results of which show that the proposed two -stage RC framework can significantly improve the classification accuracy of the original RC algorithms in most cases. [ABSTRACT FROM AUTHOR]

Rock classification is a significant branch of geology which can help understand the formation and evolution of the planet, search for mineral resources, and so on. In traditional methods, rock classification is usually done based on the experience of a professional. However, this method has problems such as low efficiency and susceptibility to subjective factors. Therefore, it is of great significance to establish a simple, fast, and accurate rock classification model. This paper proposes a fine-grained image classification network combining image cutting method and SBV algorithm to improve the classification performance of a small number of fine-grained rock samples. The method uses image cutting to achieve data augmentation without adding additional datasets and uses image block voting scoring to obtain richer complementary information, thereby improving the accuracy of image classification. The classification accuracy of 32 images is 75%, 68.75%, and 75%. The results show that the method proposed in this paper has a significant improvement in the accuracy of image classification, which is 34.375%, 18.75%, and 43.75% higher than that of the original algorithm. It verifies the effectiveness of the algorithm in this paper and at the same time proves that deep learning has great application value in the field of geology. [ABSTRACT FROM AUTHOR]

The use of emotion to drive robotic interaction continues to grow across a range of use cases, from social robotics to increased survivability. Nevertheless, these efforts remain isolated from each other and are not easily compared between papers and projects. To this end an extensive survey of 1427 IEEE and ACM publications was conducted, covering robotics and emotion. The survey first resulted in broad categorizations of key trends covering emotional input and output. This was followed by an extended analysis on 232 papers that focused on the internal processing of emotion, where emotion was handled through some kind of algorithm and not just as an input or output. From this analysis, three broad categories were developed: emotional intelligence, emotional model, and implementation. Emotional intelligence captured the manner in which emotion was handled and included the subcategories: algorithm, mapping, and history. The emotional model category captured the emotion categories and number of emotions used, while the implementation category tracked the role, purpose, and platform. This paper concludes with a summary of key features discovered through the process, future opportunities, and a discussion of the intrinsic challenges emerging from the interaction of emotion and robotics. [ABSTRACT FROM AUTHOR]

The advancement in technology is taking place with an accelerating pace across the globe. With the increasing expansion and technological advancement, a vast volume of text data are generated everyday, in the form of social media platform, websites, company data, healthcare data, and news. Indeed, it is a difficult task to extract intriguing patterns from the text data, such as opinions, summaries, and facts, having varying length. Because of the problems of the length of text data and the difficulty of feature value extraction in news, this paper proposes a news text classification method based on the combination of deep learning (DL) algorithms. In order to classify the text data, the earlier approaches use a single word vector to express text information and only the information of the relationship between words were considered, but the relationship between words and categories was ignored which indeed is an important factor for the classification of news text. This paper follows the idea of a customized algorithm which is the combination of DL algorithms such as CNN, LSTM, and MLP and proposes a customized DCLSTM-MLP model for the classification of news text data. The proposed model is expressed in parallel with word vector and word dispersion. The relationship among words is represented by the word vector as an input of the CNN module, and the relationship between words and categories is represented by a discrete vector as an input of the MLP module in order to realize comprehensive learning of spatial feature information, time-series feature information, and relationship between words and categories of news text. To check the stability and performance of the proposed method, multiple experiments were performed. The experimental results showed that the proposed method solves the problems of text length, difficulty of feature extraction in the news text, and classification of news text in an effective way and attained better accuracy, recall rate, and comprehensive value as compared to the other models. [ABSTRACT FROM AUTHOR]

The case study of plant intelligence inspired novel non-swarm intelligence (NSI) algorithms, namely Venus Flytrap Optimization and Bladder-Worts Suction, concentrated in this paper. These algorithms devised on the prey-hunting mechanisms of the Venus Flytrap (Dionaea Muscipula) and BladderWorts (Utricularia) plants, respectively. A comparative view of these algorithms is discussed. The main-support criterion is the major characteristic of these approaches. The benefits of this main-support criterion and their performances are evidenced with a case study of extracting the highly correlated maximal local patterns in gene expression data through biclustering. The NSI algorithms are proposed for biclustering gene expression data in this paper. The results are compared with existing optimization techniques like PSO and GA, and biclustering approaches like Cheng and Church, OPSM, BiMax, and Plaid approaches. This analysis evidenced the performance of NSI algorithms can yield optimal maximal local patterns with high correlation. Further, various real-time research applications of NSI approaches are also discussed. [ABSTRACT FROM AUTHOR]