Search

This article introduces a novel 2D shape data augmentation approach based on intra-class shape space exploration. The proposed method relies on a geodesic interpolation between shapes, leveraging invariant-based morphing techniques. By blending a 2D shape pair belonging to a given class, we are able to generate nonlinear augmentations, hence covering more variations within the shape space. In particular, we formulate data augmentation as an optimization problem that minimizes the deformations between two shapes using the Generalized Finite Fourier Invariant Descriptor. The proposed augmentation technique is evaluated using numerous Convolution Neural Network architectures for 2D shape classification. The results indicate the superiority of the proposed method as compared to state-of-the-art techniques when considering small-scale datasets. [ABSTRACT FROM AUTHOR]

The diagnosis of major depressive disorder (MDD) is commonly based on the subjective evaluation by experienced psychiatrists using clinical scales. Hence, it is particularly important to find more objective biomarkers to aid in diagnosis and further treatment. Alpha-band activity (7-13 Hz) is the most prominent component in resting electroencephalogram (EEG), which is also thought to be a potential biomarker. Recent studies have shown the existence of multiple sub-oscillations within the alpha band, with distinct neural underpinnings. However, the specific contribution of these alpha sub-oscillations to the diagnosis and treatment of MDD remains unclear. In this study, we recorded the resting-state EEG from MDD and HC populations in both open and closed-eye state conditions. We also assessed cognitive processing using the MATRICS Consensus Cognitive Battery (MCCB). We found that the MDD group showed significantly higher power in the high alpha range (10.5–11.5 Hz) and lower power in the low alpha range (7–8.5 Hz) compared to the HC group. Notably, high alpha power in the MDD group is negatively correlated with working memory performance in MCCB, whereas no such correlation was found in the HC group. Furthermore, using five established classification algorithms, we discovered that combining alpha oscillations with MCCB scores as features yielded the highest classification accuracy compared to using EEG or MCCB scores alone. Our results demonstrate the potential of sub-oscillations within the alpha frequency band as a potential distinct biomarker. When combined with psychological scales, they may provide guidance relevant for the diagnosis and treatment of MDD. • MDD group showed significantly higher power in the high alpha range and lower power in the low alpha range. • High alpha power in the MDD group is negatively correlated with working memory performance in MCCB. • Combining alpha oscillations with MCCB scores as features yielded the highest classification accuracy. [ABSTRACT FROM AUTHOR]

Small data learning problems are characterized by a significant discrepancy between the limited number of response variable observations and the large feature space dimension. In this setting, the common learning tools struggle to identify the features important for the classification task from those that bear no relevant information and cannot derive an appropriate learning rule that allows discriminating among different classes. As a potential solution to this problem, here we exploit the idea of reducing and rotating the feature space in a lower-dimensional gauge and propose the gauge-optimal approximate learning (GOAL) algorithm, which provides an analytically tractable joint solution to the dimension reduction, feature segmentation, and classification problems for small data learning problems. We prove that the optimal solution of the GOAL algorithm consists in piecewise-linear functions in the Euclidean space and that it can be approximated through a monotonically convergent algorithm that presents—under the assumption of a discrete segmentation of the feature space—a closed-form solution for each optimization substep and an overall linear iteration cost scaling. The GOAL algorithm has been compared to other state-of-the-art machine learning tools on both synthetic data and challenging real-world applications from climate science and bioinformatics (i.e., prediction of the El Niño Southern Oscillation and inference of epigenetically induced gene-activity networks from limited experimental data). The experimental results show that the proposed algorithm outperforms the reported best competitors for these problems in both learning performance and computational cost. [ABSTRACT FROM AUTHOR]

In this paper, a robust fault detection methodology for complex analog CMOS integrated filters is presented. It is based on combining the two types of testing methodologies, Oscillation-Based Testing (OBT) and IDDQ testing, i.e., measuring of the power-supply current ( I D D ). The proposed methodology is applied to the Bi-quad Sallen–Key band-pass (BP) filter cell with relatively complex, two-stage, class-AB-output, operational amplifier (opamp) topology. The filter is custom designed targeting the 180-nm CMOS technology. Hundreds of time-domain simulations and analyses of the circuit output signal are performed in order to obtain the fault dictionary. The presented results show that the proposed hybrid OBT–IDDQ methodology is significantly more efficient in the defects coverage than any of the particular test methodologies alone. Subsequently, the specific algorithm for the defects classification is proposed. Based on the classification, certain degree of diagnosis of the individual defect, or a group of defects, can be achieved. [ABSTRACT FROM AUTHOR]

In this study, the authors combine the acoustic emission (AE) technique with the Brazilian splitting test and the angled die shear test to monitor the development of cracks in red sandstone specimens under compression–tension and compression–shear conditions to identify the mechanism of propagation of tensile and shear failures during the process of damage to rock. We use this to propose a method to analyze the comprehensive index of fracture-induced AEs of red sandstone based on information entropy. A comprehensive index to characterize the tensile and shear failures of rock was obtained by quantifying the entropy weights of the characteristic parameters of AE and their laws of evolution were analyzed. Areas for the classification of different cracking mechanisms of rock were established based on the Box–Cox transform, and the fractal features of crack development under compression–tension and compression–shear conditions were analyzed by using the Grassberger and Procaccia (G–P) algorithm. The results showed differences in the entropy of the characteristic parameters of red sandstone in cases of tensile and shear damage, with the rise time and energy recording the maximum entropies, respectively, and the amplitude yielding the minimum entropy. The comprehensive evaluation indices for tensile failure ξ t and shear failure ξ τ confirmed the existence of at least two mechanisms of deformation-induced damage—tensile fracture and shear slip—in the process of damage to the rock. The curve of evolution of the fractal dimensions D t and D τ of compression–tension and compression–shear, respectively, followed the law of continuously decreasing dimensions, and their turning points reflected the change in crack development in the rock. [ABSTRACT FROM AUTHOR]

Photovoltaic power plant (PVPP) has increased importance among renewable energy sources due to their ability to be connected more easily to a modern power grid. However, the reliability and stability operation of a grid-connected PVPP system is very important to ensure even during grid faults. In this study, a capacitive bridge fault current limiter (CBFCL) using a machine learning (ML) method is applied to enhance the fault ride-through (FRT) capability of a grid-connected PVPP system. Three different protection methods called DC chopper, CBFCL, and DC chopper + CBFCL are designed to prevent the harmful effects of overcurrent that occurs during grid faults to protect the grid-connected PVPP system. The ML algorithm can be trained on historical data to predict optimum control parameters based on real-time conditions such as normal and fault operations of the grid-connected PVPP system. An ensemble classification algorithm has the best results among the four classification algorithms in machine learning methods. The ensemble classification algorithm is separately implemented into the control systems of three protection strategies. Bagged Trees and Subspace KNN classifiers in ensemble classification methods have obtained an impressive accuracy of 98% in ML classification methods. The simulation results illustrate that the DC chopper + CBFCL based ensemble provides the best protection for the grid-connected PVPP system compared to other protection systems. [ABSTRACT FROM AUTHOR]

