The strategy of any organization is based on the growth of its customer base, and one of 6 its principles is that selling a product to an existing customer is much more profitable than acquiring 7 a new customer. However, this approach has several opportunities for improvement, since it usu- 8 ally has a totally reactive approach, which does not give opportunity to the areas specialized in 9 customer experience and recovery, to give an effective response for that moment, since the customer 10 is gone at the time of the intervention. This happens because usually a diagnostic analysis of cus- 11 tomers who have stopped buying products or services in a defined period, commonly three (3) pe- 12 riods or months, is performed. This paper challenges the way to face this problem, and proposes 13 the development of a complete solution, which does not focus exclusively on the prediction of 14 churn, as is usually done in the state of the art research, but to intervene in different interactions 15 that can be carried out with customers. The above focused not only to prevent customer churn, but 16 to generate an added value of continuous improvement in sales processes, increase customer pene- 17 tration, leading to an improvement in customer experience and consequently, an increase in cus- 18 tomer loyalty.

Hyperspectral image (HSI) classification is a mechanism of analyzing differentiated land cover in remotely sensed hyperspectral images. In the last two decades, a number of different types of classification algorithms have been proposed for classifying hyperspectral data. These algorithms include supervised as well as unsupervised methods. Each of these algorithms has its own limitations. In this research, three different types of unsupervised classification methods are used to classify different datasets i-e Pavia Center, Pavia University, Cuprite, Moffett Field. The main objective is to assess the performance of all three classifiers K-Means, Spectral Matching, and Abundance Mapping, and observing their applicability on different datasets. This research also includes spectral feature extraction for hyperspectral datasets.

The visualization of hyperspectral images in display devices, having RGB colour composition channels is quite difficult due to the high dimensionality of these images. Thus, principal component analysis has been used as a dimensionality reduction algorithm to reduce information loss, by creating uncorrelated features. To classify regions in the hyperspectral images, K-means clustering has been used to form clusters/regions. These two algorithms have been implemented on the three datasets imaged by AVIRIS and ROSIS sensors.

The spectrums of one type of object under different conditions have the same features (up, down, protruding, concave) at the same spectral positions, which can be used as primary parameters to evaluate the difference among remotely sensed pixels. Wavelet-feature correlation ratio Markov clustering algorithm (WFCRMCA) for the remotely sensed data is proposed based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying a wavelet transform to spectral data. The correlation ratio between two samples is a statistical calculation of the matched peak point positions on the wavelet feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding the computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. Markov clustering applies several strategies, such as a simulated annealing method and gradually shrinking the clustering size, to control the clustering convergence. At each clustering tempera-ture, it can obtain the best class centers quickly. The experimental results of the Airborne Visible/ Infrared Imaging Spectrometer (AVIRIS) and Thermal Mapping (TM) data have verified its ac-ceptable clustering accuracy and high convergence velocity.

This paper presents an unsupervised feature selection method for multi-dimensional histogram-valued data. We define a multi-role measure, called the compactness, based on the concept size of given objects and/or clusters described by a fixed number of equal probability bin-rectangles. In each step of clustering, we agglomerate objects and/or clusters so as to minimize the compactness for the generated cluster. This means that the compactness plays the role of a similarity measure between objects and/or clusters to be merged. To minimize the compactness is equivalent to maximize the dis-similarity of the generated cluster, i.e., concept, against the whole concept in each step. In this sense, the compactness plays the role of cluster quality. We also show that the average compactness of each feature with respect to objects and/or clusters in several clustering steps is useful as feature effectiveness criterion. Features having small average compactness are mutually covariate, and are able to detect geometrically thin structure embedded in the given multi-dimensional histogram-valued data. We obtain thorough understandings of the given data by the visualization using dendrograms and scatter diagrams with respect to the selected informative features. We illustrate the effectiveness of the proposed method by using an artificial data set and real histogram-valued data sets.

In manufacturing chatter is an unwanted phenomenon that can lead to product quality reduction and tool wear. Real time chatter detection is key to preventing these issues and improving overall machining efficiency. In this paper we propose an unsupervised chatter detection method using autoencoders (AE) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) clustering algorithm that uses internal signals of Computer Numerical Control (CNC) machines. The proposed method starts by using an AE to extract features from raw internal signals collected from CNC machines. This step reduces the dimensionality of the data and captures the underlying patterns of chatter. Then the extracted features are fed into DBSCAN clustering algorithm which is a density based algorithm that groups similar data points and identifies outliers. We tested the proposed method with real world data collected from various CNC machines. The results show that our unsupervised chatter detection method has high accuracy, precision and recall, can detect chatter and distinguish it from normal machining. Also the method is robust to noise and can adapt to dynamic machining conditions. In summary our work presents an unsupervised chatter detection method using AE and DBSCAN clustering that uses internal signals of CNC machines. This method is a reliable and efficient solution for real time chatter detection so manufacturers can improve product quality, optimize machining process and reduce tool wear during machining.

Characterization of flying insects in-situ measurement using remote sensing spectroscopy is an emerging research field. Also, most analysis techniques in remote sensing spectroscopy are based on the use of an intensity threshold which introduces indeterminacies in the number of detected specimens. In this manuscript, we investigated the possibility of analysing passive remote sensing spectroscopy measurement data using the maximum noise fraction method. The results obtained show that this analysis technique can help to overcome the measurement of background noise in spectroscopic measurements.

The task of unsupervised anomalous sound detection (ASD) is challenging for detecting anomalous sounds from a large audio database without any annotated anomalous training data. Many unsupervised methods were proposed, but previous works have confirmed that the classification-based models far exceeds the unsupervised models in ASD. In this paper, we adopt two classification-based anomaly detection models: (1) Outlier classifier is to distinguish anomalous sounds or outliers from the normal; (2) ID classifier identifies anomalies using both the confidence of classification and the similarity of hidden embeddings. We conduct experiments in task 2 of DCASE 2020 challenge, and our ensemble method achieves an averaged area under the curve (AUC) of 95.82% and averaged partial AUC (pAUC) of 92.32%, which outperforms the state-of-the-art models.

Recent neuroscience research results show that the nerve information in the brain is not only encoded by the spatial information. Spiking neural network based on pulse frequency coding plays a very important role in dealing with the problem of brain signal, especially complicated space-time information. In this paper, an unsupervised learning algorithm for bilayer feedforward spiking neural networks based on spike-timing dependent plasticity (STDP) competitiveness is proposed and applied to SAR image classification on MSTAR for the first time. The SNN learns autonomously from the input value without any labeled signal and the overall classification accuracy of SAR targets reached 80.8%. The experimental results show that the algorithm adopts the synaptic neurons and network structure with stronger biological rationality, and has the ability to classify targets on SAR image. Meanwhile, the feature map extraction ability of neurons is visualized by the generative property of SNN, which is a beneficial attempt to apply the brain-like neural network into SAR image interpretation.

Stunting is a major public health issue in Aceh, Indonesia, requiring advanced analytical techniques for effective interventions. This study presents a novel hybrid machine learning framework designed to enhance the analysis of stunting through improved classification, predic-tive modeling, and clustering optimization. The framework utilizes Support Vector Machines (SVM) with Radial Basis Function (RBF) and Sigmoid kernels for classification. The RBF kernel achieved an accuracy of 91.3%, significantly outperforming the Sigmoid kernel's 85.6%. Linear Regression was employed for predictive modeling, yielding a Mean Squared Error (MSE) of 0.137, which indicates strong predictive accuracy. In clustering, the optimized K-Medoids method, in-corporating a weight product approach, demonstrated superior efficiency by requiring only 3 iterations for convergence, compared to 7 iterations for the conventional K-Medoids method. Additionally, it achieved a higher Calinski Harabasz Index of 93.7, compared to 85.2 for the conventional method. This comprehensive approach enhances accuracy and efficiency across classification, prediction, and clustering tasks, providing valuable insights for targeted interventions and policy development to address stunting in Aceh.

We propose a novel unsupervised semantic segmentation method for fast and accurate flood area detection utilizing color images acquired from Unmanned Aerial Vehicles (UAVs). To the best of our knowledge, this is the first fully unsupervised method for flood area segmentation in color images captured by UAVs, without the need of pre-disaster images. The proposed framework addresses the problem of flood segmentation based on parameter-free calculated masks and unsupervised image analysis techniques. First, a fully unsupervised algorithm gradually excludes areas classified as non-flood utilizing calculated masks over each component of the LAB colorspace, as well an RGB vegetation index and the detected edges of the original image. Unsupervised image analysis techniques, such as distance transform, are then applied, producing a probability map for the location of flooded areas. Finally, flood detection is obtained by applying the hysteresis thresholding segmentation. The proposed method is tested and compared with variations, and other supervised methods in two public datasets, consisting of 953 color images in total, yielding high-performance results, with 87.4% and 80.9% overall accuracy and F1-Score, respectively. The results and computational efficiency of the proposed method show that it is suitable for on board data execution and decision-making during UAVs flight.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

The large quantity of information retrieved from communities, public data repositories, web pages, or data mining can be sparsed and poorly classified. This work shows how to employ unsupervised classification algorithms such as K-means proper to classify user reviews into their closest category, forming a balanced data set. Moreover, we found that the text vectorization technique significantly impacts the clustering formation, comparing TF-IDF and Word2Vec. The value for mapping a cluster with movie genre was 81.34% ± 20.48 of the cases when the TF-IDF was applied, whereas Word2Vec only yielded a 53.51% ± 24.1. In addition, we highlight the impact of the removal of stop-words. Thus, we detected that pre-compiled lists are not the best method to remove stop-words before clustering because there is much ambiguity, centroids are poorly separated, and only 57% of clusters could match a movie genre. Thus, our proposed approach achieved a 94% of accuracy. After analyzing the classifiers’ results, we appreciated a similar effect when divided by the stop-words method removal. Statistically significant changes were observed, especially in precision metric and Jaccard scores in both classifiers, using custom-generated stop lists rather than pre-compiled ones. Reclassifying sparse data is strongly recommended as using custom-generated stop lists.

Accurate cloud quantification is essential in climate change research. In this work, we construct an automated computer vision framework by synergistically incorporating deep neural networks and finite sector clustering to achieve robust whole sky image-based cloud classification, adaptive segmentation, and recognition under intricate illumination dynamics. A bespoke YOLOv8 architecture attains over 95% categorical precision across four archetypal cloud varieties curated from extensive annual observations (2020) at a Tibetan highland station. Tailor-made segmentation strategies adapted to distinct cloud configurations, allied with illumination-invariant image enhancement algorithms, effectively eliminate solar interference and substantially boost quantitative performance even in illumination-adverse analysis scenarios. Compared with the traditional threshold analysis method, the cloud quantification accuracy calculated within the framework of this paper is significantly improved. Collectively, the methodological innovations provide an advanced solution to markedly escalate cloud quantification precision levels imperative for climate change research, while offering a paradigm for cloud analytics transferable to various meteorological stations.

