Search

Manual term extraction is similar to literal meaning: A translator browses text, classifies words, and prepares for translation. Terminology, as a centralized carrier of expertise, creation, popularization, and disappearance, dynamically reflects the development and evolution of an industry. The automatic extraction of terminology is a key technology for creating a professional terminology database, and it is also a key topic in the field of natural language processing. The purpose of this paper is to study how to analyse a term extraction algorithm based on machine learning and a comprehensive feature strategy. Focusing on the problems of poor generality and single statistical features of current term extraction algorithms, this paper proposes an improved domain ontology term extraction algorithm based on a comprehensive feature strategy. Moreover, automatic term extraction experiments based on a word-based maximum entropy model and a conditional random field model based on machine learning are conducted in this paper. Its word-based conditional random field model outperforms the maximum entropy model. The experimental results show that the algorithm based on the comprehensive feature strategy improves the accuracy by 8.6% compared with the TF-IDF algorithm and the C-value term extraction algorithm. This algorithm can be used to effectively extract the terms in a text and has good generality. [ABSTRACT FROM AUTHOR]

Asthma, a common chronic respiratory disease among children and adults, affects more than 200 million people worldwide and causes about 450,000 deaths each year. Machine learning is increasingly applied in healthcare to assist health practitioners in decision-making. In asthma management, machine learning excels in performing well-defined tasks, such as diagnosis, prediction, medication, and management. However, there remain uncertainties about how machine learning can be applied to predict asthma exacerbation. This study aimed to systematically review recent applications of machine learning techniques in predicting the risk of asthma attacks to assist asthma control and management. A total of 860 studies were initially identified from five databases. After the screening and full-text review, 20 studies were selected for inclusion in this review. The review considered recent studies published from January 2010 to February 2023. The 20 studies used machine learning techniques to support future asthma risk prediction by using various data sources such as clinical, medical, biological, and socio-demographic data sources, as well as environmental and meteorological data. While some studies considered prediction as a category, other studies predicted the probability of exacerbation. Only a group of studies applied prediction windows. The paper proposes a conceptual model to summarise how machine learning and available data sources can be leveraged to produce effective models for the early detection of asthma attacks. The review also generated a list of data sources that other researchers may use in similar work. Furthermore, we present opportunities for further research and the limitations of the preceding studies. [ABSTRACT FROM AUTHOR]

In the field of machine learning, clustering has become an increasingly popular research topic due to its critical importance. Many clustering algorithms have been proposed utilizing a variety of approaches. This study focuses on clustering of high-dimensional data using the maximum margin clustering approach. In this paper, two methods are introduced: The first method employs the classical maximum margin clustering approach, which separates data into two clusters with the greatest margin between them. The second method takes cluster compactness into account and searches for two parallel hyperplanes that best fit to the cluster samples while also being as far apart from each other as possible. Additionally, robust variants of these clustering methods are introduced to handle outliers and noise within the data samples. The stochastic gradient algorithm is used to solve the resulting optimization problems, enabling all proposed clustering methods to scale well with large-scale data. Experimental results demonstrate that the proposed methods are more effective than existing maximum margin clustering methods, particularly in high-dimensional clustering problems, highlighting the efficacy of the proposed methods. [ABSTRACT FROM AUTHOR]