Background: Trigonocephaly occurs due to the premature fusion of the metopic suture, leading to a triangular forehead and hypotelorism. This condition often requires surgical correction for morphological and functional indications. Metopic ridges also originate from premature metopic closure but are only associated with mid-frontal bulging; their surgical correction is rarely required. Differential diagnosis between these two conditions can be challenging, especially in minor trigonocephaly. Methods: Two hundred seven scans of patients with trigonocephaly (90), metopic rigdes (27), and controls (90) were collected. Geometric morphometrics were used to quantify skull and orbital morphology as well as the interfrontal angle and the cephalic index. An innovative method was developed to automatically compute the frontal curvature along the metopic suture. Different machine-learning algorithms were tested to assess the predictive power of morphological data in terms of classification. Results: We showed that control patients, trigonocephaly and metopic rigdes have distinctive skull and orbital shapes. The 3D frontal curvature enabled a clear discrimination between groups (sensitivity and specificity > 92%). Furthermore, we reached an accuracy of 100% in group discrimination when combining 6 univariate measures. Conclusion: Two diagnostic tools were proposed and demonstrated to be successful in assisting differential diagnosis for patients with trigonocephaly or metopic ridges. Further clinical assessments are required to validate the practical clinical relevance of these tools. [ABSTRACT FROM AUTHOR]

Brain–computer interface (BCI) systems include signal acquisition, preprocessing, feature extraction, classification, and an application phase. In fNIRS-BCI systems, deep learning (DL) algorithms play a crucial role in enhancing accuracy. Unlike traditional machine learning (ML) classifiers, DL algorithms eliminate the need for manual feature extraction. DL neural networks automatically extract hidden patterns/features within a dataset to classify the data. In this study, a hand-gripping (closing and opening) two-class motor activity dataset from twenty healthy participants is acquired, and an integrated contextual gate network (ICGN) algorithm (proposed) is applied to that dataset to enhance the classification accuracy. The proposed algorithm extracts the features from the filtered data and generates the patterns based on the information from the previous cells within the network. Accordingly, classification is performed based on the similar generated patterns within the dataset. The accuracy of the proposed algorithm is compared with the long short-term memory (LSTM) and bidirectional long short-term memory (Bi-LSTM). The proposed ICGN algorithm yielded a classification accuracy of 91.23 ± 1.60%, which is significantly (p < 0.025) higher than the 84.89 ± 3.91 and 88.82 ± 1.96 achieved by LSTM and Bi-LSTM, respectively. An open access, three-class (right- and left-hand finger tapping and dominant foot tapping) dataset of 30 subjects is used to validate the proposed algorithm. The results show that ICGN can be efficiently used for the classification of two- and three-class problems in fNIRS-based BCI applications. [ABSTRACT FROM AUTHOR]

The detection of subsurface archaeological remains using a range of remote sensing methods poses several challenges. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work, we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near-infrared parts of the spectrum were taken in a controlled environment in Cyprus during 2011–2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, in particular in the neighborhood of 570 nm, and (2) the red edge part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis, we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time. [ABSTRACT FROM AUTHOR]

Combining the extracted tongue features with other medical indicators can effectively judge the diseases of patients. The previous work usually only analyzes a certain feature of the tongue body and is unable to extract multiple features simultaneously. In this study, a multi‐label classification network named TIM‐Net is proposed, which integrates global and local features to achieve multi‐label intelligent diagnosis of Chinese medicine tongue images. First, a feature extraction network based on ResNet is proposed to capture the features of tongue images more sufficiently. Then, a multi‐label classification algorithm fusing global and local features is proposed, and targeted screening operations are carried out on the class‐related feature maps based on global confidence. In addition, a logical masking algorithm is proposed to ensure that the local features can only correct the feature labels they represent, and do not interfere with other feature labels. The classification accuracy is further improved by using local feature confidence and correcting the global classification results. Finally, the experimental results indicate that the classification accuracy of the tongue images is gradually improved through optimizing the feature extraction network and fusing local features, and it exceeds other state‐of‐the‐art multi‐label classification networks. [ABSTRACT FROM AUTHOR]