In this paper, we present the results of the research concerning extraction of informative gene expression profiles from high-dimensional array of gene expressions considering the state of patients' health using clustering method, ensemble of binary classifiers and fuzzy inference system. Applying of the proposed stepwise procedure can allow us to extract the most informative genes taking into account both the subtypes of disease or state of the patient's health for further reconstruction of gene regulatory networks based on the allocated genes and following simulation of the reconstructed models. We used the publicly available gene expressions data as the experimental ones which were obtained using DNA microarray experiments and contained two types of patients' gene expression profiles: the patients with lung cancer tumor and healthy patients. The stepwise procedure of the data processing assumes the following steps: in beginning, we reduce the number of genes by removing non-informative genes in terms of statistical criteria and Shannon entropy; then, we perform the stepwise hierarchical clustering of gene expression profiles at hierarchical levels from 1 to 10 using SOTA clustering algorithm with correlation distance metric. The quality of the obtained clustering was evaluated using complex clustering quality criterion which is considered both the gene expression profiles distribution relative to center of the clusters were these gene expression profiles are allocated and the centers of the clusters distribution. The result of this stage execution was selection of the optimal cluster at each of the hierarchical levels which corresponded to minimum value of the quality criterion. At the next step, we have implemented classification procedure of the examined objects using four well known binary classifiers: logistic regression, support-vector machine, decision trees and random forest classifier. The effectiveness of the appropriate technique was evaluated based on the use of ROC analysis using criteria included as the components the errors of both the first and the second kinds. The final decision concerning extraction of the most informative subset of gene expression profiles was taken based on the use of fuzzy inference system, the inputs of which are the results of the appropriate single classifiers operation and output is the final solution concerning state of the patient's health. To our mind, the implementation of the proposed stepwise procedure of the informative gene expression profiles extraction create the conditions for increasing effectiveness of the further procedure of gene regulatory networks reconstruction and the following simulation of the reconstructed models considering the subtypes of the disease and/or state of the patient’s health.

The increasing number of people living with Long COVID requires the development of more personalized care, as for now limited treatment options and rehabilitation programs adapted to the variety of Long COVID presentations are available. Our objective was to design an easy-to-use Long COVID classification to help stratifying people with Long COVID. Individual characteristics and a detailed set of 62 self-reported persisting symptoms together with quality of life indexes 12 months after initial COVID-19 infection were collected in a cohort of SARS-CoV-2 infected people in Luxembourg. A hierarchical ascendant classification (HAC) was used to identify clusters of people. We identified 3 patterns of Long COVID symptoms with a gradient in disease severity. Cluster-Mild encompassed almost 50% of the study population and was composed of participants with less severe initial infection, fewer comorbidities, and fewer persisting symptoms (mean=2.9). Cluster-Moderate was characterized by a mean of 11 persisting symptoms and a poor sleep and respiratory quality of life. Cluster-Severe was characterized by a higher proportion of women and smokers as in the other clusters, with a higher number of Long COVID symptoms, in particular of vascular, urinary, and skin symptoms. Our study evidenced that Long COVID can be stratified in 3 sub-categories in terms of severity. If replicated in other populations, this simple classification will help clinicians to personalize the care of people with Long COVID.

Attribute reduction is a core technique in the rough set domain and an important step in data preprocessing. Researchers have proposed numerous innovative methods to enhance the capability of attribute reduction, such as the emergence of multi-granularity rough set models, which can effectively process distributed and multi-granularity data. However, these innovative methods still have many shortcomings, such as how to deal with complex constraints and how to perform multi-angle effectiveness evaluations. Based on the multi-granularity model, this study proposes a new method of attribute reduction, namely using multi-granularity neighborhood information gain ratio as the measurement criterion. This method combines both supervised and unsupervised perspectives, and by integrating multi-granularity technology with neighborhood rough set theory, constructs a model that can adapt to multi-level data features. This model can select the optimal granularity level or attribute set according to the requirements. Finally, the proposed method is experimented with on 15 UCI datasets against six other attribute reduction algorithms. The experimental outcomes, upon analysis and comparative review, substantiate the reliability and consistency of the attribute reduction approach introduced in this study.

The determination and classification of seafloor sediment types are crucial for the exploitation of marine resources, construction of marine engineering, and maintenance of marine ecological en-vironments. Automatic classification of seafloor sediment based on acoustic telemetry data is an important method to quickly understand the type of a large range of sediment. Currently, most studies on sediment classification are based on multi-beam backscattering intensity data, which is a relatively single data type. Besides, the low-dimensional details of standard U-Net gradually weaken in the propagation process, limiting the accuracy of sediment classification. Therefore, this study proposes an automatic classification method of seafloor sediment types based on an im-proved U-Net and K-means clustering algorithm, using multi-beam water depth, sub-bottom profile, and sample test data in the Northern Slope of the South China Sea. Six sediment types, including gravelly muddy sand, sand, silty sand, less muddy silt, muddy silt, and silty mud, were identified in the study area. Additionally, the study area was divided into four sedimentary en-vironment zones, including the shelf sedimentary area, the upper shelf slope break sedimentary area, the lower shelf slope break mixed sedimentary area, and the slope deposition area, based on the results of sediment classification and geological background. The sedimentary environment zones were found to be distributed along the trend of the shelf slope break line. The results of this study not only provide an important supplement to the existing classification methods of seafloor sediments but also contribute to the understanding of the sedimentary environment and process of the Northern Slope of the South China Sea.

Feature selection is a crucial step to overcome the curse of dimensionality problem in data mining. This work proposes Recursive k-means Silhouette Elimination (RkSE) as a new unsupervised feature selection algorithm to reduce dimensionality in univariate and multivariate time-series datasets. Where k-means clustering is applied recursively to select the cluster representative features, following a unique application of silhouette measure for each cluster and a user-defined threshold as the feature selection or elimination criteria. The proposed method is evaluated on a hydraulic test rig, multi sensor readings in two different fashions: (1) Reduce the dimensionality in a multivariate classification problem using various classifiers of different functionalities. (2) Classification of univariate data in a sliding window scenario, where RkSE is used as a window compression method, to reduce the window dimensionality by selecting the best time points in a sliding window. Moreover, the results are validated using 10-fold cross validation technique. As well as, compared to the results when the classification is pulled directly with no feature selection applied. Additionally, a new taxonomy for k-means based feature selection methods is proposed. The experimental results and observations in the two comprehensive experiments demonstrated in this work reveal the capabilities and accuracy of the proposed method.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

Hyper-spectral images contain a wide range of bands or wavelength due to which they are rich in information. These images are taken by specialized sensors and then investigated through various supervised or unsupervised learning algorithms. Data that is acquired by hyperspectral image contain plenty of information hence it can be used in applications where materials can be analyzed keenly, even the smallest difference can be detected on the basis of spectral signature i.e. remote sensing applications. In order to retrieve information about the concerned area, the image has to be grouped in different segments and can be analyzed conveniently. In this way, only concerned portions of the image can be studied that have relevant information and the rest that do not have any information can be discarded. Image segmentation can be done to assort all pixels in groups. Many methods can be used for this purpose but in this paper, we discussed k means clustering to assort data in AVIRIS cuprite, AVIRIS Muffet and Rosis Pavia in order to calculate the number of regions in each image and retrieved information of 1st, 10th and100th band. Clustering has been done easily and efficiently as k means algorithm is the easiest approach to retrieve information.

In this work, we explore the ability to dynamically group the Wind Turbine (WT) of a Wind Farm (WF) based on the behaviour of some of their Supervisory Control And Data Acquisition (SCADA) signals to detect the turbines that exhibit abnormal behaviour. We centre this study on a small WF of five WTs. We use the fact that the same signals from different turbines in the same WF coherently evolve temporally in a time domain, describing very similar waveforms. In this contribution, we use averaged signals from the SCADA system and omit maximums, minimums and standard deviations, focusing mainly on velocities and other slowly varying signals. For the temporal analysis, sliding windows of different temporal durations and overlapings are explored. The capability to automatically identify WTs whose signals differ from the group’s behaviour can alert and program preventive maintenance operations on such WTs before a major breakdown occurs.

With the significant annual increase in the market demand for biopesticides, the industrial production demand for predatory mites, which hold the largest market share among biopesticides, has also been rising.To achieve efficient and low energy consumption control of predatory mite breeding environmental parameters, accurate estimation of breeding environmental parameters is necessary. This paper collects and pre-processing hourly time-series data of temperature and humidity from industrial breeding environments. Time series prediction models such as SVR, LSTM, GRU, and LSTNet are applied to model and predict historical data of the breeding environment. Experiments validate that the LSTNet model is more suitable for such environmental modeling. To further improve prediction accuracy, the training data for the LSTNet model is enhanced using hierarchical clustering of time-series features. After augmentation, the root mean square error (RMSE) of temperature prediction decreased by 27.3%, and the RMSE of humidity prediction decreased by 32.8%, significantly improving the accuracy of multi-step predictions and providing substantial industrial application value.

Multimodal remote sensing data classification can enhance the model’s ability to distinguish land features through multimodal data fusion. In this context, how to help models understand the relationship between multimodal data and target tasks is the focus of researchers. Inspired by human feedback learning mechanisms, causal reasoning mechanisms, and knowledge induction mechanisms, this paper integrates causal learning, reinforcement learning, and meta learning into a unified remote sensing data classification framework and proposed the causal meta-reinforcement learning (CMRL). First, based on feedback learning mechanisms, we have overcome the limitations of traditional implicit optimization of fusion features and customized a reinforcement learning environment for multimodal remote sensing data classification tasks. Through feedback interactive learning between agents and the environment, we help them understand the complex relationships between multimodal data and labels, thereby achieving full mining of multimodal complementary information. Second, based on the causal inference mechanism we designed causal distribution prediction action, classification reward, and causal intervention reward, capturing pure causal factors in multimodal data and cutting off false statistical associations between non-causal factors and class labels. Finally, based on the knowledge induction mechanism, we designed a bi-layer optimization mechanism based on meta-learning. By constructing a meta training task and meta validation task simulation model in the generalization scenario of unseen data, we helped the model induce cross-task shared knowledge, thereby improving its generalization ability for unseen multimodal data. The experimental results on multiple sets of multimodal datasets show that the proposed method achieved state-of-the-art performance in multimodal remote sensing data classification tasks.

The National Institute of Health Stroke Scale (NIHSS) is used worldwide to classify stroke severity as ‘mild’, ‘moderate’ or ‘severe’ based on neurological impairment. Yet stroke survivors argue that the classification of ‘mild’ does not represent the holistic experience and impact of stroke on their daily lives. In this observational cohort study, we aimed to identify different types of impairment among stroke survivors classified as mild. We used mild stroke survivors’ data from the START longitudinal stroke cohort (n=73) with measures related to sensorimotor, cognition, depression, functional disability, physical activity, work and social adjustment over 12 months. Given the multi-source, multi-granular and unlabelled nature of data, we utilised a structure-adapting, unsupervised machine learning approach, the Growing Self-organising Map (GSOM) algorithm to generate distinct clinical profiles. These diverse impairment profiles revealed that mild stroke survivors experience varying degrees of impairment and impact (cognitive, depression, physical activity, work/social adjustment) at different time points, despite the uniformity implied by their NIHSS-classified ‘mild’ stroke. This emphasises the necessity of creating a holistic and comprehensive representation of mild stroke survivors’ needs over the first-year post-stroke to improve rehabilitation and post-stroke care.

Unsupervised metric learning has been generally studied as a byproduct of dimensionality reduction or manifold learning techniques. Manifold learning techniques like Diusion maps, Laplacian eigenmaps has a special property that embedded space is Euclidean. Although laplacian eigenmaps can provide us with some (dis)similarity information it does not provide with a metric which can further be used on out-of-sample data. On other hand supervised metric learning technique like ITML which can learn a metric needs labeled data for learning. In this work propose methods for incremental unsupervised metric learning. In rst approach Laplacian eigenmaps is used along with Information Theoretic Metric Learning(ITML) to form an unsupervised metric learning method. We rst project data into a low dimensional manifold using Laplacian eigenmaps, in embedded space we use euclidean distance to get an idea of similarity between points. If euclidean distance between points in embedded space is below a threshold t₁ value we consider them as similar points and if it is greater than a certain threshold t₂ we consider them as dissimilar points. Using this we collect a batch of similar and dissimilar points which are then used as a constraints for ITML algorithm and learn a metric. To prove this concept we have tested our approach on various UCI machine learning datasets. In second approach we propose Incremental Diusion Maps by updating SVD in a batch-wise manner.