Clustering, a well-studied problem in the machine learning community, becomes even more intriguing with the emergence of quantum machine learning. Specifically, exploring clustering techniques for quantum data, such as quantum states, holds great interest. This paper introduces a quantum state clustering algorithm that utilizes variational quantum circuits. Our algorithm transforms the clustering problem into a parameter optimization task involving parametric quantum circuits. Each cluster is represented by a variational quantum circuit (VQC), which learns to extract the distinctive feature of its corresponding cluster during the optimization process. To guide the optimization of circuit parameters, we design an objective function that encourages each cluster's feature extractor to produce features similar to states within its own cluster and dissimilar to states in other clusters. We construct four quantum state datasets for testing the effectiveness of our algorithm. The numerical results demonstrate that our algorithm can achieve satisfying performance. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel algorithm that uses machine learning and natural language processing techniques to facilitate the coding of feature listing data. Feature listing is a method in which participants are asked to provide a list of features that are typically true of a given concept or word. This method is commonly used in research studies to gain insights into people's understanding of various concepts. The standard procedure for extracting meaning from feature listings is to manually code the data, which can be time-consuming and prone to errors, leading to reliability concerns. Our algorithm aims at addressing these challenges by automatically assigning human-created codes to feature listing data that achieve a quantitatively good agreement with human coders. Our preliminary results suggest that our algorithm has the potential to improve the efficiency and accuracy of content analysis of feature listing data. Additionally, this tool is an important step toward developing a fully automated coding algorithm, which we are currently preliminarily devising. [ABSTRACT FROM AUTHOR]

This paper presents a range of novel reinforcement learning algorithms derived from the actor–critic approach. These modified algorithms effectively utilize the available information to enhance performance. Our proposed framework introduces several key components to the traditional actor–critic model, including an underlying model learner, selector, tuner, and estimator. The estimator employs an approximate value function and the learned underlying model to estimate the values of all actions at the next state. The selector approximates the optimal action at the next state, which is then utilized by the actor to optimize its policy. In contrast to the conventional actor–critic algorithm where the actor focuses solely on policy optimization and the critic performs value-function approximation and policy evaluation, our selector–actor–critic algorithm employs a selector to approximate the optimal action at the current state, thereby influencing the actor's policy updates. Furthermore, our tuner–actor–critic algorithm incorporates a critic and a model-learner to approximate the action-value function and the dynamics of the underlying environment, respectively. The tuner then utilizes this information to adjust the value of the current state–action pair. In the estimator–selector–actor–critic algorithm, we develop intelligent agents based on the concepts of lookahead and intuition. Lookahead is utilized in estimating the values of available actions at the next state, while intuition guides the maximization of the probability of selecting the approximate optimal action. Through simulation experiments, we evaluate the performance of these algorithms, and the results demonstrate the superiority of the estimator–selector–actor–critic approach over other existing algorithms. [ABSTRACT FROM AUTHOR]

With the birth of the IoT era, it is evident that the existing number of devices is going to rise exponentially. Any two devices will communicate with each other using the same frequency band with limited availability. Therefore, it is of vital importance that this frequency band used for communication be used efficiently to accommodate the maximum number of devices with the available radio resources. Cognitive radio (CR) technology serves this exact purpose. The stated one is an intelligent radio that is made to automatically identify the optimal wireless channel in the available wireless spectrum at a given instant. An important functionality of CR is spectrum sensing. Energy detection is a very popular algorithm used for spectrum sensing in CR technology for efficient allocation of radio resources to the devices intended to communicate with each other. Energy detection detects the presence of a primary user (PU) signal by continuously monitoring a selected frequency bandwidth. The conventional energy detection technique is known to perform poorly in lower SNR ranges. This paper works towards the improvement of the energy detection algorithm with the help of machine learning (ML). The ML model uses the general properties of the signal as training data and classifies between a PU signal and noise at very low SNR ranges (− 25 to − 10 dB). In this research, a K-nearest neighbours (KNN) model is selected for its versatility and simplicity. Upon testing the model with an out-of-sample dataset, the KNN model produced a detection accuracy of 94.5%. [ABSTRACT FROM AUTHOR]