The heterogeneity of Hepatocellular Carcinoma (HCC) poses a barrier to effective treatment. Stratifying highly heterogeneous HCC into molecular subtypes with similar features is crucial for personalized anti-tumor therapies. Although driver genes play pivotal roles in cancer progression, their potential in HCC subtyping has been largely overlooked. This study aims to utilize driver genes to construct HCC subtype models and unravel their molecular mechanisms. Utilizing a novel computational framework, we expanded the initially identified 96 driver genes to 1192 based on mutational aspects and an additional 233 considering driver dysregulation. These genes were subsequently employed as stratification markers for further analyses. A novel multi-omics subtype classification algorithm was developed, leveraging mutation and expression data of the identified stratification genes. This algorithm successfully categorized HCC into two distinct subtypes, CLASS A and CLASS B, demonstrating significant differences in survival outcomes. Integrating multi-omics and single-cell data unveiled substantial distinctions between these subtypes regarding transcriptomics, mutations, copy number variations, and epigenomics. Moreover, our prognostic model exhibited excellent predictive performance in training and external validation cohorts. Finally, a 10-gene classification model for these subtypes identified TTK as a promising therapeutic target with robust classification capabilities. This comprehensive study provides a novel perspective on HCC stratification, offering crucial insights for a deeper understanding of its pathogenesis and the development of promising treatment strategies. Author summary: Dividing highly heterogeneous HCC into molecular subtypes with similar characteristics is crucial for personalized anti-tumor therapies. Although driver genes play pivotal roles in cancer progression, their potential in HCC subtyping has been largely overlooked. In this work, we developed a multi-omics network-based stratification algorithm that utilizes patient mutation data and requires smaller computational resources for subtype assignment. Through this algorithm, we categorized HCC into two subtypes, CLASS A and CLASS B. Using multi-omics and single-cell data, we identified differences between these subtypes in gene expression, methylation, immune infiltration, and other aspects. Beyond subtype characterization, our study established a robust clinical prediction model (https://mike-wang-bjut.shinyapps.io/DynNomapp%5fHCC%5fSutypes/) incorporating subtype information and typical clinical features, enabling precise survival predictions. Finally, we developed a high-performing machine learning classifier for our subtype. Analyzing this classification model and reviewing previous experimental papers, we identified TTK as a potential diagnostic marker and therapeutic target specific to our subtypes. In conclusion, our research offers a novel perspective on HCC stratification, which is crucial for a deeper understanding of its pathogenesis and developing promising treatment strategies. [ABSTRACT FROM AUTHOR]

In this study, an early warning system predicting first‐year undergraduate student academic performance is developed for higher education institutions. The significant factors that affect first‐year student success are derived and discussed such that they can be used for policy developments by related bodies. The dataset used in experimental analyses includes 11,698 freshman students' data. The problem is constructed as classification models predicting whether a student will be successful or unsuccessful at the end of the first year. A total of 69 input variables are utilized in the models. Naive Bayes, decision tree and random forest algorithms are compared over model prediction performances. Random forest models outperformed others and reached 90.2% accuracy. Findings show that the models including the fall semester CGPA variable performed dramatically better. Moreover, the student's programme name and university placement exam score are identified as the other most significant variables. A critical discussion based on the findings is provided. The developed model may be used as an early warning system, such that necessary actions can be taken after the second week of the spring semester for students predicted to be unsuccessful to increase their success and prevent attrition. [ABSTRACT FROM AUTHOR]

To better combat the devastation of the protected forests in Côte d'Ivoire, a study was conducted to create a technique for detecting the acoustic signals produced by chainsaws deployed to fell trees in these areas. To improve the recognition rate of chainsaw sounds in a forest environment and increase the detection range of the recognition system, we are implementing the maximum ratio combining (MRC) technique on a microphone array. Therefore, the employment of an identification system is compared using one (01) microphone against the outcomes obtained by adopting system with three (03), six (06), and twelve (12) microphones. The use of MRC is then contrasted with an alternative recombining approach, designated as simple summation (SS). The SS is characterised by the simple addition of the signals acquired by the microphone array in the frequency domain. The MRC was employed on various microphone arrangements, accounting for varying degrees of attenuation experienced by chainsaw sounds. The K-Nearest Neighbors, in combination with Mel Frequency Cepstral Coefficients (MFCC), was employed to detect chainsaw sounds within the 16 kHz central frequency octave band. MRC applied to microphone arrays provided superior outcomes than simple summation. The enhancement in terms of classification rate ranged from [18; 51], favouring MRC. Moreover, it extended the chainsaw detection range from 520 m (using one microphone) to 1210 m (using a 12-microphone array). Taking into account the criteria for selecting an optimum microphone array, including classification rate, number of microphone nodes, information processing time and detection range, the six-microphone array was chosen as the best configuration. This configuration boasts a theoretical detection range of 1040 meters. [ABSTRACT FROM AUTHOR]

The use of machine learning algorithms in healthcare can amplify social injustices and health inequities. While the exacerbation of biases can occur and be compounded during problem selection, data collection, and outcome definition, this research pertains to the generalizability impediments that occur during the development and post-deployment of machine learning classification algorithms. Using the Framingham coronary heart disease data as a case study, we show how to effectively select a probability cutoff to convert a regression model for a dichotomous variable into a classifier. We then compare the sampling distribution of the predictive performance of eight machine learning classification algorithms under four stratified training/testing scenarios to test their generalizability and their potential to perpetuate biases. We show that both extreme gradient boosting and support vector machine are flawed when trained on an unbalanced dataset. We then show that the double discriminant scoring of type 1 and 2 is the most generalizable with respect to the true positive and negative rates, respectively, as it consistently outperforms the other classification algorithms, regardless of the training/testing scenario. Finally, we introduce a methodology to extract an optimal variable hierarchy for a classification algorithm and illustrate it on the overall, male and female Framingham coronary heart disease data. [ABSTRACT FROM AUTHOR]

In a standard binary supervised classification task, the existence of both negative and positive samples in the training dataset are required to construct a classification model. However, this condition is not met in certain applications where only one class of samples is obtainable. To overcome this problem, a different classification method, which learns from positive and unlabeled (PU) data, must be incorporated. In this study, a novel method is presented: neighborhood-based positive unlabeled learning using decision tree (NPULUD). First, NPULUD uses the nearest neighborhood approach for the PU strategy and then employs a decision tree algorithm for the classification task by utilizing the entropy measure. Entropy played a pivotal role in assessing the level of uncertainty in the training dataset, as a decision tree was developed with the purpose of classification. Through experiments, we validated our method over 24 real-world datasets. The proposed method attained an average accuracy of 87.24%, while the traditional supervised learning approach obtained an average accuracy of 83.99% on the datasets. Additionally, it is also demonstrated that our method obtained a statistically notable enhancement (7.74%), with respect to state-of-the-art peers, on average. [ABSTRACT FROM AUTHOR]

Medulloblastoma (MB) is a molecularly heterogeneous brain malignancy with large differences in clinical presentation. According to genomic studies, there are at least four distinct molecular subgroups of MB: sonic hedgehog (SHH), wingless/INT (WNT), Group 3, and Group 4. The treatment and outcomes depend on appropriate classification. It is difficult for the classification algorithms to identify these subgroups from an imbalanced MB genomic data set, where the distribution of samples among the MB subgroups may not be equal. To overcome this problem, we used singular value decomposition (SVD) and group lasso techniques to find DNA methylation probe features that maximize the separation between the different imbalanced MB subgroups. We used multinomial regression as a classification method to classify the four different molecular subgroups of MB using the reduced DNA methylation data. Coordinate descent is used to solve our loss function associated with the group lasso, which promotes sparsity. By using SVD, we were able to reduce the 321,174 probe features to just 200 features. Less than 40 features were successfully selected after applying the group lasso, which we then used as predictors for our classification models. Our proposed method achieved an average overall accuracy of 99% based on fivefold cross-validation technique. Our approach produces improved classification performance compared with the state-of-the-art methods for classifying MB molecular subgroups. [ABSTRACT FROM AUTHOR]

The extraction of effective classification features from high-dimensional hyperspectral images, impeded by the scarcity of labeled samples and uneven sample distribution, represents a formidable challenge within hyperspectral image classification. Traditional few-shot learning methods confront the dual dilemma of limited annotated samples and the necessity for deeper, more effective features from complex hyperspectral data, often resulting in suboptimal outcomes. The prohibitive cost of sample annotation further exacerbates the challenge, making it difficult to rely on a scant number of annotated samples for effective feature extraction. Prevailing high-accuracy algorithms require abundant annotated samples and falter in deriving deep, discriminative features from limited data, compromising classification performance for complex substances. This paper advocates for an integration of advanced spectral–spatial feature extraction with meta-transfer learning to address the classification of hyperspectral signals amidst insufficient labeled samples. Initially trained on a source domain dataset with ample labels, the model undergoes transference to a target domain with minimal samples, utilizing dense connection blocks and tree-dimensional convolutional residual connections to enhance feature extraction and maximize spatial and spectral information retrieval. This approach, validated on three diverse hyperspectral datasets—IP, UP, and Salinas—significantly surpasses existing classification algorithms and small-sample techniques in accuracy, demonstrating its applicability to high-dimensional signal classification under label constraints. [ABSTRACT FROM AUTHOR]

Background: Petrous apex cholesterol granulomas (PACGs) are benign inflammatory cystic lesions of the temporal bone. Usually, asymptomatic patients may develop symptoms as the lesions expand. The diagnosis is based on both CT and MRI scans and the management relies on "wait and scan" or surgery. This paper aims at evaluating surgical outcomes and proposing a CT-based classification and a management algorithm. Methods: Patients with PACGs who were surgically treated between 2014 and 2024 were included. Symptoms, imaging, approach type and complications were considered. CT scans were classified as Type A (preserved apex cellularity), Type B (erosion of the apex cellularity), and Type C (involvement of the noble structures bone boundaries). The possible connection of the lesion with the infracochlear, perilabyrinthine and sphenoidal cellularity was assessed. Results: Nineteen patients with symptoms like diplopia, headache and sensorineural hearing loss were included. According to our classification, 1/19 patients was Type A, 4/19 were Type B and 14/19 were Type C. Five patients underwent a total resection, seven a subtotal and seven a surgical drainage. Only two complications were recorded, and 17/19 patients showed symptom regression and stability during follow-up. Conclusions: While the management of PACGs is still controversial, according to our classification and surgical outcomes, Type A, being mostly asymptomatic, should be managed with "wait and scan", Type B should undergo surgery when symptoms are present, while Type C should always undergo surgery because of their invasiveness and potential complications. When possible, a drainage should be attempted; otherwise, a surgical resection is chosen, and its completeness depends on the preoperative general and hearing status. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel approach to solving theorem proving problems without relying on any deduction method. We transform logical formulas into numbers, vectors and matrices, and feed the corresponding data into various machine learning algorithms to predict their satisfiability. Here, we introduce ProverX, a novel theorem prover that utilizes various binary classification algorithms, ranging from traditional machine learning to deep learning, to tackle the satisfiability (SAT) problem of propositional logic. Empirical experiments were conducted to evaluate the performance of ProverX using datasets we generated. ProverX achieved accuracy rates ranging from 81.8% to 98.7%, demonstrating a remarkable speedup of almost 180 times compared to CTL-RP, a highly efficient prover. These results demonstrate the feasibility of replacing deduction with learning in theorem proving, opening promising avenues for further exploration in more complex logics, e.g., Modal Logic, Coalition Logic, Propositional Linear-Time Temporal Logic, Computation Tree Logic, etc., provided that their resolution methods exist. We also present a detailed analysis of the best-performing machine learning approaches for this task and introduce a new algorithm, IPDA, which has the potential to further enhance performance. [ABSTRACT FROM AUTHOR]

Summary: Intrusion detection is a cyber‐security method that is significant for network security. It is utilized to detect behaviors that compromise security and privacy within a network or in the context of a computer system. To enhance the identification, an Intrusion Detection System Based on the Beetle Swarm Optimization and K‐RMS Clustering Algorithm cluster‐based hybrid classifiers is proposed in this manuscript. Here, the data is amassed from CICIDS2017 dataset. Then the data is preprocessed to eradicate the unwanted noise. After completing the preprocessed data, it can be clustered by using K‐RMS clustering algorithm. This algorithm cluster the entire data to the associated cluster set depending on the data behavior. The classification algorithm is considered to predict the data as normal or attacking behaviors. The hybrid classification is used to predict the data. The solitary predictor aims to achieve high detection rates and accuracy. The hybrid classifiers, such as support vector machines, artificial neural networks are applied to recognize the normal or intruder. The performance of the SVM‐ANN‐IDS method attains 22.05%, 15.87%, 27.25% higher accuracy, 23.90% and 28.53% higher precision, 29.29%, 19.19% and 23.27% higher specificity and 18.28%, 24.36% and 27.49% greater recall when compared to the existing models, like developing novel deep‐learning model to improve network intrusion categorization (DNN‐IDS), Intrusion identification scheme on real‐time data traffic under machine learning techniques along feature selection method (RNN‐SVM‐IDS) and recurrent deep learning basis feature fusion ensemble meta‐classifier for intellectual network intrusion identification scheme (RNN‐IDS) respectively. [ABSTRACT FROM AUTHOR]

Due to the susceptibility of microseismic activity to variations in construction parameters and geological conditions, deep-buried tunnel rockbursts often exhibit different precursor characteristics. Consequently, when rockburst intelligent early-warning methods are applied long-term during construction, manual intervention is required to adjust the warning model to maintain accuracy. In light of this issue, this paper focuses on the development of an intelligent dynamic early-warning method for rockbursts, using the Qinling Water Diversion Tunnel of the Hanjiang-to-Weihe Water Diversion Project as a case study. Daily microseismic parameters, construction progress, and records of previously occurred rockbursts serve as input parameters, while the occurrence and intensity level of rockbursts within the next day serve as output parameters. Sequential samples are constructed, and a dynamic early-warning model for rockbursts based on Recurrent Neural Network is established. The dynamic warning capabilities of the model were validated through two test sets, and its mechanism is explained. The results show that the records of occurred rockbursts as input parameters are indispensable. Increasing the sequence length appropriately can improve prediction accuracy. In comparison with other common classification algorithms, the Recurrent Neural Network exhibits superior performance. Ultimately, the model is applied to the long-term rockburst monitoring and early-warning work of the Hanjiang-to-Weihe Water Diversion Project, achieving a rockburst prediction accuracy of 91.2% and a rockburst level prediction accuracy of 86.0%. The findings of this study can provide valuable insights for the research and application of intelligent rockburst early-warning methods. Highlights: An intelligent dynamic early warning model for rockbursts was developed, offering a solution to the dependence on manual intervention. The model incorporates daily microseismic parameters, construction progress, and previous rockburst records as sequential input parameters. By learning from newly acquired rockburst situations and monitoring data, the model dynamically adapts to the ever-changing rockburst conditions. The model demonstrated high prediction accuracy in rockburst occurrence (91.2%) and rockburst level (86.0%) in long-term application. [ABSTRACT FROM AUTHOR]

The application of pattern mining algorithms to extract movement patterns from sports big data can improve training specificity by facilitating a more granular evaluation of movement. Since movement patterns can only occur as consecutive, non-consecutive, or non-sequential, this study aimed to identify the best set of movement patterns for player movement profiling in professional rugby league and quantify the similarity among distinct movement patterns. Three pattern mining algorithms (l-length Closed Contiguous [LCCspm], Longest Common Subsequence [LCS] and AprioriClose) were used to extract patterns to profile elite rugby football league hookers (n = 22 players) and wingers (n = 28 players) match-games movements across 319 matches. Jaccard similarity score was used to quantify the similarity between algorithms' movement patterns and machine learning classification modelling identified the best algorithm's movement patterns to separate playing positions. LCCspm and LCS movement patterns shared a 0.19 Jaccard similarity score. AprioriClose movement patterns shared no significant Jaccard similarity with LCCspm (0.008) and LCS (0.009) patterns. The closed contiguous movement patterns profiled by LCCspm best-separated players into playing positions. Multi-layered Perceptron classification algorithm achieved the highest accuracy of 91.02% and precision, recall and F1 scores of 0.91 respectively. Therefore, we recommend the extraction of closed contiguous (consecutive) over non-consecutive and non-sequential movement patterns for separating groups of players. [ABSTRACT FROM AUTHOR]

Application of time-series complexity measures (also known as entropies) has been quite useful in many Biomedical Engineering fields as in Brain–Computer Interfaces (BCI). Nevertheless, recently-proposed-entropy parameters referred to as dynamic complexity measures have not concretely been tested in BCI environment. The novelty of our research is evaluating the performance of Dynamic Bivariate Multiscale Entropy parameters (DBMSE) as alternative to typical classification algorithms in BCI, as common spatial patterns (CSP). After developing BCI training, the statistical results showed that CSP performed better than our initial DBMSE (DBMSE-I). This entropy uses a constant threshold r. However, after tunably including that quantity r, DBMSE-I improved to be almost as good as CSP. This updated entropy parameter was referred to as DBMSE-II. Since the limitations of these results were attributed to the shortness of the EEG records, a short-term-DBMSE (named here DBMSE-III) was developed. The findings revealed that DBMS-III had a slightly better performance than CSP outcomes, thus offering a new classifier alternative in BCI. Besides, we present entropy paths that reveal high/low complexity brain activity. This will be useful to identify EEG electrodes to move a robot within a preliminary assistance protocol in progress. Summing up: Besides knowing that DBMSE parameters are a good choice to show brain dynamics, DBMSE-III proved to be an alternative as classifier for CSP in our study, allowing interaction with a robot. In fact, we offer in this document a complete development from theory to execution of software and hardware. This experience will help support people with disabilities and their carers. [ABSTRACT FROM AUTHOR]

For solving the storage and indexing problem of big data, this paper proposes a big data storage algorithm and an indexing algorithm, respectively. Simultaneously, the data classification and segmentation algorithm is given, and then, the classified data are segmented and sliced based on features of data. Moreover, the calculation of the service queue length on data slicing is given to achieve fast storage of slices in the data server. A data reconstruction method is given to index each slice of the original data and implement the data reconstruction according to the given reconstruction method. At the same time, an evaluation method for data reconstruction is also given to achieve the minimum difference between the reconstructed data and the original data. Simulation results show that the accurate rate of the data reconstruction method proposed in this paper is higher than 93%. In addition, compared with the existing data reconstruction methods, it is found that it not only has higher reconstruction accurate rate, faster reconstruction process, stronger anti-interference ability, but also lower information loss. These researches in this paper provide the powerful methods for protecting important documents, reducing losses, reducing waste of resources, and improving the convenience, speed, and safety in work, life, and so on. [ABSTRACT FROM AUTHOR]

Rapid road network expansion has heightened the importance of surface condition information for traffic accident prevention and route optimization. This article introduces a laser diode-based sensor that identifies seven surface conditions and accurately measure ice, water, and snow film thicknesses on roads. An optical module was developed to detect weak optical signals based on the characteristic absorption spectrum of the target surface. The module used three laser diodes (1310, 1440, and 1550 nm wavelengths) as light sources. Additionally, a road classification algorithm that is adaptable to foggy weather was developed using a multi-wavelength processing protocol. The sensor was subjected to numerous calibration and performance verification experiments. During thick foggy measurements, the processed spectra displayed a maximum variation of 2.372% across a 600 to 25,000 m visibility range with a relative standard deviation of only 0.328%. This demonstrated effective weakening of the effects of visibility variations. During winter field testing, the sensor classified road conditions effectively and accurately measured ice, snow, and water film thicknesses, with a correlation coefficient of 0.97444. The accuracy of the measurements was less than 0.5 mm. The sensor's effectiveness for long-term field-based road testing has been verified. [ABSTRACT FROM AUTHOR]

A brain tumor is one of the most lethal diseases that can affect human health and cause death. Invasive biopsy techniques are one of the most common methods of identifying brain tumor disease. As a result of this procedure, bleeding may occur during the procedure, which could harm some brain functions. Consequently, this invasive biopsy process may be extremely dangerous. To overcome such a dangerous process, medical imaging techniques, which can be used by experts in the field, can be used to conduct a thorough examination and obtain detailed information about the type and stage of the disease. Within the scope of the study, the dataset was examined, and this dataset consisted of brain images with tumors and brain images of normal patients. Numerous studies on medical images were conducted and obtained with high accuracy within the hybrid model algorithms. The dataset's images were enhanced using three distinct local binary patterns (LBP) algorithms in the developed model within the scope of the study: the LBP, step-LBP (nLBP), and angle-LBP (αLBP) algorithms. In the second stage, classification algorithms were used to evaluate the results from the LBP, nLBP and αLBP algorithms. Among the 11 classification algorithms used, four different classification algorithms were chosen as a consequence of the experimental process since they produced the best results. The classification algorithms with the best outcomes are random forest (RF), optimized forest (OF), rotation forest (RF), and instance-based learner (IBk) algorithms, respectively. With the developed model, an extremely high success rate of 99.12% was achieved within the IBk algorithm. Consequently, the clinical service can use the developed method to diagnose tumor-based medical images. [ABSTRACT FROM AUTHOR]

Though COVID-19 is no longer a pandemic but rather an endemic, the epidemiological situation related to the SARS-CoV-2 virus is developing at an alarming rate, impacting every corner of the world. The rapid escalation of the coronavirus has led to the scientific community engagement, continually seeking solutions to ensure the comfort and safety of society. Understanding the joint impact of medical and non-medical interventions on COVID-19 spread is essential for making public health decisions that control the pandemic. This paper introduces two novel hybrid machine-learning ensembles that combine supervised and unsupervised learning for COVID-19 data classification and regression. The study utilizes publicly available COVID-19 outbreak and potential predictive features in the USA dataset, which provides information related to the outbreak of COVID-19 disease in the US, including data from each of 3142 US counties from the beginning of the epidemic (January 2020) until June 2021. The developed hybrid hierarchical classifiers outperform single classification algorithms. The best-achieved performance metrics for the classification task were Accuracy = 0.912, ROC-AUC = 0.916, and F1-score = 0.916. The proposed hybrid hierarchical ensemble combining both supervised and unsupervised learning allows us to increase the accuracy of the regression task by 11% in terms of MSE, 29% in terms of the area under the ROC, and 43% in terms of the MPP metric. Thus, using the proposed approach, it is possible to predict the number of COVID-19 cases and deaths based on demographic, geographic, climatic, traffic, public health, social-distancing-policy adherence, and political characteristics with sufficiently high accuracy. The study reveals that virus pressure is the most important feature in COVID-19 spread for classification and regression analysis. Five other significant features were identified to have the most influence on COVID-19 spread. The combined ensembling approach introduced in this study can help policymakers design prevention and control measures to avoid or minimize public health threats in the future. [ABSTRACT FROM AUTHOR]

Previous research shows that feeding and activity behaviours in combination with machine learning algorithms has the potential to predict the onset of bovine respiratory disease (BRD). This study used 229 novel and previously researched feeding, movement, and social behavioural features with machine learning classification algorithms to predict BRD events in pre-weaned calves. Data for 172 group housed calves were collected using automatic milk feeding machines and ultrawideband location sensors. Health assessments were carried out twice weekly using a modified Wisconsin scoring system and calves were classified as sick if they had a Wisconsin score of five or above and/or a rectal temperature of 39.5 °C or higher. A gradient boosting machine classification algorithm produced moderate to high performance: accuracy (0.773), precision (0.776), sensitivity (0.625), specificity (0.872), and F1-score (0.689). The most important 30 features were 40% feeding, 50% movement, and 10% social behavioural features. Movement behaviours, specifically the distance walked per day, were most important for model prediction, whereas feeding and social features aided in the model's prediction minimally. These results highlighting the predictive potential in this area but the need for further improvement before behavioural changes can be used to reliably predict the onset of BRD in pre-weaned calves. [ABSTRACT FROM AUTHOR]

Machine learning (ML) algorithms are increasingly used in power systems applications. One important application is the classification and localization of various types of transmission line faults. Using voltage and current measurements from phasor measurement units (PMUs), a number of useful features can be extracted, which can form the basis of a ML-based prediction of the fault type, line, and distance on the line. This paper proposes a technique to find the optimal number and placement of PMUs by performing thorough feature selection. The features are selected to maximize the accuracy of the ML classification and regression algorithms. The results show that for the IEEE 14 bus system, the use of only five PMUs is sufficient to obtain high levels of accuracy. For example, a testing accuracy of 99.0% and 97.1% can be achieved for the fault type and fault line location, respectively. As for the fault distance along the line, the testing MAE of 3.1% can be obtained along with an R 2 score of 94.4%. Adding more PMUs does not provide any additional value in terms of accuracy. [ABSTRACT FROM AUTHOR]

In developing countries, one-quarter of young women have suffered from anemia. However, the available studies in Ethiopia have been usually used the traditional stastical methods. Therefore, this study aimed to employ multiple machine learning algorithms to identify the most effective model for the prediction of anemia among youth girls in Ethiopia. A total of 5642 weighted samples of young girls from the 2016 Ethiopian Demographic and Health Survey dataset were utilized. The data underwent preprocessing, with 80% of the observations used for training the model and 20% for testing. Eight machine learning algorithms were employed to build and compare models. The model performance was assessed using evaluation metrics in Python software. Various data balancing techniques were applied, and the Boruta algorithm was used to select the most relevant features. Besides, association rule mining was conducted using the Apriori algorithm in R software. The random forest classifier with an AUC value of 82% outperformed in predicting anemia among all the tested classifiers. Region, poor wealth index, no formal education, unimproved toilet facility, rural residence, not used contraceptive method, religion, age, no media exposure, occupation, and having more than 5 family size were the top attributes to predict anemia. Association rule mining was identified the top seven best rules that most frequently associated with anemia. The random forest classifier is the best for predicting anemia. Therefore, making it potentially valuable as decision-support tools for the relevant stakeholders and giving emphasis for the identified predictors could be an important intervention to halt anemia among youth girls. [ABSTRACT FROM AUTHOR]

Aircraft icing refers to the accumulation of ice on the surface and components of an aircraft when supercooled water droplets collide with the aircraft above freezing levels (at altitudes at which the temperature is below 0 °C), which requires vigilant monitoring to avert aviation accidents attributable to icing. In response to this imperative, the Weather Radar Center (WRC) of the Korea Meteorological Administration (KMA) has developed a real-time icing detection algorithm. We utilized 3D dual-polarimetric radar variables, 3D atmospheric variables, and aircraft icing data and statistically analyzed these variables within the icing areas determined by aircraft icing data from 2018–2022. An algorithm capable of detecting icing potential areas (icing potential) was formulated by applying these characteristics. Employing this detection algorithm enabled the classification of icing potential into three stages: precipitation, icing caution, and icing warning. The algorithm was validated, demonstrating a notable performance with a probability of detection value of 0.88. The algorithm was applied to three distinct icing cases under varying environmental conditions—frontal, stratiform, and cumuliform clouds—thereby offering real-time observable icing potential across the entire Korean Peninsula. [ABSTRACT FROM AUTHOR]

Landsat cloud and cloud shadow detection has a long heritage based on the application of empirical spectral tests to single image pixels, including the Landsat product Fmask algorithm, which uses spectral tests applied to optical and thermal bands to detect clouds and uses the sun-sensor-cloud geometry to detect shadows. Since the Fmask was developed, convolutional neural network (CNN) algorithms, and in particular U-Net algorithms (a type of CNN with a U-shaped network structure), have been developed and are applied to pixels in square patches to take advantage of both spatial and spectral information. The purpose of this study was to develop and assess a new U-Net algorithm that classifies Landsat 8/9 Operational Land Imager (OLI) pixels with higher accuracy than the Fmask algorithm. The algorithm, termed the Learning Attention Network Algorithm (LANA), is a form of U-Net but with an additional attention mechanism (a type of network structure) that, unlike conventional U-Net, uses more spatial pixel information across each image patch. The LANA was trained using 16,861 512 × 512 30 m pixel annotated Landsat 8 OLI patches extracted from 27 images and 69 image subsets that are publicly available and have been used by others for cloud mask algorithm development and assessment. The annotated data were manually refined to improve the annotation and were supplemented with another four annotated images selected to include clear, completely cloudy, and developed land images. The LANA classifies image pixels as either clear, thin cloud, cloud, or cloud shadow. To evaluate the classification accuracy, five annotated Landsat 8 OLI images (composed of >205 million 30 m pixels) were classified, and the results compared with the Fmask and a publicly available U-Net model (U-Net Wieland). The LANA had a 78% overall classification accuracy considering cloud, thin cloud, cloud shadow, and clear classes. As the LANA, Fmask, and U-Net Wieland algorithms have different class legends, their classification results were harmonized to the same three common classes: cloud, cloud shadow, and clear. Considering these three classes, the LANA had the highest (89%) overall accuracy, followed by Fmask (86%), and then U-Net Wieland (85%). The LANA had the highest F1-scores for cloud (0.92), cloud shadow (0.57), and clear (0.89), and the other two algorithms had lower F1-scores, particularly for cloud (Fmask 0.90, U-Net Wieland 0.88) and cloud shadow (Fmask 0.45, U-Net Wieland 0.52). In addition, a time-series evaluation was undertaken to examine the prevalence of undetected clouds and cloud shadows (i.e., omission errors). The band-specific temporal smoothness index (TSIλ) was applied to a year of Landsat 8 OLI surface reflectance observations after discarding pixel observations labelled as cloud or cloud shadow. This was undertaken independently at each gridded pixel location in four 5000 × 5000 30 m pixel Landsat analysis-ready data (ARD) tiles. The TSIλ results broadly reflected the classification accuracy results and indicated that the LANA had the smallest cloud and cloud shadow omission errors, whereas the Fmask had the greatest cloud omission error and the second greatest cloud shadow omission error. Detailed visual examination, true color image examples and classification results are included and confirm these findings. The TSIλ results also highlight the need for algorithm developers to undertake product quality assessment in addition to accuracy assessment. The LANA model, training and evaluation data, and application codes are publicly available for other researchers. [ABSTRACT FROM AUTHOR]

This paper proposes a forward layer-wise learning algorithm for CNNs in classification problems. The algorithm utilizes the Separation Index (SI) as a supervised complexity measure to evaluate and train each layer in a forward manner. The proposed method explains that gradually increasing the SI through layers reduces the input data's uncertainties and disturbances, achieving a better feature space representation. Hence, by approximating the SI with a variant of local triplet loss at each layer, a gradient-based learning algorithm is suggested to maximize it. Inspired by the NGRAD (Neural Gradient Representation by Activity Differences) hypothesis, the proposed algorithm operates in a forward manner without explicit error information from the last layer. The algorithm's performance is evaluated on image classification tasks using VGG16, VGG19, AlexNet, and LeNet architectures with CIFAR-10, CIFAR-100, Raabin-WBC, and Fashion-MNIST datasets. Additionally, the experiments are applied to text classification tasks using the DBPedia and AG's News datasets. The results demonstrate that the proposed layer-wise learning algorithm outperforms state-of-the-art methods in accuracy and time complexity. [ABSTRACT FROM AUTHOR]

Many of the used features in sudden cardiac death (SCD) classification algorithms are based on features present in the autonomic system. However, changes in the autonomic system occur in both SCD subjects and patients with congestive heart failure (CHF). Therefore, many overlaps are observed in the features extracted from the cardiac signals of these two groups. To solve this challenge, this paper studies the changes in the multifractal dimension in patients with SCD and compares it with the subjects with CHF using the heart rate variability (HRV) signal processing. For this purpose, HRV signals are initially extracted, and their four sub-signals are determined using the empirical mode decomposition (EMD) method. Afterward, the instant amplitude of each sub-signal obtained in the previous step is calculated using the Teager energy method; thus, new signals are generated through the utilization of these instant amplitudes. Subsequently, modifications in each new signal's fractal dimensions are obtained using the multifractal detrended fluctuation analysis (MF-DFA) method. The appropriate features are selected using the t-test method and are applied to the support vector machine algorithm as input data. The proposed algorithm can differentiate the signal of SCD subjects with an average accuracy of 84.08% in 26 min prior to the event. [ABSTRACT FROM AUTHOR]

With the development of technology and the widespread collection of data, high-dimensional data analysis has become a research hotspot in many fields. Traditional parameter methods often face problems such as dimensional disasters in high-dimensional data analysis. Non parametric methods have broad application prospects in high-dimensional data because they do not rely on specific parameter distribution assumptions. The Bayesian rule is more suitable for dealing with noise and outliers in high-dimensional data because it takes uncertainty into account. Therefore, it is of great significance to combine non parametric methods with Bayesian methods for application research in high-dimensional data analysis. In this paper, the nonparametric Bayesian method was applied to the analysis of high-dimensional data, and the Dirichlet process Mixture model was used to cluster high-dimensional data. The regression analysis of high-dimensional data was carried out through the prediction model of nonparametric Bayesian regression. In this paper, the nonparametric Bayesian method based on Bayesian sparse linear model was used for feature selection of high-dimensional data. In order to determine the superiority of nonparametric Bayesian methods in high-dimensional data analysis, this paper conducted experiments on nonparametric Bayesian methods and traditional parametric methods in high-dimensional data analysis from five aspects of cluster analysis, classification analysis, regression analysis, feature selection and anomaly detection, and evaluated them through multiple indicators. This article explored the application of non parametric Bayesian methods in high-dimensional data analysis from these aspects through simulation experiments. The experimental results show that the clustering accuracy of the non parametric Bayesian clustering algorithm was 0.93, and the accuracy of the non parametric Bayesian classification algorithm was between 0.93 and 0.99; the coefficient of determination of nonparametric Bayesian regression algorithm was 0.98; the F1 values of non parametric Bayesian methods in anomaly detection ranged from 0.86 to 0.91, which was superior to traditional methods. Non parametric Bayesian methods have broad application prospects in high-dimensional data analysis, and can be applied in multiple fields such as clustering, classification, regression, etc. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low accuracy of time dimension feature extraction and classification of high-dimensional large data streams, this paper proposes a time dimension feature extraction and classification algorithm of high-dimensional large data streams based on unsupervised learning. Analyze the trend of high-dimensional data flow changes under machine learning, and achieve dimensionality reduction of high-dimensional large traffic time dimensional data through local save projection. Analyze the spatial relationship between feature attributes and feature space, segment and fit high-dimensional big data streams and time dimensional feature data streams, further segment time dimensional sequences using sliding windows, and complete feature extraction through discrete dyadic wavelet transform. According to the clustering algorithm, cluster the time dimension feature data stream, calculate the cosine similarity of the feature data, model the time dimension feature stream of training samples, use the feature classification function to minimize the classification loss, and use unsupervised learning to achieve the final classification task. The test results show that this method can improve the temporal feature extraction and classification accuracy streams. [ABSTRACT FROM AUTHOR]

Classifying acoustic responses captured through earphones offers valuable insights into nearby environments, such as whether the earphones are in or out of the ear. However, the performances of classification algorithms often suffer when applied to other devices due to domain mismatches. This study proposes a domain-adaptation method tailored for acoustic-response data from two distinct insert earphone models. The method trains a domain-adaptation function using a pair of datasets obtained from a set of acoustic loads, yielding a domain-adapted dataset suitable for training classification algorithms in a target domain. The effectiveness of this approach is validated through assessments of domain adaptation quality and resulting performance enhancements in the classification algorithm tasked with discerning whether an earphone is positioned inside or outside the ear. Importantly, our method requires significantly fewer measurements than the original dataset, reducing data collection time while providing a suitable training dataset for the target domain. Additionally, the method's reusability across future devices streamlines data collection time and efforts for the future devices. [ABSTRACT FROM AUTHOR]

Food security of the Indian population depends upon the agriculture. The annual crop loss due to the pestsand diseases is a severe problem which is addressed by the researcher time and again Paddy is one of the common crops found in most of the agriculture areas in India. Paddy plants exhibit health condition mainly in stem and leaf. Farmers are still using the traditional method and experts suggestions in identifying the diseases. Research in disease identification and classification process is going on for the past three decades but its automation is still an open challenge. Image segmentation based computer vision techniques, supervised and unsupervised classification algorithms of machine learning are widely used in the analysis of vegetation health analysis. Pattern recognition is playing a major role in identifying the features causing the diseases. The focus of the work is on investigating the performance of various segmentation techniques with support vector machine and K-Neural Network classification algorithms using statistical features. The hybrid IP-PR (Image Processing-Pattern Recognition)techniques are used for paddy disease classification. The performance of the classification algorithm is primarily depending upon the intelligence of the segmentation techniques. The properly segmented outputs give a better accuracy. [ABSTRACT FROM AUTHOR]

The k-nearest neighbors (k-NN) algorithm, a fundamental machine learning technique, typically employs the Euclidean distance metric for proximity-based data classification. This research focuses on the feature importance infused k-NN model, an advanced form of k-NN. Diverging from traditional algorithm uniform weighted Euclidean distance, feature importance infused k-NN introduces a specialized distance weighting system. This system emphasizes critical features while reducing the impact of lesser ones, thereby enhancing classification accuracy. Empirical studies indicate a 1.7% average accuracy improvement with proposed model over conventional model, attributed to its effective handling of feature importance in distance calculations. Notably, a significant positive correlation was observed between the disparity in feature importance levels and the model's accuracy, highlighting proposed model's proficiency in handling variables with limited explanatory power. These findings suggest proposed model's potential and open avenues for future research, particularly in refining its feature importance weighting mechanism, broadening dataset applicability, and examining its compatibility with different distance metrics. [ABSTRACT FROM AUTHOR]

Virtual machine (VM) consolidation and migration that only consider current workload can result in excessive unnecessary migrations. To address this issue, a VM consolidation algorithm based on resource utilization prediction is proposed. An improved K-nearest neighbor (KNN) classification algorithm weighted by attribute inconsistency is proposed to predict the workload of both the host and the VMs. Firstly, two distributions are partitioned according to the neighboring relationship for comparing consistency. Then, an inconsistency evaluation function based on earth mover's distance (EMD) is designed to measure the inconsistency between the neighboring sample set of each sample under each attribute and the equivalent partition refined by the decision attribute. Finally, the inconsistency level of the neighboring samples is transformed into the importance of the corresponding attribute to implement the attribute weighting KNN classifier. When selecting the source host and target host for VM migration, both current and predicted overloads are considered to avoid unnecessary VM migrations. Simulation tests were performed with random and realistic workloads, and the results show that the proposed method can reduce the overall energy consumption of the host, while also reducing service level agreement (SLA) violations and VM migration. [ABSTRACT FROM AUTHOR]

Mild cognitive impairment (MCI) is a syndrome that occurs in the preclinical stage of Alzheimer's disease (AD) and is also an early signal of the onset of AD. Early detection and accurate differentiation between MCI and AD populations, and providing them with effective intervention and treatment, are of great significance for preventing or delaying the onset of AD. In this paper, we propose a deep learning model, SE-DenseNet, that combines channel attention and dense connectivity networks and apply it to the field of magnetic resonance imaging (MRI) data recognition for the diagnosis of AD and MCI. First, to extract MRI features with high quality, a slicing algorithm based on two-dimensional image information entropy is proposed to obtain AD brain lesion features with stronger representation ability. Second, in terms of model structure, SENet is introduced as a channel attention module and redistribute the weight of image features in the channel dimension; use DenseNet as the main architecture to maximize information flow, and each layer is directly interconnected with subsequent layers. It enables the network to learn and extract relevant features from the input data and improve the classification ability of the network. Finally, our proposed model is validated on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset, the results have shown that the accuracy for the four classification tasks of AD-NC, AD-MCI, NC-MCI, and AD-NC-MCI can reach 98.12%, 97.42%, 97.42%, and 95.24%, respectively. At the same time, the sensitivity and specificity have also achieved satisfactory results, exhibited a high performance in comparison with the classic machine learning algorithm and several existing state-of-the-art deep learning methods, demonstrating the proposed method is a powerful tool for the early diagnosis and detection of AD. [ABSTRACT FROM AUTHOR]