Survivability is a critical concern in WSNs, heavily influenced by energy efficiency. Addressing severe energy constraints in WSNs requires solutions that meet application goals while prolonging network life. This paper presents an energy optimization approach (EOAMRCL) for WSNs, integrating the Grey Wolf Optimization (GWO) for enhanced performance. EOAMRCL aims to enhance energy efficiency by selecting the optimal duty-cycle schedule, transmission power, and routing paths. The proposed approach employs a centralized strategy using a hierarchical network architecture. During the cluster formation phase, an objective function, augmented with GWO, determines the ideal cluster heads (CHs). The routing protocol then selects routes with minimal energy consumption for data transmission to CHs, using transmission power as a metric. In the transmission phase, the MAC layer forms a duty-cycle schedule based on cross-layer routing information, enabling nodes to switch between active and sleep modes according to their network allocation vectors (NAV). This process is further optimized by an enhanced CSMA/CA mechanism, which incorporates sleep/activate modes and pairing nodes to alternate between active and sleep states. This integration reduces collisions, improves channel assessment accuracy, and lowers energy consumption, thereby enhancing overall network performance. EOAMRCL was evaluated in a MATLAB environment, demonstrating superior performance compared to EEUC, DWEHC, and CGA-GWO protocols, particularly in terms of network lifetime and energy consumption. This highlights the effectiveness of integrating GWO and the updated CSMA/CA mechanism in achieving optimal energy efficiency and network performance.

Clustering is a data mining task used for the data extraction from the data bases or files. Clustering is used to find unknown groups present in the data sources like files or data bases. This paper focuses on clustering algorithms performance dependency on the parallel clustering platforms and the clustering algorithms along with their clustering criteria. The problems with the present Traditional clustering algorithms were throughput and data source size changes (scalability). So they can’t address the big data. So for handling the huge volumes of data, parallel clustering algorithms along with clustering criteria were used. For processing the big Data Parallel clustering algorithms are of two types based on computing platforms used. They were the horizontal scaling platforms and vertical scaling platforms.

Against the background of the sky, imaging and perception of aircraft are cru- cial. Among these, the location of aircrafts is not a very difficult problem in general, because that deep learning algorithms and object detection models based on convolutional neural network(CNN) are ever-evolving. In order to have a better identification of various aircrafts, or to accurately locate different types of flying targets in the sky, it becomes significant to distinguish and recognize different types of aircrafts. One question is that, distinguishing and recognizing between sub-categories of aircrafts pose great challenges. Although fine-grained recognition focuses on exploring and studying such problems, aircrafts under different sub-categories and granularities lead us to rethink the application of features. We noticed that features in swin-transformer demonstrates the under- standing and processing of images, fully showcasing the encoding and indexing of information. Through this research and proposed approach, we discovered a better understanding of features encoding and use, which are inspired by the feature encoding and computation in swin-transformer. In our paper, our ap- proach has achieved effects on features encoded graphically, manifested from the architecture design and convolutional neural network computation, and outper- forms other famous fine-graiend classification models on this issue. Not only approach we proposed has demonstrated superior performance in fine-grained aicraft classification, but also the mechanisms of the feature encoding under different sample space partitions is revealed for this issue, which provides a re- search for the representation of aircraft fineness characteristics. The relationship between representation orientation of aircraft feature information under various grained divisions, shows that the recognition of different categories according to man-made, such as aircraft, can be achieved by means of the feature represen- tations studied in this paper, for more specific defined classification tasks and various man-made targets partition criteria, which may influences the princi- ple of design for calculation and feature extraction in fine-grained classification models.

Meta-heuristic algorithms are methods that try to solve problems by imitating events and systems existing in nature. It can be very difficult to solve nonlinear problems with the help of known classical algorithms. In this study, a new meta-heuristic method, the Pi algorithm, is proposed. Pi is a special number that is not periodic and contains many different number combinations in its digits calculated so far. The most important part of meta-heuristic methods is the equations and parameters used to ensure the diversity of the created population. In this study, a specific Pi coefficient for each attribute was calculated with the help of the Monte-Carlo method. These coefficients were used in the Pi algorithm in other parts of the study. In the application for data clustering, experiments were made on 5 different data sets. The best accuracy rate of 95.5% was achieved. In this respect, it has been seen that the Pi algorithm works successfully as a meta-heuristic method. It can be studied on a population-based data clustering, classification, prediction, etc. It can be easily applied in all areas.

Digital twin technology is revolutionizing traditional manufacturing paradigms. In modern manufacturing systems, digital twin technology is fraught with challenges due to the scarcity of labeled data. Specifically, existing supervised machine learning algorithms, with their reliance on voluminous training data, find their applicability constrained in real-world production settings. This paper introduces an unsupervised 3D reconstruction approach tailored for industrial applications, aimed at bridging the data void in creating digital twin models. Our proposed model, by ingesting high-resolution 2D images, autonomously reconstructs precise 3D digital twin models without the need for manual annotations or prior knowledge. Through comparisons with multiple baseline models, we demonstrate the superiority of our method in terms of accuracy, speed, and generalization capabilities. This research not only offers an efficient approach to industrial 3D reconstruction but also paves the way for the widespread adoption of digital twin technology in manufacturing.

Motion related human activity recognition using wearable sensors can potentially enable various useful daily applications. So far, most studies view it as a stand-alone mathematical classification problem without considering the physical nature of human motions. Consequently, they suffer from data dependencies and encounter the dimension disaster problem and the over-fitting issue, and their models are never human-readable. In this study, we start from a deep analysis on natural physical properties of human motions, and then propose a useful feature selection method to quantify each feature's classification contribution capability. On one hand, the "dimension disaster" problem can be avoid to some extent, due to the affined dimension of key features; On the other hand, over-fitting issue can be depressed since the knowledge implied in human motions are nearly invariant, which compensates the possible data inadequacy. The experiment results indicate that the proposed method performs superior to those adopted in related works, such as decision tree, k-NN, SVM, neural networks.

Localizing faults in a software is a tedious process. The manual approach is becoming impractical because of the large size and complexity of contemporary computer systems as well as their logs, which are often the primary source of information about the fault. Log-based Fault Localization (LBFL) is a popular method applied for this purpose. However, in real-world scenarios, this method is vulnerable to a large number of previously unseen log lines. In this paper, we propose a novel method that can guide programmers to the location of a fault by creating a hierarchy of log lines with the highest rank, selected by the traditional LBFL method. We use the intuition that the symptoms of faults are in the context of normal behavior, whereas suspicious log lines grouped together are from new or additional functionalities turned on during faulty execution. To obtain this context, we used unsupervised log sequence segmentation, which has been previously used to segment log sequences into meaningful segments. Experiments on real-life examples show that our method reduces the effort to find the most crucial logs by up to 64% compared to the traditional timestamp approach. We demonstrated that context is highly useful in advancing fault localization, showing the possibility of further speeding up the process.

Immunohistochemistry is a powerful technique, widely used in biomedical research and clinics, that allows to determine the expression levels of some proteins of interest in tissue samples by means of the intensity of color due to the expression of biomarkers using specific antibodies. As such, immunohistochemical images are complex and problematic to be quantified. Recently we proposed a novel method including a first separation stage based on nonnegative matrix factorization (NMF) that achieved good results. However, that method was highly dependent on sparseness and non-negativity parameter choice and on algorithm initialization. Furthermore, the previously proposed method needed a reference image as starting point for the NMF algorithm. In the present work, we propose a new, simpler and robust method for the automated unsupervised scoring of immunohistochemical images based on bright field. Our work is focused on images from tumor tissues marked with blue (nuclei) and brown (protein of interest). The new proposed method represents a simpler approach that, in one side, avoids the use of NMF for the separation stage, and in the other side, circumvents the need for a control image. This new approach determines the subspace spanned by the two colors of interest by means of principal component analysis (PCA) with dimension reduction. This subspace is a two-dimensional space, allowing the finding of color vectors by considering the peaks of density of points. The method also develops a new scoring stage by avoiding, again, reference images, making the procedure more robust and less dependent on the parameters. Experiments for the semi-quantitative scoring of images in five categories exhibit promising and consistent results when compared to manual scoring carried out by experts.

The eyes serve as a window into underlying physical and cognitive processes. Although factors such as pupil size have been studied extensively, a less explored yet potentially informative aspect is blinking. Given its novelty, blink detection techniques are far less available compared to eye-tracking and pupil size estimation tools. In this work, we present a new unsupervised machine learning blink detection strategy using existing eye-tracking technology. The method is compared to two existing techniques. All three algorithms make use of eye aspect ratio values for blink detection. Accurate and rapid blink detection complements existing eye-tracking research and may provide a new informative index of physical and mental status.

Convolutional Neural Networks (CNNs) present drawbacks for modeling geometric transformations, such as scaling and rotation, caused by the convolution operation’s locality. Deformable convolution (DCON), a mechanism that substitutes standard convolution, increasing the receptive field to capture relevant features, is a promising approach to solve this drawback and improve the robustness of CNNs. However, the optimal way to replace the standard convolution with its deformable counterpart in a CNN model is unclear. In this study, we clarify this aseveration by conducting several experiments using deformable convolutions applied in the layers that conform a small four-layer CNN model. We also use deformable convolutions on the four-layers of several ResNet CNNs with depths 18, 34, 50, and 101. The models were tested in binary balanced classes with 2D data for image classification: Cats & Dogs, EyesPACS, Spyders & Chickens, and Shapes. After this testing, we evaluated DCON in 3D data for action recognition: UCF101 and Human2 (a dataset we compiled to control movement, clothing and background). The contribution of this research lies in a guideline to use DCON. It can be summarized as follows: if DCON is used on the first layers of the proposal of model (with simple features), the computational resources expressed as the quantity of Flops will tend to increase and produce bigger misclassification than the standard CNN. However, if the DCON is used at the end layers, the quantity of Flops used in the training and testing will decrease, and the classification accuracy will improve by up to 20% about the base model. Moreover, it gains robustness when using deformable convolutions because it can adapt to the region of interest. Also, the best kernel size of the DCON is three. It showed better results than size five. In the last case, the quantity of Flops increase quadratically, but their performance does not increase significantly. With these results, we propose a guideline to use the DCON and contribute to understanding the impact of DCON on the robustness of CNNs.

Major (exo)planetary and satellite bodies seem to concentrate at intermediate areas of the radial 1 distributions of all the objects orbiting in each (sub)system. We show that angular-momentum transport during secular evolution of (exo)planets and satellites necessarily results in the observed intermediate accumulation of the massive objects. We quantify the ‘middle’ as the mean of mean motions (orbital angular velocities) when three or more massive objects are involved. Radial evolution of the orbits is expected to be halted when the survivors settle near mean-motion resonances and angular-momentum transfer between them ceases (gravitational Landau damping). This dynamical behavior is opposite in direction to what has been theorized for viscous and magnetized accretion disks, in which gas spreads out and away from either side of any conceivable intermediate area. We present angular momentum transfer simulations in few-body systems, and we calculate the tidal dissipation timescales and the physical properties of the mean tidal field in planetary and satellite (sub)systems.