In recent years, the convergence of the Internet of Things (IoT) and machine learning technologies has instigated advancements in IoT, and machine learning has revolutionized SMEs, reshaping their role in regional economic growth. These technologies provide SMEs with innovative tools, fostering connectivity within regional ecosystems. This transformation is crucial for China's economic realignment in its 'new normal' phase, with enterprises driving social and economic progress. This study proposed the XGBoost algorithm and IoT data enhance collaboration among SMEs in regional economies, fostering innovation and driving economic development. The role of IoT and machine learning in promoting sustainable regional economic prosperity. Technological innovation is essential for enterprise survival and growth in a competitive landscape. This paper examines the influence of environmental factors and geography on economic development across China's regions. It focuses on SME coupling and coordination, contributing to regional economic progress through performance evaluation. IoT integration provides SMEs with abundant real-time data, enabling deep insights into customer behavior, supply chains, and production. Simultaneously, the XGBoost algorithm efficiently processes and extracts actionable insights from this data. Data from 11 provinces in the Yangtze River economic belt highlights Jiangsu Province's leadership in regional innovation performance for 2015 and 2020. The empirical results, grounded in datasets amalgamating information from these provinces, attest to the potential of this IoT and XGBoost-driven approach. Boasting an impressive accuracy rate of 91.7%, surpassing alternative machine learning techniques like SVM, KNN, DT, RF, and LR, this research underscores the effectiveness of this integrated strategy in optimizing SME operations. Additionally, it computes the coupling coordination degree, innovation environment ranking, mean value, and numerical changes from 2010 to 2020, with an average innovation coupling coordination degree of 0.1624 across 30 Chinese provinces. [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]

The paper offers a detailed description of the application and significance of machine learning methods during various processing stages of modern metallurgy. The relevance of this topic is based on the significant positive technical and economic effects from the use of machine learning noted by both Russian and world-leading manufacturers in the field of metallurgy. [ABSTRACT FROM AUTHOR]

Twin support vector regression (TSVR) has been widely applied in regression problems. TSVR seeks a pair of ε -insensitive proximal planes by solving two support vector machine type problems. TSVR assumes that the matrices appearing in the dual formulation are positive definite. However, in real-world scenarios, such an assumption may not be fulfilled and, hence, leads to suboptimal performance. ε -Twin support vector regression (ε -TSVR) improved the TSVR by introducing the regularisation term to avoid the singularity issues. Most of the twin support vector machine models involve the computation of matrix inverses. Also, TSVR implements the empirical risk minimization principle. In this paper, we propose an improved twin support vector regression (ITSVR) for brain age estimation by introducing different Lagrangian functions for the primal problems of the TSVR. The proposed ITSVR implements the structural risk minimization principle and avoids the computation of the matrix inverses. To solve the optimization problem more efficiently, we used successive overrelaxation (SOR) technique. We evaluated the proposed ITSVR on cognitively healthy subjects, mild cognitive impairment subjects and Alzheimer's disease subjects. The experimental results demonstrate that the proposed ITSVR has superior performance compared to the baseline models for brain age estimation. [ABSTRACT FROM AUTHOR]

Purpose: Artifacts in magnetic resonance imaging (MRI) scans degrade image quality and thus negatively affect the outcome measures of clinical and research scanning. Considering the time-consuming and subjective nature of visual quality control (QC), multiple (semi-)automatic QC algorithms have been developed. This systematic review presents an overview of the available (semi-)automatic QC algorithms and software packages designed for raw, structural T1-weighted (T1w) MRI datasets. The objective of this review was to identify the differences among these algorithms in terms of their features of interest, performance, and benchmarks. Methods: We queried PubMed, EMBASE (Ovid), and Web of Science databases on the fifth of January 2023, and cross-checked reference lists of retrieved papers. Bias assessment was performed using PROBAST (Prediction model Risk Of Bias ASsessment Tool). Results: A total of 18 distinct algorithms were identified, demonstrating significant variations in methods, features, datasets, and benchmarks. The algorithms were categorized into rule-based, classical machine learning-based, and deep learning-based approaches. Numerous unique features were defined, which can be roughly divided into features capturing entropy, contrast, and normative measures. Conclusion: Due to dataset-specific optimization, it is challenging to draw broad conclusions about comparative performance. Additionally, large variations exist in the used datasets and benchmarks, further hindering direct algorithm comparison. The findings emphasize the need for standardization and comparative studies for advancing QC in MR imaging. Efforts should focus on identifying a dataset-independent measure as well as algorithm-independent methods for assessing the relative performance of different approaches. [ABSTRACT FROM AUTHOR]