Cloud-induced atmospheric extinction and occlusion have a major effect on the effectiveness and quality of telescope observations. Real-time cloud cover distribution and long-term statistical data are essential for astronomical siting and telescope operations. At ground-based astronomical telescope sites, cloud cover distribution is currently analyzed using manual observation methods. However, the main disadvantages of manual observation methods are human subjective, heavy workloads and poor real-time performance. Therefore, a real-time automatic cloud images classification method is desperately needed. This paper presents a new cloud identification method, which is named PSO+XGBoost model by combining eXtreme Gradient Boosting (XGBoost) and Particle Swarm Optimization (PSO). The entire cloud image is divided into 37 sub-regions in order to more precisely identify the distribution of the clouds. 19 features are then extracted, including the sky background, star density, lighting conditions, and subregion grayscale values. The experimental results have shown that the overall classification accuracy of 96.91% and our model is able to outperform several state-of-the-art baseline methods. Our approach achieves high accuracy in comparison with the manual observation methods. Moreover, this method meets telescope real-time scheduling requirements.

This paper introduces a novel framework for zero-shot learning (ZSL), i.e., to recognize new categories that are unseen during training, by distilling knowledge from foundation models. Specifically, we first employ ChatGPT and DALL-E to synthesize reference images of unseen categories from text prompts. Then, the test image is aligned with text and reference images using CLIP and DINO. Finally, the predicted logits are aggregated according to their confidence to produce the final prediction.Experiments are conducted on multiple datasets, including CIFAR-10, CIFAR-100, and TinyImageNet. The results demonstrate that our model can significantly improve classification accuracy compared to previous approaches, achieving AUROC scores above 96\% across all test datasets. Our code is available at https://github.com/1134112149/MICW-ZIC.

Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. A relationship between k-means clustering and NNS regression points is explored with graphics showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS shares with vector quantization is also documented, along with identical outputs for NNS and a k nearest neighbours classification algorithm under a specific NNS setting. Fisher's iris data and artificial data are used. Even though a perfect fit should obviously be reserved for instances of high signal to noise ratios, NNS permits greater flexibility by offering a large spectrum of possible fits from linear to perfect.

Many types of banana (Musa spp.)—one of the most economically important horticultural crops—exist, and their ploidy (diploid, triploid, and tetraploid, usually) and genome types (containing A or/and B genome in most cases) differ. At present, observation and genome type detection are commonly used to identify banana germplasm resources. However, the former is tedious, while the latter cannot distinguish categories below genome types. It is therefore urgent that a simple and effective method for identifying banana germplasm resources is established. We sequenced and analyzed the ribosomal DNA internal transcribed spacer (ITS) sequences of 62 banana germplasm and found that the sequencing peaks, especially the 20 bp region near the 420 bp position (referred to as the “420 bp region”), exhibited relatively recognizable and repeatable polymorphism characteristics. Using the “420 bp region” as a marker, we were able to quickly distinguish bananas belonging to different genome type groups (comprising the AA, AB, AAA, ABB, AAB, ABBB, AAAB, and AAAA groups) or different subgroups in the same genome type group (for example, the Cavendish, Gros Michel, Red, Lakatan, and Ibota Bota subgroups in the AAA group; and the Pisang Raja, Plantain, Pome and Silk subgroups in the AAB group). Moreover, it appeared that Sanger sequencing of ITS could be used for identifying banana hybrid offspring. These results demonstrated that the banana ITS region contains rich genetic information that is useful for genotyping. In general, ITS sequencing simplifies the classification of banana germplasm resources and has potential application in several areas of Musa improvement.

In this paper, we propose an imagined speech-based brain wave pattern recognition using deep learning. Multiple features were extracted concurrently from eight-channel Electroencephalography (EEG) signals. To obtain classifiable EEG data with fewer number of sensors, we placed the EEG sensors on carefully selected spots on the scalp. To decrease the dimensions and complexity of the EEG dataset and to avoid overfitting during the deep learning algorithm, we utilized the wavelet scattering transformation. A low-cost 8-channel EEG headset was used with MATLAB 2023a to acquire the EEG data. The Long-Short Term Memory Recurrent Neural Network (LSTM-RNN) was used to decode the identified EEG signals into four audio commands: Up, Down, Left, and Right. Wavelet scattering transformation was applied to extract the most stable features by passing the EEG dataset through a series of filtration processes. Filtration has been implemented for each individual command in the EEG datasets. The proposed imagined speech-based brain wave pattern recognition approach achieved a 92.50% overall classification accuracy. This accuracy is promising for designing a trustworthy imagined speech-based Brain-Computer Interface (BCI) future real-time systems. For better evaluation of the classification performance, other metrics were considered, and we obtained 92.74%, 92.50% and 92.62% for precision, recall, and F1-score, respectively.

In this paper, we propose an unsupervised blind restoration model for images in hybrid degradation scenes. The proposed model encodes the content information and degradation information of images and then uses the attention module to disentangle the two kinds of information. It can improve the ability of disentangled presentation learning for a generative adversarial network (GAN) to restore the images in hybrid degradation scenes, enhance the detailed features of restored image and remove the artifact combining the adversarial loss, cycle-consistency loss, and perception loss. The experimental results on the DIV2K dataset and medical images show that the proposed method outperforms existing unsupervised image restoration algorithms in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and subjective visual evaluation.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

Gastric cancer is the fifth most common and fourth deadliest cancer worldwide, with a bleak 5-year survival rate of about 20%. Despite significant research into its pathobiology, prognostic predictability remains insufficient due to pathologists’ heavy workloads and the potential for diagnostic errors. Consequently, there is a pressing need for automated and precise histopathological diagnostic tools. This study leverages Machine Learning and Deep Learning techniques to classify histopathological images into healthy and cancerous categories. By utilizing both handcrafted and deep features and shallow learning classifiers on the GasHisSDB dataset, we conduct a comparative analysis to identify the most effective combinations of features and classifiers for differentiating normal from abnormal histopathological images without employing fine-tuning strategies. Our methodology achieves an accuracy of 95% with the SVM classifier, underscoring the effectiveness of feature fusion strategies. Additionally, cross-magnification experiments produced promising results with accuracies close to 80% and 90% when testing the models on unseen testing images with different resolutions.

Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the clustering coefficient for the product graph vertices and the average clustering coefficient for the product graph.

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

One of the most important sources of energy is the sun. Taiwan is located at north 22-25° latitude. Due to its proximity to the equator, it experiences only a small angle of sunlight incidence. Its unique geographical location which can obtain sustainable and stable solar resources. This study takes research on the forecast of solar radiation to maximize the benefits of solar power generation, and develops methods that can predict the future solar radiation pattern to help reduce the costs of solar power generation. This study builds supervised machine learning models, known as deep neural network (DNN) and long short-term memory neural network (LSTM). The hybrid supervised and unsupervised model, namely cluster-based artificial neural network (k-means clustering and fuzzy C-means clustering-based models), was developed. After establishing these models, the study evaluated their prediction results. For different prediction periods, the study selected the best-performing model based on the results and proposed combining them to establish a real-time updated solar radiation forecast system capable of predicting the next 12 hours. The study area covered Kaohsiung, Hualien, and Penghu in Taiwan. Data from ground stations of the Central Weather Administration, collected between 1993 and 2021, as well as the solar angle parameters of each station, were used as input data for the model. The results of this study show that different models have their advantages and disadvantages in predicting different future times. Therefore, the hybrid prediction system can predict future solar radiation more accurately than a single model.

The prediction of system degradation is very important as it serves as an important basis for the formulation of condition-based maintenance strategies. An effective health indicator (HI) plays a key role in the prediction of system degradation as it enables vital information for critical tasks ranging from fault diagnosis to remaining useful life prediction. To address this issue, a method for monitoring data fusion and health indicator construction based on autoencoder (AE) and long short-term memory (LSTM) network is proposed to improve the predictability and effectiveness of health indicator in this study. Firstly, an unsupervised method and overall framework for HI construction is built based on deep autoencoder and LSTM neural network. The neural network is trained fully based on the normal operating monitoring data and then the construction error of the AE model is adopted as the health indicator of the system. Secondly, we propose related machine learning techniques for monitoring data processing to overcome the issue of data fusion, like mutual information for sensor selection and t-distributed stochastic neighbor embedding (T-SNE) for operating condition identification, etc. Thirdly, in order to verify the performance of the proposed method, experiments are conducted based on CMAPSS dataset and results are compared with algorithms of principal component analysis (PCA) and vanilla autoencoder model. Result shows that LSTM-AE model outperforms the PCA and Vanilla-AE model in metrics of monotonicity, trendability, prognosability and fitness. Fourthly, in order to analyze the impact of the time step of the LSMT-AE model on HI construction, we construct and analyze the system HI curve under different time steps of 5, 10, 15, 20, and 25 cycles. Finally, the results demonstrate that the proposed method for HI construction can effectively characterize the health state of system, which is helpful for further failure prognostics and converting the scheduled maintenance into condition-based maintenance.

This research aims to determine the similarities in groups of people to build a film recommender system for users. Users often have difficulty in finding suitable movies due to the increasing amount of movie information. The recommender system is very useful for helping customers choose a preferred movie with the existing features. In this study, the recommender system development is established by using several algorithms to obtain groupings, such as the K-Means algorithm, birch algorithm, mini-batch K-Means algorithm, mean-shift algorithm, affinity propagation algorithm, agglomerative clustering algorithm, and spectral clustering algorithm. We propose methods optimizing K so that each cluster may not significantly increase variance. We are limited to using groupings based on Genre and, Tags for movies. This research can discover better methods for evaluating clustering algorithms. To verify the quality of the recommender system, we adopted the mean square error (MSE), such as the Dunn Matrix and Cluster Validity Indices, and social network analysis (SNA), such as Degree Centrality, Closeness Centrality, and Betweenness Centrality. We also used Average Similarity, Computational Time, Association Rule with Apriori algorithm, and Clustering Performance Evaluation as evaluation measures to compare method performance of recommender systems using Silhouette Coefficient, Calinski-Harabaz Index, and Davies-Bouldin Index.

In this paper, a seamless connection between sensor technology and machine learning (ML) has been presented which has wide applicability in rehabilitation and physical medicine. The intent is to identify an ML algorithm which has a better performance, easy to deploy, and has less training time and consumes less computational resources. In short, we propose an algorithm which maximizes the synergy between a sensor and ML by maximizing classification performance and easy to do implementation, which is robust in computational power and lower in resource consumption. The premise of the work is to show the important considerations for evaluating ML algorithms for Upper-limb activity recognition for Physical medicine and rehabilitation field.

Incorrect sitting posture, characterized by asymmetrical or uneven positioning of the body, often leads to spinal misalignment and muscle tone imbalance. Prolonged maintenance of such postures can adversely impact well-being and contribute to the development of spinal deformities and musculoskeletal disorders. In response, smart-sensing chairs equipped with cutting-edge sensor technologies have been introduced as a viable solution for real-time detection, classification, and monitoring of sitting postures, aiming to mitigate the risk of musculoskeletal disorders and promote overall health. This comprehensive literature review evaluates the current body of research on smart-sensing chairs, with a specific focus on the strategies used for posture detection and classification, as well as the effectiveness of different sensor technologies. A meticulous search across MDPI, IEEE, and Google Scholar databases yielded 34 pertinent studies that utilize non-invasive methods for posture monitoring. The analysis reveals that Force Sensing Resistors (FSR) are the predominant sensors utilized for posture detection, whereas Convolutional Neural Networks (CNN) and Artificial Neural Networks (ANN) are the leading machine learning models for posture classification. However, it was observed that CNNs and ANNs do not outperform traditional statistical models in terms of classification accuracy, due to constrained size and lack of diversity within training datasets. These datasets often fail to comprehensively represent the array of human body shapes and musculoskeletal configurations. Moreover, this review identifies a significant gap in the evaluation of user feedback mechanisms, essential for alerting users to their sitting posture and facilitating corrective adjustments.

The ability to detect the presence as well as classify the activities of individuals behind visually obscuring structures is of significant benefit to police, security and emergency services in many situations. This paper presents the analysis from a series of experimental results generated using a through-the-wall (TTW) Frequency Modulated Continuous Wave (FMCW) C-Band radar system named Soprano. The objective of this analysis was to classify whether an individual was carrying an item in both hands or not using micro-Doppler information from a FMCW sensor. The radar was deployed at a standoff distance, of approximately 0.5 m, outside a residential building and used to detect multiple people walking within a room. Through the application of digital filtering, it was shown that significant suppression of the primary wall reflection is possible, significantly enhancing the target signal to clutter ratio. Singular Value Decomposition (SVD) signal processing techniques were then applied to the micro-Doppler signatures from different individuals. Features from the SVD information have been used to classify whether the person was carrying an item or walking free handed. Excellent performance of the classifier was achieved in this challenging scenario with accuracies up to 94%, suggesting that future through wall radar sensors may have the ability to reliably recognize many different types of activities in TTW scenarios using these techniques.

Hyperspectral images (HSI) contain abundant spectral information. Efficient extraction and utilization of this information for image classification remain prominent research topics. Previously, hyperspectral classification techniques primarily relied on statistical attributes and mathematical models of spectral data. Deep learning classification techniques have recently been extensively utilized for hyperspectral data classification, yielding promising outcomes. This study proposes a deep learning approach that uses polarization feature maps for classification. Initially, the polar coordinate transformation method is employed to convert the spectral information of all pixels in the image into spectral feature maps. Subsequently, the proposed Deep Context Feature Fusion Network (DCFF-NET) is utilized to classify these feature maps. The model is validated using three open-source hyperspectral datasets: Indian Pines, Pavia University, and Salinas. The experimental results indicated that DCFF-NET achieves excellent classification performance. Experimental results on three public HSI datasets demonstrate that the proposed method accurately recognizes different objects with an overall accuracy (OA) of 86.68%, 94.73%, and 95.14% based on the pixel method, and 98.15%, 99.86%, and 99.98% based on the pixel-patch method.

Recently Candida auris has emerged as a multi-resistant fungal pathogen, with a significant clinical impact, and has become a critical issue in WHO fungal priority list, due to its unique ability to persist for long time on human skin and hospital environments. It is therefore fundamental to reinforce hospital surveillance protocols to limit nosocomial outbreaks. The study purpose was the Fourier-Transform Infrared Spectroscopy (FT-IR) application to investigate the phylogenetic relationships between isolated strains within the C. auris outbreak at the university Intensive Care Unit of a Tertiary University hospital in Turin (Italy). In order to calculate a clustering cut-off, intra- and inter-isolates distance values were analysed. Data showed the presence of a major cluster Alfa and a minor cluster Beta with a defined C. auris clustering cut-off. The results were validated by an external C. auris strain and Principal Component and Linear Discriminant Analysis. The application of FT-IR technology had allowed to obtain important information about the phylogenetic relationships between the analysed strains, defining for the first time a “not WGS-based” clustering cut-off with a statistical-mathematical approach. FT-IR could represent a valid alternative to molecular methods for rapid and cost saving typing of C. auris strains with important clinical implications.

Domain generalization has led to remarkable achievements in Hyperspectral Image (HSI) classification. Inspired by contrastive language-image pre-training (CLIP), the language-aware domain generalization method has been explored to learn cross-domain-invariant representation. However, existing methods face some challenges: 1) The weak capacity to extract long-range contextual information and inter-class correlation. 2) Due to the inadequacies of the large-scale pre-training for HSI data, the spatial-spectral features of HSI and linguistic features can not be straightforwardly alignment. To address the above problems, a novel network has been proposed with a CLIP framework, which consists of an image encoder, based on an encoder-only transformer to obtain the global contextual information and inter-class correlation, a frozen text encoder, and a cross-attention mechanism, named Linguistic-Interact-with-Visual Engager (LIVE), enhances the interaction between two modalities. Extensive experiments demonstrating superior performance over state-of-the-art methods in HSI Domain Generalization with a CLIP framework.

Unmanned Aerial Vehicles (UAVs) equipped with hyperspectral imagers have emerged as an essential technology for the characterization of inland water bodies. The high spectral and spatial resolutions of these systems enable the retrieval of a plethora of optically-active water quality parameters via band ratio algorithms and machine learning methods. However, fitting and validating these models requires access to sufficient quantities of in situ reference data which are time-consuming and expensive to obtain. In this study, we demonstrate how the Generative Topographic Mapping (GTM), a Bayesian realization of the Self-organizing Map, can be used to visualize high-dimensional hyperspectral imagery and extract spectral signatures corresponding to unique endmembers present in the water. Using data collected across a North Texas pond, we first apply the GTM to visualize the distribution of captured reflectance spectra revealing small-scale spatial variability of water composition. Next, we demonstrate how the nodes of the fitted GTM can be interpreted as unique spectral endmembers. Using extracted endmembers together with the normalized spectral similarity score, we are able to efficiently map the abundance of near shore algae as well as the evolution of a rhodamine tracer dye used to simulate water contamination by a localized source.

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

Cancer ranks second among the causes of mortality worldwide,following cardiovascular diseases.Brain cancer, in particular, has lowest survival rate of any kind of cancer. Brain tumours vary in their morphology, texture, and location, which determine their classification. Accurate diagnosis of the tumour category enables physicians to select optimal treatment strategies and potentially prolong patients’ lives. Researchers who also implemented deep learning models for diagnosing diseases in recent years largely focused on deep neural network optimization to enhance neural network performance. This implicates implementing models with the best performance and incorporating various network architectures by configuring their hyperparameters. This paper presents a novel hybrid approach method for improved brain tumour classification by combining CNN and EfficientNetV2B3 as feature extraction, followed by (KNN) for classification. To evaluate the recommended method’s efficacy, two widely known benchmark MRI datasets were utilized in the experiments. The initial dataset consisted of 3064 MRI images depicting meningiomas,pituitary,and gliomas tumours.Images from two classes of normal brain and brain tumour were included in the second dataset, which was obtained from Kaggle.In order to enhance performance even more, the study concatenates the CNN and EfficientNetV2B3 flattened outputs before feeding them into the KNN classifier. The proposed framework run on two different dataset and demonstrates outstanding performance with an accuracy of 99.51% and 99.8% on each dataset.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

Currently, maritime traffic is increasing with economic growth in several regions worldwide. However, this growth in maritime traffic has led to increased risk of marine accidents. These accidents have a higher probability of occurring in regions where geographical features, such as islands, are present. Further, the positioning of rescue ships in a particular ocean region with a high level of maritime activity is critical for rescue operations. This paper proposes a method for determining an optimal set of locations for stationing rescue ships in an ocean region with numerous accident sites in the Wando islands of South Korea. The computational challenge in this problem is identified as the positioning of numerous islands of varying sizes located in the region. Thus, the proposed method combines a clustering-based optimization method and an image processing approach that incorporates flood filling to calculate the shortest distance between two points in the ocean that detours around the islands. Experimental results indicate that the proposed method reduces the distance from rescue ships and each accident site by 5.0 km compared to the original rescue ship locations. Thus, rescue time is reduced.

Medical datasets may be imbalanced and contain errors due to subjective test results and clinical variability. The poor quality of original data affects classification accuracy and reliability. Hence, detecting abnormal samples in the dataset can help clinicians make better decisions. In this study, we propose an unsupervised error detection method using patterns discovered by the Pattern Discovery and Disentanglement (PDD) model, developed in our earlier work. Applied to the large data, the eICU Collaborative Research Database for sepsis risk assessment, the proposed algorithm can effectively discover statistically significant association patterns, generate an interpretable knowledge base for interpretability, cluster samples in an unsupervised learning manner, and detect abnormal samples from the dataset. As shown in the experimental result, our method outperformed K-Means by 38% on the full dataset and 47% on the reduced dataset for unsupervised clustering. Multiple supervised classifiers improve accuracy by an average of 4% after removing abnormal samples by the proposed error detection approach. Therefore, the proposed algorithm provides a robust and practical solution for unsupervised clustering and error detection in healthcare data.

The unsupervised domain-adaptive vehicle reidentification approach aims to transfer knowledge from a labeled source domain to an unlabeled target domain, however there are knowledge differences between the target domain and the source domain. To reduce domain differences, existing unsupervised domain-adaptive rerecognition methods generally require access to the source domain data to assist in re-training the target domain model. But for security reasons, in many cases, data between different domains cannot communicate. To this end, this paper proposes an unsupervised domain-adaptive vehicle re-identification method based on source-free knowledge transfer. First, by constructing a passive domain knowledge migration module, the target domain is consistent with the source domain model output to train a generator to generate the "source-like samples". Then, it can effectively reduce the model knowledge difference and improve the model generalization performance. According to the experiment and testing of VeRi776 and VehicleID, two mainstream public data sets in this field, the rank-k and mAP indexes obtained are both improved, and are suitable for object re-recognition tasks without source data.

Hox gene clusters are crucial in Embryogenesis. It was observed that some Hox genes are located in order along the telomeric to centromeric direction of the DNA sequence: Hox1, Hox2, Hox3…. These genes are expressed in the same order in the ontogenetic units of the Drosophila embryo along the Anterior-Posterior axis. The two entities (genome and embryo) differ significantly in linear size and in-between distance. This strange phenomenon was named Spatial Collinearity (SP). Later, it was observed that, particularly in the Vertebrates, a Temporal Collinearity (TC) coexists: first is Hox1 expressed, later Hox2 and even later Hox3,…,. According to a Biophysical Model (BM), pulling forces act at the anterior end of the cluster while a cluster fastening applies at the posterior end. Hox clusters are irreversibly elongated along the force direction. During Evolution, the elongated Hox clusters are broken at variable lengths thus split clusters may be created. An Empirical Rule was formulated distinguishing development due to a complete Hox cluster from development due to split Hox clusters. BM can ‘explain’ this Empirical Rule. In a spontaneous mutation where the cluster fastening is dismantled, a weak pulling force automatically shifts the cluster inside the Hox activation domain. This cluster translocation can probably explain the absence of Temporal Collinearity in Drosophila.

This paper describes a stochastic clustering architecture that is used in the paper for making predictions over energy data. The design is discrete, localised optimisations based on similarity, followed by a global aggregating layer, which can be compared with the recent random neural network designs, for example. The topic relates to the IDEAS Smart Home Energy Project, where a client-side Artificial Intelligence component can predict energy consumption for appliances. The proposed data model is essentially a look-up table of the key energy bands that each appliance would use. Each band represents a level of consumption by the appliance. This table can replace disaggregation from more complicated methods, usually constructed from probability theory, for example. Results show that the table can accurately disaggregate a single source to a set of appliances, because each appliance has quite a unique energy footprint. As part of predicting energy consumption, the model could possibly reduce costs by 50% and more than that if the proposed schedules are also included. The hyper-grid has been changed to consider rows as single units, making it more tractable. A second case study considers wind power patterns, where the grid optimises over the dataset columns in a self-similar way to the rows, allowing for some level of feature analysis.

Sentiment analysis plays a crucial role in understanding customer feedback, guiding product development, and informing business decisions. This paper introduces term sentiment entropy (TSE), a novel weighting method that leverages the distribution of sentiment labels associated with words to enhance text classification accuracy. TSE complements traditional TF-IDF techniques by capturing the nuances of sentiment variation across different contexts. Experiments across diverse public datasets demonstrate TSE's potential to improve sentiment analysis performance, especially in capturing subtle sentiment shifts and adapting to specific domains. While computational cost and label quality pose challenges, TSE offers a promising avenue for refining sentiment analysis and opening new research frontiers.

Abstract This study delved into the application of various machine learning (ML) models for the classification of lung cancer levels. Through meticulous monitoring of parameters such as minimum child weight and learning rate, efforts were made to mitigate overfitting while optimizing model performance. The Deep Neural Network (DNN) emerged as a standout performer, showcasing robust performance across training, validation, and testing stages. Ensemble methods like voting and bagging also demonstrated promising results. However, Support Vector Machine (SVM) models with the Sigmoid kernel faced challenges in achieving satisfactory performance. Overall, the investigation sheds light on the efficacy of different ML models in lung cancer level classification and underscores the importance of parameter tuning to address overfitting concerns.

Highly diverse agroecosystems are increasingly of interest as the realization of farms' invaluable ecosystem services grows. Simultaneously there has been an increased use of uncrewed aerial systems (UAS) in remote sensing as drones offer a finer spatial resolution and faster revisit rate than traditional satellites. With the combined utility of UAS and the attention on agroecosystems, there exists an opportunity to assess UAS practicality in highly biodiverse settings.  In this study, we utilized UAS to collect fine-resolution 10-band multispectral imagery of coffee agroecosystems in Puerto Rico. We created land cover maps through a pixel-based supervised classification of each farm and assembled accuracy assessments for each classification. To bolster our understanding of the classifications, we interviewed farmers to understand their thoughts on how these maps may be best used to support their land management. The average overall accuracy (53.9%), though relatively low, was expected for such a diverse landscape with fine-resolution data. After sharing imagery and land cover classifications with farmers, we found that while the prints were often a point of pride or curiosity for farmers, integrating the maps into farm management was perceived as impractical. These findings highlight that while remote sensing of diverse agroecosystems may provide a detailed way of estimating land cover classes and ecosystem services for researchers and government agencies for example these maps may be of limited use to land managers without additional interpretation.

In order to achieve the elimination of the negative impacts of transport on road safety, the European Union is taking various measures resulting from its commitment to improve road safety. One of the instruments for achieving the objectives set is social legislation for the work of drivers in road freight and passenger transport. In line with the objective of improving the quality of working conditions for road transport drivers and road safety, the European Union applies Regulation (EC) No 561/2006 on the harmonisation of certain social legislation relating to road transport, which lays down rules on driving times, breaks and rest periods for drivers operating in road freight and passenger transport. The main objective of the paper is to assess the impact of social legislation on road transport safety by means of real research and to identify the factors influencing the violation of the legislation depending on the type of transports carried out in domestic or international road freight transport.

The notion of luck clustering has gained traction in recent years due to its potential influence on performance and decision-making across a range of domains. This study concentrates on the application of luck clustering in sports, with an emphasis on its consequences for performance metrics and strategic decision-making. We employ time series analysis to investigate the presence of luck clustering in sports data, such as win-loss records, scoring, and player rankings, while considering the role of the Principle of Luck Conservation in the observed clustering patterns. Our findings provide evidence of luck clustering in sports, implying that periods of high luck tend to be followed by more high luck events, and vice versa for low luck events. These insights carry significant implications for coaches, players, and teams, who can utilize the understanding of luck clustering to develop more effective strategies, manage resources efficiently, and ultimately enhance their performance. By enriching our comprehension of luck's nature and its effects on sports outcomes, this study contributes valuable knowledge for practitioners and researchers in sports analytics and performance management.

Background: Obesity remains a widely debated issue, often criticized for the limitations in its identification and classification. This study aims to compare two distinct systems for classifying obesity: Body Mass Index (BMI) and body fat percentage (BFP) as assessed by bioelectrical impedance analysis (BIA). By examining these measures, the study seeks to clarify how different metrics of body composition influence the identification of obesity-related risk factors. Methods: The study enrolled 1255 adults, comprising 471 males and 784 females, with a mean age of 36 ± 11.90 years. Participants exhibited varying degrees of weight status, including optimal weight, overweight, and obesity. Body composition analysis was conducted using the TANITA Body Composition Analyzer BC-418 MA III device (T5896, Tokyo, Japan), evaluating the following parameters: current weight, basal metabolic rate (BMR), adipose tissue (%), muscle mass (%), and hydration status (%). Results: Age and psychological factors like cravings, fatigue, stress, and compulsive eating were significant predictors of obesity in the BMI model but not in the BFP model. Additionally, having a family history of diabetes was protective in the BMI model (OR: 0.33) but increased risk in the BFP model (OR: 1.66). The BMI model demonstrates exceptional predictive ability (AUC=0.998). In contrast, the BFP model, while still performing well, exhibits a lower AUC (0.975), indicating slightly reduced discriminative power compared to the BMI model. Conclusions:BMI classification demonstrates superior predictive accuracy, specificity, and sensitivity. This suggests that BMI remains a more reliable measure for identifying obesity-related risk factors compared to the BFP model.

Cardiopulmonary resuscitation (CPR) is a widely practiced lifesaving skill. Conventional CPR is based on manual chest compressions and delivering mouth-to-mouth breaths. There has been advancement in biomedical technology over the last few decades which has led to the introduction of new techniques and devices in CPR as well. In light of these advancements, we propose SMEAR (Standard, Mechanical, ECMO Assisted, Augmented virtual and Remote) classification system to provide structured overview from traditional to novel methods and devices. The standard or Manual CPR, widely practiced by the general public during out-of-hospital cardiac arrests, combines active chest compressions with or without mouth breathing. However, to enhance CPR’s efficacy, various mechanical devices have been developed, encompassing Active Chest Compression, Passive Decompression, and those integrated with Automated External Defibrillators. Feedback sensor-equipped devices, include the Metronome, Accelerometer, Barometer, and Triaxial Field Induction. Mechanical devices, classified by their compression mechanisms, can be isolated – like the Piston-driven, Load-distributing, and Active Compression-Decompression (ACD) – or combined, as in ACD-ITV (Impedance Threshold Device), ACD-IAC (Interposed Abdominal Compression), and ACD-ITV-EECP (Enhanced External Counter Pulsation). Beyond mechanics, Extracorporeal CPR offers veno-arterial Extracorporeal Membrane Oxygenation in refractory cardiac arrest and can improve outcomes. Augmented Virtual Reality usage in training and provision of CPR is at the early stages. It has the potential of expanded usage in training public to provide high-quality CPR. A provider can be remotely guided step by step via telephone or smartphone applications, ensuring continuous support until professional assistance arrives.

As the development of low-altitude economies and aerial countermeasures continues, the safety of unmanned aerial vehicles becomes increasingly critical, making the emitter identification in remote sensing practices more essential. Effective recognition of Radio Frequency (RF) signal attributes is a prerequisite for identifying emitters. However, due to the diverse wireless communication environments, RF signals often face challenges from complex and time-varying wireless channel conditions. These challenges lead to difficulties in data collection and annotation, as well as disparities in data distribution across different communication scenarios. To address this issue, this paper proposes a Progressive Maximum Similarity-based Unsupervised Domain Adaptation (PMS-UDA) method for RF signal attribute recognition. Initially, we introduce a noise perturbation consistency optimization method to enhance the robustness of the PMS-UDA method under low signal-to-noise conditions. Subsequently, a progressive label alignment training method is proposed, combining sample-level maximum correlation with distribution-level maximum similarity optimization techniques to enhance the similarity of cross-domain features. Finally, domain adversarial optimization method is employed to extract domain-independent features, reducing the impact of channel scenario. Experimental results demonstrate that the PMS-UDA method achieves superior recognition performance in automatic modulation recognition and RF fingerprint identification tasks, as well as cross both ground-to-ground and air-to-ground scenarios, compared to baseline methods.

With the advent of deep learning, significant progress has been made in low-light image enhancement methods. However, deep learning requires enormous paired training data, which is challenging to capture in real-world scenarios.To address this limitation, this paper presents a novel unsupervised low-light image enhancement method, which first introduces the frequency domain features of images in low-light image enhancement tasks. Our work is inspired by imagining a digital image as a spatially varying metaphoric “field of light”, then subjecting the influence of physical processes such as diffraction and coherent detection back onto the original image space via a frequency-domain to spatial-domain transformation (inverse Fourier transform). However, the mathematical model created by this physical process still requires complex manual tuning of the parameters for different scene conditions to achieve the best adjustment. Therefore, we proposed a dual-branch convolution network to estimate pixel-wise and high-order spatial interactions for dynamic range adjustment of the frequency feature of the given low-light image. Guided by the frequency feature from the “field of light” and parameter estimation networks, our method enables dynamic enhancement of low-light images. Extensive experiments have shown that our method performs well compared to state-of-the-art unsupervised, and its performance approximates the level of the state-of-the-art supervised methods qualitatively and quantitatively. At the same time, the light network structure design allows the proposed method to have an extremely fast inference speed(nearly 150 FPS on an NVIDIA 3090 Ti GPU for an image of size 600×400×3 ). Furthermore, the potential benefits of our method to object detection in the dark are discussed.

Resolving small molecule mixtures by nuclear magnetic resonance (NMR) spectroscopy has been of great interest for a long time for its precision, reproducibility and efficiency. However, spectral analyses for such mixtures are often highly challenging due to overlapping resonance lines and limited chemical shift windows. The existing experimental and theoretical methods to produce shift NMR spectra in dealing with the problem have limited applicability owing to sensitivity issues, inconsistency and / or requirement of prior knowledge. Recently, we have resolved the problem by decoupling multiplet structures in NMR spectra by the wavelet packet transform (WPT) technique. In this work, we developed a scheme for deploying the method in generating highly resolved WPT NMR spectra and predicting the composition of the corresponding molecular mixtures from their 1H NMR spectra in an automated fashion. The four-step spectral analysis scheme consists of calculating WPT spectrum, peak matching with a WPT shift NMR library, followed by two optimization steps in producing the predicted molecular composition of a mixture. The robustness of the method was tested on an augmented dataset of 1000 molecular mixtures, each containing 3 to 7 molecules. The method successfully predicted the constituent molecules with a median true positive rate of 1.0 against the varying compositions, while a median false positive rate of 0.04 was obtained. The approach can be scaled easily for much larger datasets.

A continuous Deep Belief Network (cDBN) with two hidden layers is proposed in this paper, focusing on the problem of weak feature learning ability when dealing with continuous data. In cDBN, the input data is trained in an unsupervised way by using continuous version of transfer functions, the contrastive divergence is designed in hidden layer training process to raise convergence speed, an improved dropout strategy is then implemented in unsupervised training to realize features learning by de-cooperating between the units, and then the network is fine-tuned using back propagation algorithm. Besides, hyper-parameters are analysed through stability analysis to assure the network can find the optimal. Finally, the experiments on Lorenz chaos series, CATS benchmark and other real world like CO2 and waste water parameters forecasting show that cDBN has the advantage of higher accuracy, simpler structure and faster convergence speed than other methods.

In recent years, weeds is responsible for most of the agricultural yield losses. To deal with this threat, farmers resort to spraying pesticides throughout the field. Such method not only requires huge quantities of herbicides but impact environment and humans health. One way to reduce the cost and environmental impact is to allocate the right doses of herbicide at the right place and at the right time (Precision Agriculture). Nowadays, Unmanned Aerial Vehicle (UAV) is becoming an interesting acquisition system for weeds localization and management due to its ability to obtain the images of the entire agricultural field with a very high spatial resolution and at low cost. Despite the important advances in UAV acquisition systems, automatic weeds detection remains a challenging problem because of its strong similarity with the crops. Recently Deep Learning approach has shown impressive results in different complex classification problem. However, this approach needs a certain amount of training data but, creating large agricultural datasets with pixel-level annotations by expert is an extremely time consuming task. In this paper, we propose a novel fully automatic learning method using Convolutional Neuronal Networks (CNNs) with unsupervised training dataset collection for weeds detection from UAV images. The proposed method consists in three main phases. First we automatically detect the crop lines and using them to identify the interline weeds. In the second phase, interline weeds are used to constitute the training dataset. Finally, we performed CNNs on this dataset to build a model able to detect the crop and weeds in the images. The results obtained are comparable to the traditional supervised training data labeling. The accuracy gaps are 1.5% in the spinach field and 6% in the bean field.

A systematic investigation of the dynamic clustering behavior of active particles under confinement, including the effects of both particle density and active driving force is presented based on a hybrid coarse-grained molecular dynamics simulation. First, a series of scaling laws were derived with power relationships for the dynamic clustering time as a function of both particle density and active driving force. Notably, the average number of clusters N ̅ assembled from active particles in the simulation system exhibits a scaling relationship with clustering time t described by N ̅∝t^(-m). Simultaneously, the scaling behavior of the average cluster size S ̅ is characterized by S ̅∝t^m. Our findings reveals the presence of up to four distinct dynamic regions concerning clustering over time, with transitions contingent upon the particle density within the system. Furthermore, as the active driving force increases, the aggregation behavior also accelerates, while an increase in density of active particles induce alterations in the dynamic procession of the system.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

This work is developed over the question ”How to automatically create a good clustering on spatial dataset with high different local densities?” opened by previus work of Berzi [5]. To answer the main question, this work describe a approach of recursive clustering process based on a technique of finding ”vague-solution”, where the output is an hierarchical clustering of initial dataset. In particularly the the approach is developed and tested on DBSCAN algorithm [11] with large dataset gathered by Google Place in Metropolitan Area of Milan. The core solutions developed in this algorithm are condensed in the capacity of generation a Hierarchical Clustering with a recursive select the best solutions in according tothe our goals, previously dfined by some sets of rules. The algorithm described here, and developed in my Master Thesis, rosolve two problem: - When we use an algorithm of clustering that can create a set of differents clustering, but equally valid and don’t know exctly what we must have as good solution, we areled to ask ourselves: ”What are the better?” This obviously depends by our goals, sonow the question is: ”What are our goals?”; - The second problem is condensed in the sentence ”Not all clusters can be found in one-shot clustering process, more often we must reapply the process to some part of datataset”, so there we have a second question that this paper answering: ”How to create clustering of data with ad-hoc processing for each different part of input dataset?”; These questions are resolved by the approaches named in this work as: Space of Solutions, Vague-Solution, Vague-Solution finding Method and finaly Recursive Clustering. All of these approaches was drafted and tested in mine Master Thesis titled ”Geospatial data analysis for Urban informatics applications: the case of the Google Place of the City of Milan” [25].

Timely and accurate information on tree species is crucial for the sustainable management of natural resources, forest inventory, biodiversity detection, and carbon stock calculation. The advancement of remote sensing technology and artificial intelligence has facilitated the acquisition and analysis of remote sensing data, resulting in more precise and effective classification of tree species. Multimodal remote sensing data and deep learning seem to be the current tree species classification research mainstream, whether or not. The current review on the remote sensing data and deep learning tree species classification methods perspectives to analyze the unimodal and multimodal remote sensing data and classification methods in this realm is missing. To bridge the gap, we search for major trends in the remote sensing data and tree species classification methods, provide a detailed overview of classic deep learning-based methods for tree species classification, and discuss the limitations.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. 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 part of the spectrum, were taken over a controlled environment in Cyprus during the 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, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared 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.

The application of artificial intelligence to point-of-care testing (POCT) disease detection has become a hot research field, in which breath detection which detects the patient's exhaled VOCs combined with sensor arrays of Convolutional Neural Network (CNN) algorithms as a new lung cancer detection is attracting more researchers' attention. However, due to low accuracy, high complexity computation and large number of parameters make the CNN algorithms difficult transplant to the embedded system of POCT devices. A lightweight neural network (LTNet) in this work is proposed to deal with this problem, and meanwhile, achieve high-precision classification of acetone and ethanol gases, which are respiratory markers for lung cancer patients. Compared to currently popular lightweight CNN models such as EfficientNet, LTNet has fewer parameters (32K) and its training weight size is only 0.155 MB. LTNet achieved an overall classification accuracy of 99.06% and 99.14% in the own mixed gas dataset and the University of California (UCI) dataset, which are both higher than that of the five existing models’, and it also offers the shortest training (844.38s and 584.67s) and inference time (23s and 14s) in the same validation set. Compared to the existing CNN models, LTNet is more suitable for resource-limited POCT devices.

Lung cancer remains a pervasive global health challenge, necessitating precise and efficient classification methods to inform optimal treatment strategies. In this study, we investigate the potential of machine learning algorithms in developing a computer-aided diagnostic tool for early and accurate lung cancer classification, leveraging essential protein biomarkers as predictive features. Our investigation reveals the superiority of Deep Neural Networks (DNNs) in lung cancer classification, achieving an impressive accuracy of 96.91%. This highlights the transformative potential of DNNs in facilitating real-world clinical applications, offering clinicians a powerful tool for accurate diagnosis and prognosis. Additionally, we analyze the performance of Ensemble Methods, including Voting (91.75%) and Bagging (93.81%), as viable alternatives to DNNs. These ensemble techniques demonstrate robust performance, further underlining their utility in lung cancer classification tasks. Furthermore, our study underscores the critical role of hyperparameter tuning, particularly in adjusting parameters such as min child weights and learning rates, in mitigating overfitting and enhancing the generalizability of diverse machine learning models. For instance, Support Vector Machines (SVM) exhibit varying accuracies ranging from 74.23% to 95.88% across different hyperparameter configurations, emphasizing the importance of hyperparameter optimization in maximizing model performance. In summary, our comprehensive comparative analysis sheds light on the efficacy of different machine learning approaches in lung cancer classification. By leveraging advanced algorithms and optimizing model parameters, researchers and clinicians can harness the power of machine learning to advance early detection and personalized treatment strategies for lung cancer patients.

Identifying punch types as part of punch kinematic analysis is a key component for both coaches and players, providing critical insights into the variety and effectiveness of punches, which are essential for refining overall performance. Existing research indicates that punch type classification typically relies on data from either wearables or video data. Both approaches have their merits and demerits but require a significant amount of labeled data for modeling the classification algorithm. In this work, we propose a novel approach that significantly reduces the labeling effort by one-sixth by leveraging video data to enhance the training information of sensor data. This enriched training phase enables more accurate punch classification with reduced labeled data. Subsequently, the real-time punch identification and classification use only the wearable data. On a real dataset, with 15% of the labeling efforts, our approach achieved an accuracy rate of 91.41% for rear hand punch recognition and 91.91% for lead hand punch recognition, along with 92.33% and 94.56% for punch classification, respectively. Through the development of our Smart Boxer system, we aim to revolutionize punch analytics in boxing, providing comprehensive insights while enhancing the overall training and competitive experience for athletes and enriching fan engagement with the sport.

The land use land cover (LULC) map is extensively employed for different purposes. The LULC maps provided by the Portuguese National Geographic Information System (SNIG) are not ideal for continuous assessment and regular scrutiny. Machine learning (ML) algorithms applied in remote sensing (RS) data has been proven effective in image classification, object detection, and semantic segmentation. Previous studies have shown that Random Forest (RF) and Support Vector Machine (SVM) consistently achieved high accuracy for land classification. In this study, the application of RF and SVM classifiers, and object-based (OBIA) and pixel-based (PBIA) approaches with Sentinel-2A imagery was evaluated using Google Earth Engine (GEE) platform for land cover classification of a burned area in the Serra da Estrela Natural Park (PNSE), Portugal. This aimed to detect the land cover change and closely observe the burned area and vegetation recovery after the 2022 wildfire. The combination of RF and OBIA achieved the highest accuracy in all evaluation metrics. At the same time, a comparison with the Normalized Difference Vegetation Index (NDVI) map and Conjunctural Land Occupation Map (COSc) of 2023 year indicated that the SVM and PBIA map resembled the maps better.

This paper focuses on optimal sensor positioning for monitoring activities of daily living and investigates different combinations of features and models on different sensor positions, i.e., the side of the waist, front of the waist, chest, thigh, head, upper arm, wrist, and ankle. Sixteen features are extracted and the feature importance is measured by using the Relief-F feature selection algorithm. Eight classification algorithms are evaluated on a dataset collected from young subjects and that collected from elderly subjects, with two different experimental settings. To deal with different sampling rates, signals with a high data rate are down-sampled and a transformation matrix is used for aligning signals to the same coordinate system. The thigh, chest, side of the waist, and front of the waist are the best four sensor positions for the first dataset (young subjects), with average accuracy values being greater than 95%. The best model obtained from the first dataset for the side of the waist is validated on the second dataset (elderly subjects). The most appropriate number of features for each sensor position is reported. The results provide a reference for building activity recognition models for different sensor positions, as well as for data acquired from different hardware platforms and subject groups.

Global Earth Observation (EO) is becoming increasingly important in understanding and addressing critical aspects of life on our planet about environmental issues, natural disasters, sustainable development and others. EO plays a key role in making informed decisions on applying or reforming land use, responding to disasters, shaping climate adaptation policies etc. EO is also becoming a useful tool for helping professionals make the most profitable decisions, e.g., in real estate or the investment sector. Finding similarities in landscapes may provide useful information regarding applying contiguous policies, taking alike decisions or learning from best practices on events and happenings that have already occurred in similar landscapes in the past. However, current applications of similar landscape retrieval are limited by moderate performance and the need for time-consuming and costly annotations. We propose splitting the similar landscape retrieval task into a set of smaller tasks that aim at identifying individual concepts inherent to satellite images. Our approach relies on several models trained with Unsupervised Representation Learning (URL) on Google Earth images to identify these concepts. We show the efficacy of matching individual concepts for tackling the task of retrieving similar landscape(s) to a user-selected satellite image with a proof-of-concept application of the proposed approach on the geographical territory of the Republic of Cyprus. Our results demonstrate the efficacy of breaking up the landscape similarity task into individual concepts closely related to remote sensing instead of trying to capture all concepts and image semantics with a single model like a single RGB semantics model.

The inherent dependency of deep learning models to labeled data is a well-known problem and one of the barriers that slows down the integration of such methods into different fields of applied sciences and engineering, in which experimental and numerical methods can easily generate a colossal amount of unlabeled data. This paper proposes an unsupervised domain adaptation methodology that mimics the peer review process to label new observations in a different domain from the training set. The approach evaluates the validity of a hypothesis using domain knowledge acquired from the training set through a similarity analysis, exploring the projected feature space to examine the class centroid shifts. The methodology is tested on a binary classification problem, where synthetic images of cubes and cylinders in different orientations are generated. The methodology improves the accuracy of the object classifier from 60% to around 90% in the case of a domain shift in physical feature space without human labeling.

Surface water distribution extracted from remote sensing data has been used in water resource assessment, coastal management, and environmental change studies. Traditional manual methods for extracting water bodies cannot satisfy the requirements for mass processing of remote sensing data; therefore, accurate automated extraction of such water bodies has remained a challenge. The histogram bimodal method (HBM) is a frequently used objective tool for threshold selection in image segmentation. The threshold is determined by seeking twin peaks, and the valley values between them; however, automatically calculating the threshold is difficult because complex surfaces and image noise which lead to not perfect twin peaks (single or multiple peaks). We developed an operational automated water extraction method, the modified histogram bimodal method (MHBM). The MHBM defines the threshold range of water extraction through mass static data; therefore, it does not require the identification of twin histogram peaks. It then seeks the minimum values in the threshold range to achieve automated threshold. We calibrated the MHBM for many lakes in China using Landsat 8 Operational Land Imager (OLI) images, for which the relative error (RE) and squared correlation coefficient (R2) for threshold accuracy were found to be 2.1% and 0.96, respectively. The RE and root-mean-square error (RMSE) for the area accuracy of MHBM were 0.59% and 7.4 km2. The results show that the MHBM could easily be applied to mass time-series remote sensing data to calculate water thresholds within water index images and successfully extract the spatial distribution of large water bodies automatically.

As a model for economic and ecological systems, replicator dynamics represents a basic form of agent competition for finite resources. Here, we investigate the effects of stochastic resetting in this kind of processes. Random reset events abruptly lead individual resources to a small value from which dynamics must start anew. Numerical results show that resource distribution over the population of competing agents develops highly nonuniform profiles, exhibiting clustering and fluctuations with anomalous dependence on the population size. This non-standard statistical behavior jeopardizes an analytical treatment based on mean-field assumptions. We propose alternative simplified analytical approaches which provide a stylized description of entropy evolution for the clustered distribution of resources and explain the unusually slow decrease of fluctuations.

Assessment of drugs toxicity and associated biomarker genes is one of the most important tasks in the pre-clinical phase of drug development pipeline as well as in the toxicogenomic studies. There are few statistical methods for the assessment of doses of drugs (DDs) toxicity and their associated biomarker genes. However, these methods consume more time for computation of the model parameters using the EM (Expectation-Maximization) based iterative approaches. To overcome this problem, in this paper, an attempt is made to propose an alternative approach based on hierarchical clustering (HC) for the same purpose. There are several types of HC approaches whose performance depends on different similarity/distance measures. Therefore, we explored suitable combinations of distance measures and HC methods based on Japanese Toxicogenomics Project (TGP) datasets for better clustering/co-clustering between DDs and genes as well as to detect toxic DDs and their associated biomarker genes. We observed that Word’s HC method with each of Euclidean, Manhattan and Minkowski distance measures produces better clustering/co-clustering results. For an example, in case of glutathione metabolism pathway (GMP) dataset LOC100359539/Rrm2, Gpx6, RGD1562107, Gstm4, Gstm3, G6pd, Gsta5, Gclc, Mgst2, Gsr, Gpx2, Gclm, Gstp1, LOC100912604/Srm, Gstm4, Odc1, Gsr, Gss are the biomarker genes and Acetaminophen_Middle, Acetaminophen_High, Methapyrilene_High, Nitrofurazone_High, Nitrofurazone_Middle, Isoniazid_Middle, Isoniazid_High are their regulatory (associated) DDs explored by our proposed co-clustering algorithm based on the distance and HC method combination Euclidean: Word. Similarly, for the PPAR signaling pathway (PPAR-SP) dataset Cpt1a, Cyp8b1, Cyp4a3, Ehhadh, Plin5, Plin2, Fabp3, Me1, Fabp5, LOC100910385, Cpt2, Acaa1a, Cyp4a1, LOC100365047, Cpt1a, LOC100365047, Angptl4, Aqp7, Cpt1c, Cpt1b, Me1 are the biomarker genes and Aspirin_Low, Aspirin_Middle, Aspirin_High, Benzbromarone_Middle, Benzbromarone_High, Clofibrate_Middle, Clofibrate_High, WY14643_Low, WY14643_High, WY14643_Middle, Gemfibrozil_Middle, Gemfibrozil_High are their regulatory DDs. These results are validated by the available literature and functional annotation.

ACL instability poses a significant challenge in traumatology and orthopedic medicine, often requiring accurate diagnosis for appropriate treatment. While the pivot-shift test offers a crucial means of assessment, its reliance on subjective interpretation underscores the need for supplementary imaging studies. This study aims to address this limitation by developing a Bayesian classification algorithm tailored for integration into a mobile application. Using the built-in inertial sensors of smartphones, this new approach aims to dynamically evaluate rotational stability during knee examinations. Orthopedic specialists conducted knee evaluations on 52 subjects, with subsequent analysis revealing interesting insights. Intraobserver and interobserver analyses, as measured by ICC, demonstrated strong agreement both in terms of timing between maneuvers (ICC = 0.94) and signal amplitude (ICC = 0.71-0.66). Notably, the Bayesian algorithm successfully classified 95% of joint hypermobility cases, with an additional 7 cases of hyperlaxity identified by the Pivot-Shift Meter (PSM). These findings highlight the practicality and effectiveness of implementing a Bayesian classification algorithm within a mobile application for assessing and categorizing signals captured by smartphone inertial sensors during the pivot-shift test.

There are many applications of anomaly detection in IoT domain. IoT technology consists of large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to Internet, they frequently meet with the challenges of illegitimate accesses in the form of intrusions, anomaly, fraud, etc. Identifying these illegitimate accesses in IoT domain can be an exciting research problem. In numerous applications fuzzy clustering and rough set theory have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower dimensional data cannot be applied efficiently. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques are proposed for anomaly detection. First of all, the nano topology is generated to find lower dimensional apace and then a couple of well-known fuzzy clustering techniques are employed on it for the efficient anomaly detection. The effectiveness of the proposed approaches is evaluated using time-complexity analysis, experimental studies with a synthetic dataset and a real-life dataset along with comparative studies with traditional fuzzy clustering approaches namely fuzzy c-means clustering (FCM) algorithm, Gustafson-Kessel (GK) Algorithm, Gath-Geva (GG) Algorithm, Mahalanobis Distance based Fuzzy C-Means algorithm (M-FCM), and Common Mahalanobis Distance based Fuzzy C-Means algorithm (CM-FCM). Experimentally, it has been found that the proposed approaches outperform the aforesaid algorithms in terms of detection rates, accuracy rates, false alarm rates and computational times.

While there are several ways to identify customer behaviors, few extract this value from information already in a database, much less extract relevant characteristics. This paper presents the development of a prototype using the recency, frequency, and monetary attributes for customer segmentation of a retail database. For this purpose, the standard K-means, K-medoids, and MiniBatch K-means were evaluated. The standard K-means clustering algorithm was more appropriate for data clustering than other algorithms as it remained stable until solutions with 6 clusters. The evaluation of the clusters’ quality was obtained through the internal validation indexes: Silhouette, Calinski Harabasz, and Davies Bouldin. Once consensus was not obtained, three external validation indexes were applied: global stability, stability per cluster, and segment-level stability across solutions. Six customer segments were obtained, identified by their unique behavior: Lost customers, disinterested customers, recent customers, less recent customers, loyal customers, and best customers. Their behavior was evidenced and analyzed, indicating trends and preferences.

Collective spread of aggregated viral particles may have beneficial effects on viral capability to survive in the external environment, to counteract immune responses, and to successfully colonize host cells. Here we ask whether SARS-Cov-2 particles, responsible for COVID-19, display collective clustering behavior. Looking at microphotographs and movies of SARS-Cov-2 particles emerging from the surface of cultured cells, we describe single virions that tend to aggregate in progressively larger globular assemblies, until a network-like appearance is achieved. When SARS-Cov-2 particles stick into each other, the squeezing of single virions leads to improved viral package in host’s fluids. We discuss how these findings might explain both the ability to spread of SARS-Cov-2 and the clinical severity of COVID-19 in humans, paving the way to novel therapeutic strategies to mechanically disrupt collective clustering.

Clustering is an important task in data mining that has become more challenging due to the ever-increasing size of available datasets. To cope with these big data scenarios, a high-performance clustering approach is required. Sparse grid clustering is a density-based clustering method that uses a sparse grid density estimation as its central building block. The underlying density estimation approach enables the detection of clusters with non-convex shapes and without a predetermined number of clusters. In this work, we introduce a new distributed and performance-portable variant of the sparse grid clustering algorithm that is suited for big data settings. Our compute kernels were implemented in OpenCL to enable portability across a wide range of architectures. For distributed environments, we added a manager-worker scheme that was implemented using MPI. In experiments on two supercomputers, Piz Daint and Hazel Hen, with up to 100 million data points in a 10-dimensional dataset, we show the performance and scalability of our approach. The dataset with 100 million data points was clustered in 1198s using 128 nodes of Piz Daint. This translates to an overall performance of 352TFLOPS. On the node-level, we provide results for two GPUs, Nvidia's Tesla P100 and the AMD FirePro W8100, and one processor-based platform that uses Intel Xeon E5-2680v3 processors. In these experiments, we achieved between 43% and 66% of the peak performance across all compute kernels and devices, demonstrating the performance portability of our approach.

This study describes a novel method for grading pathological sections of gliomas. Our own integrated hyperspectral imaging system was employed to characterize 270 bands of cancerous tissue samples from microarray slides of gliomas. These samples were then classified according to the guidelines developed by the World Health Organization, which define the subtypes and grades of diffuse gliomas. We explored a hyperspectral feature extraction model called SMLME-Resnet using microscopic hyperspectral images of brain gliomas of different malignancy grades. The model combines the channel attention mechanism and multi-scale image features to automatically learn the pathological organization of gliomas and obtain hierarchical feature representations, effectively removing the interference of redundant information. It also completes multi-modal, multi-scale spatial and spectral feature extraction to improve the automatic classification of glioma subtypes. The proposed classification method demonstrated high average classification accuracy (>97.3\%) and Kappa coefficient (0.954), indicating its effectiveness in improving the automatic classification of hyperspectral gliomas. The method is readily applicable in a wide range of clinical settings, offering valuable assistance in alleviating the workload of clinical pathologists. Furthermore, the study contributes to the development of more personalized and refined treatment plans, as well as subsequent follow-up and adjustment of treatment, by providing physicians with insights into the underlying pathological organization of gliomas.

The risk classification of barrier lake is the key to conducting emergency treatment in a scientific manner. Such difficulties are faced as short time for risk evaluation, complex evaluation indicators, difficulty in obtaining information quickly and quantifying index weights. Based on this, this paper constructs a quantitative risk classification model for barrier lakes based on D-AHP. On the basis of studies on nearly 100 cases of barrier lakes, an 8-factor evaluation index system and quantitative classification are proposed. The methods of rapid calculation of reservoir capacity curve of barrier lake and intelligent identification of particles on the surface of barrier body were developed, which realized the rapid acquisition of 8-factor evaluation index information in emergency environment. The D-AHP method dealt with inconsistent weight assignment to evaluation factors by experts, which helped achieve weight quantification of 8 factors. The risk assessment on15 barrier lakes such as Tangjiashan barrier lake show that the conclusion drawn with risk classification method proposed in this paper is basically consistent with that of the traditional table-lookup method. However, the table-lookup method ignores cumulative loss’s impacts on the risk level of barrier lakes, and considers the extremely severe loss of barrier lakes as a sufficient condition for the evaluation level to be grade I, and thus a deviation in the evaluation. The risk classification method proposed in this paper is more reasonable and reliable.