Vegetation identification using remote sensing is essential for understanding terrestrial ecosystems and monitoring climate change. This technology by providing high-resolution images of the Earth's surface from satellites, aircraft, and drones has revolutionized the way scientists study and un-derstand vegetation patterns, providing information on the distribution, structure, and health of plant communities in different regions and biomes. However, identifying vegetation in multi and hyperspectral images remains a difficult, time-consuming, and costly process. Traditional methods for vegetation mapping involve the in-terpretation of spectral indices such as the Normalized Difference Vegetation Index (NDVI), alt-hough they often suffer from limitations such as manual interpretation and limited spatial resolution of satellite images. Furthermore, machine learning techniques, artificial neural networks, decision trees, support vector machines, and random forests have shown promising results in identifying and classifying vegetation cover from hyperspectral images. However, due to the need for per-son-nel with specialized expertise, their application on a large scale is still challenging. On the other hand, correlation methods between curves have emerged as powerful and simplified tool for comparing spectral signatures of hyperspectral image pixels and efficiently classifying vegetation in a study area. Pearson's correlation coefficient and spectral angle mapper are among the most common correlation methods used in vegetation mapping. These correlation methods, among many others available, offer an easily implemented and computationally efficient approach, making them particularly useful for applications in developing countries or regions with limited resources. In this article, a comparative study of correlation/distance metrics was conducted for the detection of vegetation pixels in hyperspectral images. The study allowed for the comparison of five distance and/or correlation metrics: direct correlation, cosine similarity, normalized Euclidean distance, Bray-Curtis’s distance, and Pearson correlation. The two metrics that yielded the best accuracy results in vegetation pixel detection were direct correlation and Pearson correlation. Based on the selected methods, a vegetation detection algorithm was implemented and validated on a hyper-spectral image of the Manga neighborhood in Cartagena de Indias, Colombia. The spectral library was utilized for image processing, while the numpy and scipy libraries in the Python programming language were used for the mathematical calculation of correlations. Both the study's approach and the implemented algorithm aim to serve as a reference for conducting detection studies of various material types in hyperspectral images using open-access programming platforms.

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.

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.

Enhancing the management and monitoring of oil and gas processes demands developing precise predictive analytics techniques. Over the past two years, oil and its prediction have advanced significantly using conventional and modern Machine Learning techniques. Several review articles detail the developments in predictive maintenance and technical and non-technical aspects of influencing the uptake of big data. The absence of references for machine learning techniques impacts the effective optimization of predictive analytics in the oil and gas sector. This review paper offers readers thorough information on the latest machine learning methods utilized in this industry's predictive analytical modelling. The review covers forms of Machine Learning techniques used in predictive analytic modelling from 2021 to 2023 (91 articles). It provides an overview of the details of the papers that were reviewed, comprising of the model’s categories, the data's temporality, field, and name, the dataset's type, predictive analytics (classification or clustering or prediction), the models' input and output parameters, performance metrics, optimal model, and benefits and its drawbacks. Additionally, suggestions for future research directions are provided to raise the potential of the associated knowledge and increase the accuracy of oil and gas predictive analytics models.

Pavement friction plays a crucial role in ensuring the safety of road networks. Accurately assessing friction levels is vital for effective pavement maintenance and management strategies employed by state highway agencies. Traditionally, friction evaluations have been conducted on a case-by-case basis, focusing on specific road sections. However, this approach fails to provide a comprehensive assessment of friction conditions across the entire road network. This paper introduces a hybrid clustering algorithm, namely the combination of density-based spatial clustering of applications with noise (DBSCAN) and Gaussian mixture model (GMM), to perform pavement friction performance rating across a statewide road network. A large, safety-oriented dataset is first generated by integrating network friction and vehicle crash data based on the attributes contributing possibly to friction related crashes. One-, two-, and multi-dimensional clustering analyses, respectively, are then performed to rate pavement friction. The Chi-square test is further employed to validate and identify the practical ratings. It is shown that by effectively capturing the hidden, intricate patterns within the integrated, complex dataset and prioritizing friction-related safety attributes, the hybrid clustering algorithm can produce pavement friction ratings that align effectively with the current practices of the Indiana Department of Transportation (INDOT) in friction management.

One of the efficient data mining tools is density-based clustering, including the density grid-based clustering. However, a common drawback always existing in clusters made by the density grid-based method is the existence of weakly connected grids deriving mainly from noise. Appearing such an unwanted connection with a high frequency reduces the accuracy of the obtained cluster data space (CDS) and its application efficiency. Here, we present an essential improvement to overcome this problem. First, we describe a concept of the weak-connected grid cell (WCG) and present a fuzzy-type approximation to depict the density-based distribution of data points at grid nodes. Then, we propose a strategy of searching WCG for density grid-based clustering (SWCG-DGB) to set up a CDS, filter noise, and tune the created CDS. A buffer is deployed during this phase to collect border points and filter noise, which improves the computational time significantly, especially for noisy datasets. Results from numerical surveys reflected the compared efficiency of this method in clustering validity, including the accuracy of the number of clusters.

Semi-supervised consensus clustering is a promising strategy to compensate for the subjectivity of clustering and its sensitivity to design factors, with various techniques being recently proposed to integrate domain knowledge and multiple clustering partitions. In this article we present a new approach that makes double use of domain knowledge, namely to build the initial partitions as well as to combine them. In particular, we show how to model and integrate must-link and cannot-link constraints into the objective function of a generic consensus clustering (??) framework that maximizes the similarity between the consensus partition and the input partitions, which have, in turn, been enriched with the same constraints. In addition, borrowing from the theory of functional dependencies, the integrated framework exploits the notions of deductive closure and minimal cover to take full advantage of the logical implication between constraints. Using standard UCI benchmarks, we found that the resulting algorithm, termed ??? (double-Constrained Consensus Clustering), was more effective than plain ?? at combining base constrained partitions. We then argue that ??? is especially well-suited to profiling counterfeit e-commerce websites, because constraints can be acquired by leveraging specific domain features, and demonstrate its potential for detecting affiliate marketing programs. Taken together, our experiments suggest that ??? makes the process of clustering more robust and able to withstand changes in clustering algorithms, datasets, and features, with a remarkable improvement of average performance.

Clustering algorithm such as k-Means is highly sensitive to the scale of input features. A common approach to mitigate this issue is Min-Max scaling normalization, which rescales feature values to a specified range. This paper investigates an alternative form of Min-Max scaling, where the normalization is based on both the minimum (Xmin) and mean (Xmean) of the feature, rather than the maximum value. The proposed method is shown to be particularly effective in improving clustering accuracy for datasets with varying scales and distributions. Experimental results demonstrate that using this modified Min-Max scaling approach leads to better-defined clusters, enhanced performance in terms of clustering accuracy, and reduced bias in distance-based clustering algorithms. We validate the method using several standard clustering techniques, including k-Means on publicly available datasets.

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.

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.

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$.

The clustering methods of Software Defined Networking (SDN) gained popularity due to their ability to offer improved scalability, consistency, dependability, and load balancing within overlay networks and SDN partitions. This paper delved into the effects of increasing the number of OpenFlow-enabled southbound devices on the establishment and coordination of SDN-Controller clusters. Specifically, we examined the volume of east-west cluster packet communication concerning the number of southbound devices within the topology. Many research studies focused on bandwidth and the number of bytes in East-West communication. While bandwidth referred to the maximum rate at which data could be transferred, and the number of bytes reflected the volume of data being transmitted, the number of packet communications directly influenced the efficiency and responsiveness of network operations. Our investigation encompassed the impact of SDN controllerto- controller communication within the cluster concerning the rising number of OpenFlow switches connected to various topologies, including tree (star-bus network), linear, and torus configurations. This study presented data on communication patterns within Open Network Operating Systems (ONOS) and OpenDaylight (ODL) clusters, revealing differing levels of controller communication with southbound network expansions. We evaluated the scalability of ODL and ONOS controllers by scrutinising the effect of increasing the number of southbound devices on control communication volume. Our analysis revealed varied communication patterns within ONOS and ODL clusters, resulting in different volumes of control communication with southbound expansions. The findings indicated that in small to medium-sized SDNs, ODL outperformed ONOS, notably with faster cluster discovery. Conversely, ONOS demonstrated greater efficiency in larger networks owing to its centralised communication architecture. Finally, we provided recommendations for selecting the most suitable controllers based on the size of southbound networks, aiming to provide practical guidelines for optimal network performance.

Many clustering approaches succeed in pattern segmentation in many applications. This unsupervised segmentation should be effective to reduce an expert labelling time: i.e, they must be able to detect the number of patterns and identify them in a sequence or map with the right cuts. Several direct and hierarchical clustering approaches are compared for this task. A divisive spectral clustering architecture with a no-cut criteria is also proposed. This new algorithm achieves promise segmentation of spatial UCI databases and marine time series compared to other approaches.

Artificial Intelligence (AI) and Deep Reinforcement Learning (DRL) have revolutionised e-learning by creating personalised, adaptive, and secure environments. However, challenges such as privacy, bias, and data limitations persist. E-FedCloud aims to address these issues by providing more agile, personalised, and secure e-learning experiences. This study introduces E-FedCloud, an AI-assisted adaptive e-learning system that automates personalised recommendations and tracking, thereby enhancing student performance. It employs federated learning-based authentication to ensure secure and private access for both course instructors and students. Intelligent Software Agents (ISAs) evaluate weekly student engagement using the Shannon Entropy method, classifying students into either engaged or not-engaged clusters. E-FedCloud utilises weekly engagement status, demographic information, and an innovative DRL-based early warning system, specifically ID2QN, to predict the performance of not-engaged students. Based on these predictions, the system categorises students into three groups: risk of dropping out, risk of scoring lower in the final exam, and risk of failing the end exam. It employs a multi-disciplinary ontology graph and an attention-based capsule network for automated, personalised recommendations. The system also integrates performance tracking to enhance student engagement. Data is securely stored on a blockchain using the LWEA encryption method.

In recent years, new metaheuristic algorithms have been developed taking as reference the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm development has been widely used by many researchers in solving optimization problem. These algorithms have been compared with the traditional ones algorithms and have demonstrated to be superior in complex problems. This paper attempts to describe the algorithms based on nature, that are used in fuzzy clustering. We briefly describe the optimization methods, the most cited nature-inspired algorithms published in recent years, authors, networks and relationship of the works, etc. We believe the paper can serve as a basis for analysis of the new are of nature and bio-inspired optimization of fuzzy clustering.

Lately, the Critical Pathway(CP) of Electronic Medical Record(EMR) is used to the guideline for a treatment in the public hospital. We propose a healthcare promotion service using disease pattern with lifestyle risk factors. We classify a medical historical patient data with disease codes with lifestyle risk factors (hypertension, diabetes, smoking, overweight, excessive alcohol intake, and low physical activity) to make the lifestyle risk factors through the classification. We finally make the clusters of disease code with lifestyle risk factors using the medical historical data based on EMR's electronic discharge summary data. As the result of that, we do a healthcare recommending service based on the disease pattern with lifestyle risk. We can build a medical help desk of a public hospital to support people as we check into the public hospital; how to get the procedure of curing, the desired curing clinical method for the healthcare promotion service by each disease code, and how to be better our healthcare. We evaluate the performance of the proposed system by experimenting with the datasets collected at the medical center to measure performance and report some experimental results.

The article presents a bibliometric analysis of conference proceedings 2019-2021 indexed in Scopus and related to the topic "Artificial Intelligence and Energy". The relevance of the topic is considered in the context of the energy transition and the application of artificial intelligence for the rational use of energy resources. A comparative analysis of the publication activity of researchers from Russia, China, India, the United States, and Indonesia on the topic in question is given. Methodologically, the emphasis for determining the subject is not on the co-occurrence of keywords, but on the clustering of documents based on the thesis that the titles of publications most briefly and fully reveal the content of the publication and allow the subject specialist to do a relevant selection of publications necessary for their research. Two tools were used in this work: Carrot2 and Clustering App (CSV Explorer). It is shown that Russian researches are characterized by the tendency of prevailing engineering problems and insufficient attention is paid to environmental, economic and social problems of using AI in the energy sector. Studies from China and the United States are of the greatest informative interest, both in terms of the relevance of their topics and the actuality of their content. Studies from India and Indonesia are more general in nature; of interest are the efforts of these countries to engage in global scientific activities.

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.

This article presents an in-depth overview of clustering techniques, which play a vital role in unsupervised learning by uncovering natural groupings in data. We examine five prominent methods: k-Means, k-Medoids, Kohonen Networks and Self-Organizing Maps (SOMs), Fuzzy C-Means, Hierarchical Clustering, and Spectral Clustering. Each technique is described in detail, including its mathematical foundation, operational mechanism, applications, strengths, and limitations. The goal is to provide a thorough understanding of each approach, helping readers select the most appropriate method for their data analysis needs. Practical examples are also provided, demonstrating the application of these clustering techniques in various real-world contexts such as customer segmentation, image processing, and bioinformatics.

Data is present in the data sources like Files and Data bases, Retrieval of information from that data sources is one of the important issue nowadays. So for retrieval information from the data sources clustering is used. In the present market different types of clustering algorithms were available. But opting of the clustering is based on user requirements. This paper focuses on the study of hierarchical clustering approach on different conditions or measures or with customer choices like clustering process number of clusters generated at each level, number of levels, attributes range for performing the clustering on the given data set. In brief overview we discuss the hierarchical approach for clustering algorithm with the user opting choices.

In the modern days the data is coming from various devices like mobiles, tabs, laptops, computers, IOT devices e.tc and is stored in the electronics form in the systems using the concept of files or data bases. Clustering Technique is used to extract data from these sources. Improving the accuracy of the model is improved using the feature selection or feature engineering or both. The feature engineering is used to add a new feature based on the global mean. Along with that new feature in addition to the feature selection increase the overall accuracy of the model.

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.

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.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

The exploration of heath data by clustering algorithms allows to better describe the populations of interest by seeking the sub-profiles that compose it. This therefore reinforces medical knowledge, whether it is about a disease or a targeted population in real life. Nevertheless, contrary to the so-called conventional biostatistical methods where numerous guidelines exist, the standardization of data science approaches in clinical research remains a little discussed subject. This results in a significant diversity in the execution of data science projects, whether in terms of algorithms used, reliability and credibility of the designed approach. Taking the path of parsimonious and judicious choice of both algorithms and implementations at each stage, this paper proposes Qluster, a practical workflow for performing clustering tasks. Indeed, this workflow makes a compromise between (1) genericity, as it is suitable regardless of the data volume (small/big) and regardless of the nature of the variables (continuous/qualitative/mixed), (2) ease of implementation, as it is based on few easy-to-use software packages, and (3) robustness, through the stability evaluation of the final clusters and through recognized algorithms and implementations. This workflow can be easily automated and/or routinely applied on a wide range of clustering projects. A synthesis of the literature on data clustering as well as the scientific rationale supporting the proposed workflow is also provided. Finally, a detailed application of the workflow on a concrete use case is provided, along with a practical discussion for data scientists. An implementation on the Dataiku platform is available upon request to the authors.

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.

This paper proposes an ARIMA approach to battery health forecasting with accuracy improvement by K shape-based clustered predictors. The health prediction of the battery pack is an important function of a battery management system in data centers. Accurate forecasting of battery life turns out to be very difficult without failure data to train a good forecasting model in real life. The conventional ARIMA model is compared with total and clustered predictors for battery health forecasting. Results show that the forecasting accuracy of the ARIMA model significantly improved by utilizing the results of the clustered predictors for 40 batteries in a real data center. One year of actual historical data of 40 batteries of large scale datacenter is presented to validate the effectiveness of the proposed methodology.

In this paper, we provide a study on the effects of applying classical clustering algorithms, such as k-Means to free text recommender systems. A typical recommender system may face problems when the number of items from a database goes from a few items to hundreds of items. Currently, one of the most prominent techniques to scale the database is applying clustering, however clustering may have a negative impact on the accuracy of the system when applied without taking into consideration the underlying items. In this work, we build a conceptual text recommender system and use k-Means to partition its search space into different groups. We study how the variation of the number of clusters affects its performance in the light of two performance measurements: recommendation time and precision. We also analyze if this clustering is affected by the representation of text we use. All the techniques used in this study uses word-embeddings to represent the document. One of the main findings of this work is that using clustering we can improve the recommendation time in up to almost 30 times without affecting much off its initial accuracy. Another interesting finding is that the increment of the number of clusters is not directly translated into linear performance.

We apply hierarchical clustering (HC) of DNA k-mer counts on multiple Fastq files. The tree structures produced by HC may reflect experimental groups and thereby indicate experimental effects, but clustering of preparation groups indicates the presence of batch effects. Hence, HC of DNA k-mer counts may serve as an unspecific diagnostic device. In order to provide a simple applicable tool we implemented sequential analysis of Fastq reads with low memory usage in an R package (seqTools) available on Bioconductor. The approach is validated by analysis of Fastq file batches containing RNAseq data. Analysis of three Fastq batches downloaded from ArrayExpress indicated experimental effects. Analysis of RNAseq data from two cell types (dermal fibroblasts and Jurkat cells) sequenced in our facility indicate presence of batch effects. The observed batch effects were also present in reads mapped to the human genome and also in reads filtered for high quality (Phred > 30). We propose, that hierarchical clustering of DNA k-mer counts provides an unspecific diagnostic tool and a quality criterion and for RNAseq experiments.

In this paper we compare the effects of forecasting demand using individual (disaggregated) components versus first aggregating the components either fully or into several clusters. Demand streams are assumed to follow autoregressive moving average (ARMA) processes. Using individual demand streams will always lead to a superior forecast compared to any aggregates, however we show that if several aggregated clusters are formed in a structured manner then these subaggregated clusters will lead to a forecast with minimal increase in mean-squared forecast error. We show this result based on theoretical MSFE obtained directly from the models generating the clusters as well as estimated MSFE obtained directly from simulated demand observations. We suggest a pivot-algorithm, that we call Pivot Clustering, to create these clusters. We also provide theoretical results to investigate sub-aggregation, including for special cases such as, aggregating MA(1) streams and ARMA streams with similar or same parameters.

Sugarcane (Saccharum spp.) is a crop of great industrial and alimentary importance, essential for the production of numerous products. Given its significance, genetic improvement programs exist that involve a rigorous study process, from material selection to the development of new varieties, requiring at least seven selection phases. This study modeled the growth curve of the sucrose percentage (SP) in 33 hybrids and six control varieties (MEX 69-290, ITV 92-1424, CP 72-2086, COLMEX 94-8, COLMEX 95-27, RB 85-5113) during the plant and ratoon periods in the experimental fields of the Melchor Ocampo Sugar Mill, Jalisco, Mexico. For clustering the materials, k-means, k-medoids, and Density-based spatial clustering of applications with noise (DBSCAN) algorithms were used, considering four maturity types among the control varieties. The DBSCAN algorithm proved to be the most effective, as the means between groups were not statistically equal. The hybrids identified as candidates for subsequent phases due to their high SP were COSTA JAL, ATEMEX 99-48, ATEMEX 99-1, ATEMEX 99-61, MEX 70-486, MEX 80-1521, ITSAMEX 07-44814, ITSAMEX 06-6395, and ITSAMEX 07-1903. These results are crucial for improving the productivity and sustainability of the crop, with significant implications for the sugar industry.

Load balancing to alleviate network congestion remains a critical challenge in Vehicular Ad-Hoc Networks (VANETs). During route and response scheduling, RSUs risk being overloaded beyond their calculated capacity. Despite recent advancements like RSU-based load transfer, NP-Hard hierarchical geography routing, RSU-based MAC schemes, simplified clustering, and network activity control, a significant gap persists in employing a load-balancing server for effective traffic management. We propose a server-based network congestion handling mechanism (SBNC) in VANETs to bridge this gap. Our approach clusters RSUs within specified ranges and incorporates dedicated load balancing and network scheduler RSUs to manage route selection and request-response scheduling, thereby balancing RSU loads. We introduce three key algorithms: optimal placement of dedicated RSUs, a scheduling policy for packets/data/requests/responses, and a congestion control algorithm for load balancing. Using the VanetMobiSim library of Network Simulator-2 (NS-2), we evaluate our approach based on residual energy consumption, end-to-end delay, packet delivery ratio (PDR), and control packet overhead. Results indicate substantial improvements in load balancing through our proposed server-based approach.

Cryptocurrencies have now become an emerging blockchain-based payment technology. Users’ identities on such networks are pseudo-anonymous in that all transactions made from an address are transparent and searchable by anyone; to preserve their privacy, users often use many different addresses. In recent years, some studies have been conducted regarding analyzing clusters of Bitcoin addresses that, according to certain heuristics, belong to the same entity. Such action allows law enforcement to have relevant information in cases where cryptocurrencies are used for illegal trafficking. Clustering methods based on a single heuristic do not allow the clustering of many addresses in a complete and accurate manner. This paper proposes Bitcoin Address Clustering based on multiple Heuristics (BACH), a tool that uses three different clustering heuristics to identify clusters of Bitcoin addresses, which are displayed through a three-dimensional graph. Based on the results, several analyses were conducted, including a comparison with Wallet Explorer, an address clustering tool similar to BACH. BACH, in addition to introducing the innovative feature of graphical visualization of the internal structure of clusters, is shown to improve address aggregation through the joint use of three heuristics for clustering.

Autism spectrum disorder (ASD) is characterized by diverse patterns of social interaction, communication, and behavior. This study explores the application of clustering and stochastic migration models to visualize and understand the social and neural connectivity patterns associated with autism. The clustering model, with its strong internal connections and limited external connections, mirrors the tight-knit social groups and communication barriers often observed in individuals with autism. In contrast, the stochastic model, characterized by more dispersed connections and greater adaptability, represents the variability and flexibility seen in social interactions across typical individuals. By comparing these models, we can gain deeper insights into the unique challenges and strengths of individuals with autism, highlighting the importance of personalized interventions. Additionally, these models provide a visual framework for understanding the differences in brain connectivity patterns observed in autism, with implications for both behavioral and neural correlates. This study underscores the value of computational models in advancing our understanding of autism and guiding effective support strategies.

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.

The phenomenon of missing data can be seen everywhere in reality. Most typical attribute reduction models are only suitable for complete systems. But for incomplete systems, we can’t obtain the effective reduction rules. Even if there are a few reduction approaches, the classification accuracy of their reduction sets still needs to be improved. In order to overcome these shortcomings, this paper firstly defines the similarities of intra-cluster objects and inter-cluster objects based on the tolerance principle and the mechanism of knowledge granularity. Secondly, attributes are selected on the principle that the similarity of inter-cluster objects is small and the similarity of intra-cluster objects is large, and then the knowledge granularity attribute model is proposed under the background of clustering; Then, the IKAR algorithm program is designed. Finally, a series of comparative experiments about reduction size, running time and classification accuracy are conducted with twelve UCI data sets to evaluate the performance of IKAR algorithms, then the stability of Friedman test and Bonferroni-Dunn test are conducted. The experimental results indicate that the proposed algorithms are efficient and feasible.

In federated learning (FL), clients train models locally without sharing raw data, ensuring data privacy. In particular, federated distillation transfers knowledge to clients regardless of the model architecture. However, when groups of clients with different data distributions exist, sharing the same knowledge among all clients becomes impractical. To address this issue, this paper presents an approach that clusters clients based on the output of a client model trained using their own data. The clients are clustered based on the predictions of their models for each label on a public dataset. Prior knowledge of the number of groups is not required. Evaluations on the MNIST dataset showed that our method accurately identified these group structures and improved accuracy by 15–75% compared with traditional federated distillation algorithms when distinct group structures were present. Additionally, we observed significant performance improvements in smaller client groups, bringing us closer to fair FL.

Herein, a chemophenetic significance, based on phenolic metabolite profiling of three Senecio (S. hercynicus, S. ovatus and S. rupestris) and two Jacobaea species (J. pancicii and J. maritima) coupled to morphometric data, is presented. A set of twelve morphometric characters were recorded from each plant species and used as predictor variables in a Linear Discriminant Analysis (LDA) model. From a total 75 observations (15 from each of the five species), the model correctly assumed their species' membership, except 2 observations. Among the studied species, S. hercynicus and S. ovatus presented the greatest morphological similarity. A phytochemical profiling of phenolic specialized metabolites by UHPLC-Orbitrap-HRMS revealed 46 hydroxybenzoic, hydroxycinnamic, acylquinic acids and their derivatives, 1 coumarin, and 21 flavonoids. Hierarchical and PCA clustering applied to the phytochemical data corroborated the similarity of S. hercynicus and S. ovatus, observed in the morphometric analysis. This study contributes to the phylogenetic relationships between the tribe Senecioneae taxa and highlights the chemophenetic similarity/dissmilarity of the studied species belonging to Senecio and Jacobaea genera.

Positron-emission tomography is powerful but costly tool for various medical investigations. In particular, it is used in Parkinson’s disease and essential tremor diagnostics. However, yet there is no standardized figures of the references, for it. We examined the PET efficiency for the analysis of development and degradation of dophaminergic neurons in Parkinson’s disease. The informative indices are determined from the observed PET data. Also, high efficiency of PET for Parkinson’s disease as approved.

Identifying groups that share common features among datasets through clustering analysis is a typical problem in many fields of science, particularly in post-omics and systems biology research. In respect of this, quantifying how a measure can cluster or organize intrinsic groups is important since currently there is no statistical evaluation of how ordered is, or how much noise is embedded in the resulting clustered vector. Many of the literature focuses on how well the clustering algorithm orders the data, with several measures regarding external and internal statistical measures; but none measure has been developed to statistically quantify the noise in an arranged vector posterior a clustering algorithm, i.e., how much of the clustering is due to randomness. Here, we present a quantitative methodology, based on autocorrelation, to assess this problem.

Sentiment analysis to characterize properties of Bitcoin prices and their forecasting is here developed thanks to the capability of the Fuzzy transform to capture stylized facts and mutual connections between time series having different nature. Six years of daily Bitcoin Prices and Google Trends are analyzed in order to establish new perspectives in the management of their dynamics.

The segmentation of urban scene mobile laser scanning (MLS) data into meaningful street objects is a great challenge due to the scene complexity of street environments, especially in the vicinity of street objects such as poles and trees. This paper proposes a three-stage method for the segmentation of urban MLS data at the object level. The original unorganized point cloud is first voxelized, and all information needed is stored in the voxels. These voxels are then classified as ground and non-ground voxels. In the second stage, the whole scene is segmented into clusters by applying a density-based clustering method based on two key parameters: local density and minimum distance. In the third stage, a merging step and a re-assignment processing step are applied to address the over-segmentation problem and noise points, respectively. We tested the effectiveness of the proposed methods on two urban MLS datasets. The overall accuracies of the segmentation results for the two test sites are 98.3% and 97%, thereby validating the effectiveness of the proposed method.

As psychology evolves, the phenomenon of concept overlap becomes more pronounced, increasing participant burden and complicate data interpretation. This study introduces an Embedding-based Semantic Analysis Approach (ESAA) for detecting redundancy in psychological concepts, which are operationalized through their respective scales, using natural language processing techniques. ESAA utilizes OpenAI’s GPT-3 large model to generate high-dimensional semantic embeddings of scale items and applies hierarchical clustering to group semantically similar items, uncovering potential redundancy. In three preliminary experiments, ESAA was tested on well-known psychological scales, such as Conscientiousness, Gratitude, and Grit. The experiments assessed ESAA’s ability to (1) converge semantically similar items, (2) discriminate semantically distinct items, and (3) identify overlapping scales measuring concepts known for redundancy. Additionally, comparative analyses were conducted to assess ESAA's robustness and incremental validity against the most advanced chat bots based on GPT-4. The results demonstrated that ESAA consistently produced stable outcomes and surpassed all evaluated chatbots in performance. As a novel, objective approach for analyzing relationships between concepts operationalized as scales, ESAA has potential to facilitate future research on theory refinement and scale optimization.

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.

Object detection often struggles with accurately identifying visually similar parts, a challenge commonly faced in industrial applications. To address this issue, we propose a clustering methodology based on the visual similarity of 3D object models. This approach is particularly effective when integrated with synthetic image generation, as both processes rely on 3D models. In a case study, we observed a 22 % increase in classification performance on a validation dataset when training an object detector on visually similar groups rather than on all classes, suggesting the potential of our method as a baseline for a multi-stage classification scheme.

This study offers an in-depth analysis of the COVID-19 pandemic’s trajectory in several member countries of the European Union (EU) to assess similarities in their crisis experiences. We also examine data from the United States to facilitate a larger comparison across continents. We introduce our new approach, which uses a spatio-temporal algorithm to identify five distinct and recurring phases that each country undergoes at different times during the pandemic. These stages include a Comfort Period characterized by minimal COVID-19 activity and limited impacts. The Preventive Situation demonstrates the implementation of proactive measures, with relatively low numbers of cases, deaths, and Intensive Care Unit (ICU) admissions. The Worrying Situation is defined by high levels of concern and preparation as deaths and cases begin to rise and reach substantial levels. The Panic Situation is marked by a high number of deaths relative to the number of cases and a rise in ICU admissions, denoting a critical and alarming period of the pandemic. Finally, the Epidemic Control Situation distinguishes itself by limiting COVID-19 deaths despite a high number of new cases. By examining these phases, we identify the various waves of the pandemic, indicating periods where the health crisis has a significant impact. This comparative analysis highlights the time lags between countries as they transition through these different critical stages and navigate the waves of COVID-19.

This work aims to initiate a reflection on the awareness of environmental, social, and corporate governance issues, summarized in the acronym ESG (Environmental, Social, Governance), among Italian SMEs. The integration of ESG issues into business models has led to an expansion of the risk taxonomy affecting corporate management. In addition to traditional financial risks, new risks have emerged, primarily climate risk, environmental, and energy risks, which can significantly impact companies' ability to create economic value. This includes planning and designing virtuous initiatives focused on sustainability and the ability to build public-private partnerships with various stakeholders. After this theoretical framework aimed at highlighting the evolution of the concept of corporate sustainability following the introduction of ESG factors, a clustering of non-performing loans of Italian companies is proposed using a k-Means algorithm, comparing the results obtained through two different methods, namely the Elbow method and the Silhouette coefficient. Finally, using data on Italian regions between 2004 and 2023, an empirical analysis is conducted to provide an estimate of the relationship between non-performing loans and some variables related to ESG components.

Geographic information systems (GIS) are critical for mapping the geographical distribution of illness prevalence, disease transmission patterns, and spatially modeling environmental elements of disease occurrence. This study was purposively to map and cluster five diseases such as cholera, diabetes, malaria, asthma and hypertension using GIS techniques in Southern Malawi. Getis-Ord Gi* statistic was used to determine spatial distribution of diseases. Data were acquired from Malawi Demographic Health Survey (DHS) and assessed geographically using spa-tial-statistical analytical techniques, including the kernel and hotspot models. These models were developed to investigate and exhibit the dissimilar patterns of the selected diseases, as well as to depict places of high concentration, and they may be useful in understanding local patterns of diseases and their geographical correlations. The study found that asthma is high in Mangochi, Balaka, Blantyre, Thyolo, Mulanje, Chikwawa and Nsanje districts. It was also revealed that hypertension patients were highly concentrated in Blantyre, Thyolo, Chikwawa, Zomba, Mangochi and Nsanje Districts. Mangochi, Phalombe, Nsanje and Chikwawa are high risk areas of Malaria and diabetes is highest in Blantyre. Cholera is high in Mangochi, Balaka, Blantyre, Thyolo, Mu-lanje, Chikwawa and Nsanje districts.

Reverse engineering is applied to identify optimum polymerization conditions for the synthesis of polymer with pre-defined properties. The proposed approach uses multi-objective optimization (MOO) and provides multiple candidate polymerization procedures to reach the targeted polymer property. The objectives for optimization include maximal similarity of molar mass distributions (MMD) compared to the target MMD, minimal reaction time, and maximal monomer conversion. The method is tested for vinyl acetate radical polymerizations and can be adopted to other monomers. The data for the optimization procedure is generated by an in-house developed kinetic Monte-Carlo (kMC) simulator for a selected recipe search space. The proposed reverse engineering algorithm comprises several steps: kMC simulations for the selected recipe search space to derive initial data, performing MOO for a targeted MMD, and identification of the Pareto optimal space. The last step uses a weighted sum optimization function to calculate the weighted score of each candidate polymerization conditions. To decrease the execution time clustering of the search space based on MMDs is applied. The performance of the proposed approach was tested for various target MMDs. The suggested MOO-based reverse engineering provides multiple recipe candidates depending on competing objectives.

This paper describes the E-Sense Artificial Intelligence system. It comprises of a memory model with 2 levels of information and then a more neural layer above that. The lower memory level stores source data in a Markov (n-gram) structure that is unweighted. Then a middle ontology level is created from a further 3 phases of aggregating source information. Each phase re-structures from an ensemble to a tree, where the information transposition may be from horizontal set-based sequences into more vertical, typed-based clusters. The base memory is essentially neutral, where any weighted constraints or preferences should be stored in the calling module. The success of the ontology typing is open to question, but results produced answers based more on use and context. The third level is more functional, where each function can represent a subset of the base data and learn how to transpose across it. The functional structures are shown to be quite orthogonal, or separate and are made from nodes with a progressive type of capability, including unordered to ordered. Comparisons with the columnar structure of the neural cortex can be made and the idea of ordinal learning, or just learning relative positions, is introduced. While this is still a work in progress, it offers a different architecture to the current favourites and may be able to give different views of the data from what they can provide.

The influence of a background vortex flow on clustering of floating tracer is addressed. The vortex flow considered is induced by an ellipsoidal vortex evolving in a deformation. The system exhibits various vortex motion regimes: (i) steady state, (ii) oscillation and (iii) rotation of the ellipsoidal vortex core. The latter two induce unsteady velocity field for the tracer thus leading to irregular (chaotic) tracer motion. Superimposing a stochastic divergent velocity field onto the deterministic vortex flow allows us to observe significantly different tracer evolution. We use the method of characteristics to integrate the floating tracer density evolution equation and the Euler-Ito scheme for obtaining the floating tracer trajectories with the random velocity field. The cluster area and cluster mass from the statistical topography were used as the quantitative diagnostics of floating-tracer’s clustering. For the case of the steady ellipsoidal vortex embedded into the deformation flow with a random velocity field component we found that clustering characteristics are weakened by the steady vortex. For the cases of an unsteady ellipsoidal vortex, we observed clustering in the floating-tracer density field if the contribution of the divergent component is higher or equal to that of the rotational (nondivergent) component. Even when the initial floating tracer patch was set on the boundary of oscillating ellipsoidal vortex, we observed formation of clusters. In the case of a rotating ellipsoidal vortex, we also observed pronounced clustering. Thus, we argue that unsteady ellipsoidal vortex regimes (oscillation and rotation), which induce chaotic motion of the nearby passive tracer’s trajectories, are still conducive to clustering of floating tracer observed in the density field despite the intense deformation introduced by strain and shear.

Addressing sustainable mobility in urban areas has become a priority in today’s society, given the growing population and increasing vehicular flow in these areas. Intelligent Transportation Systems have emerged as innovative and effective technological solutions to address these challenges. Research in this area has become crucial, as it contributes not only to improve mobility in urban areas, but also to positively impact the quality of life of its inhabitants. To address this, a dynamic clustering methodology for vehicular trajectory data is proposed which can provide an accurate representation of the traffic state. Data was collected for the city of San Francisco, a dynamic clustering algorithm was applied and then an indicator was applied to identify areas with traffic congestion. Several experiments were also conducted with different parameterizations of the forgetting factor of the clustering algorithm. The results showed in terms of precision that the dynamic clustering methodology achieved high match rates compared to the congestion indicator applied to static cells.

Fusarium species are one of the filamentous fungal taxa with the most pronounced impact on agri-cultural production and human health. The mycotoxins produced by pathogenic Fusarium not on-ly attack various plants including crops, causing various plant diseases that lead to reduced yields and even death, but also penetrate into the food chain of humans and animals to cause food poi-soning and consequent health hazards. Although sporadic studies have revealed some of the bio-synthetic pathways of Fusarium toxins, they are insufficient to satisfy the need for a comprehen-sive understanding of Fusarium toxin production. In this study, we focused on 35 serious patho-genic Fusarium species with available genomes and systematically analyzed the ubiquity of the dis-tribution of identified Fusarium and non-Fusarium derived fungal toxin biosynthesis gene clusters (BGCs) in these species through the mining of core genes and comparative analysis of correspond-ing BGCs. Additionally, novel sesterterpene synthases and PKS_NRPS clusters were discovered and analysed. This work is the first to systematically analyze the distribution of related mycotoxin biosynthesis in pathogenic Fusarium species. These findings enhance the knowledge of mycotoxin production and provide a theoretical grounding for the prevention of fungal toxin production us-ing biotechnological approaches.

The goal of this study is to categorize stakeholders in Internet of Things (IoT) security based on their roles in order to address the challenges associated with managing the large amount of data generated by IoT devices. With the increasing number of connected devices, the security risks also escalate, necessitating skilled stakeholders to mitigate these risks and prevent potential attacks. This study proposes a two-part approach that involves clustering stakeholders according to their responsibilities and determining relevant features to enhance decision-making. By grouping stakeholders into shared categories, the study aims to provide a more efficient and effective method for managing IoT security. The insights gained from this research will not only benefit stakeholders involved in IoT security but also assist policymakers and regulators in developing effective strategies.

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.

In the field of machine learning, cluster analysis has always been a very important technology for determining useful or implicit characteristics in the data. However, the current mainstream cluster analysis algorithms require comprehensive analysis of the overall data to obtain the best parameters in the algorithm. As a result, handling large-scale datasets would be difficult. This research proposes a distributed related clustering mechanism for Unsupervised Learning, which assumes that if adjacent data are similar, a group can be formed by relating to more data points. Therefore, when processing data, large-scale datasets can be distributed to multiple computers, and the correlation of any two datasets in each computer can be calculated simultaneously. Later, results are processed through aggregation and filtering before assembled into groups. This method would greatly reduce the pre-processing and execution time of the dataset; in practical application, it only needs to focus on how the relevance of the data is designed. In addition, the experimental results show the accuracy, applicability, and ease of use of this method.

In order to meet the national energy saving goals set in the Vietnam National Energy Efficiency Program in the period of 2019 – 2030 (VNEEP), the Vietnamese government has adopted a series solutions and policies to improve energy efficiency. The Vietnam’s 63 provinces will be as main actor for the national achievement in energy efficiency. Thus, understanding the province’s potentiality of energy efficiency is useful for the harmonious and sustainable development between the economy and energy systems. In this study, provincial and national data from General Statistic Office are analyzed in terms of the energy efficiency levels. With the trends of economic development and energy consumption in both national and regional levels, the Lorenz curve between Vietnamese energy consumption and GDP is investigated. The Lorenz coefficient shows the energy allocation is nether reasonable nor balanced. By using clustering method, the 63 provinces of Vietnam clustered into 7 groups that the provinces in the cluster has the similar indexes of energy efficiency i.e. ability, responsibility, potential and difficulty. The energy consumption and GDP are predicted in the period of 2019 – 2025. Based on the difference of GDP development and energy consumption levels, the target of energy efficiency for each province through clustering is set. The results show that 33 provinces included in the cluster 1, 2, 3, 4 and 6 are heavy contribution. Among them, the provinces in the cluster 2 and 3 need to focus on the industry sector in their energy saving policy. The cluster 7 included the under-developed provinces can learn development’s experiences of the provinces in the cluster 1, 2, 3 and 4 to find the best way of their future development.

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].

We developed a temporal population receptive field model to differentiate the functional and hemodynamic responses in the human LGN. The hemodynamic response of the human LGN is dominated by the richly vascularized hilum, a structure that serves as a point of entry for blood vessels entering the LGN and supplying the substrates of central vision. The location of the hilum along the ventral surface of the LGN and the resulting gradient in the amplitude of the hemodynamic response across the extent of the LGN has made it difficult to segment the human LGN into its more interesting magnocellular and parvocellular regions that represent two distinct visual processing streams. Here, we show that an intrinsic clustering of the LGN responses to a variety of visual input reveals the hilum, and further that this clustering is dominated by the amplitude of the hemodynamic response. We introduce a temporal population receptive field model that includes both a sustained and transient temporal impulse response. When we account for the hemodynamic amplitude, we demonstrate that this temporal response model is able to functionally segregate the residual responses according to their temporal properties.

Early detection of cervical cancer is the need of the hour to stop the fatality from this disease. There have been various CAD approaches in the past that promise to detect cervical cancer in an early stage, each of them having some constraints.This study proposes a novel ensemble deep learning model, VLR (variable learning rate), aimed at enhancing the accuracy of cervical cancer classification. The model architecture integrates VGG16, Logistic Regression, and ResNet50, combining their strengths in an offbeat ensemble design. VLR learns in two ways: firstly, by dynamic weights from three base models, each of them trained separately; secondly, by attention mechanisms used in the dense layer of the base models. Hyperparameter tuning is applied to further reduce loss, fine tune the model’s performance, and maximize classification accuracy. We performed K-fold cross-validation on VLR to evaluate any improvements in metric values resulting from hyperparameter fine tuning. We have also validated our model on images captured in three different solutions and on a secondary dataset. Our proposed VLR model outperformed existing methods in cervical cancer classification, achieving a remarkable training accuracy of 99.95% and a testing accuracy of 99.89%.

The purpose of this article is to study a proposal for image processing and machine learning techniques to detect the pest Aleurothrixus floccosus in citrus in the area of Pedregal de Arequipa, Peru. Thus, in the collection of images a type of simple random sampling is adopted for the decrease of the bias in different citrus trees alternating and extracting leaves from the plantation also applying image processing techniques for noise reduction and edge smoothing, segmentation for the detection of the target and using machine learning algorithms that aims to perform the classification of the images, a methodology for the detection of the white fly or Aleurothrixus floccosus is achieved. It is necessary to understand that in the development of the article, it was possible to identify three stages of the pest in the plant, these being the presence of yellow areas, leaf rolling, and secretion of melase, likewise in the process it was possible to obtain a sample of 1200 images.

The Internet of Things (IoT) is a promising technology for sensing and monitoring the environment to reduce disaster impact. Energy is one of the major concerns for IoT devices, as sensors used in IoT devices are battery-operated. Thus, it is important to reduce energy consumption, especially during data transmission in disaster-adverse situations. Clustering-based communication helps reduce a node’s energy decay during data transmission and enhances the network’s lifetime. Many hybrid combination algorithms are proposed for clustering and the routing protocol to improve the network lifetime in disaster scenarios. However, the performance of these protocols is widely varied based on the underlying network configuration and the optimisation parameters considered. In this research, we have used the clustering parameters that are most relevant to disaster scenarios, such as the node’s residual energy, distance to sink, and network coverage. Then, we proposed a bio-inspired hybrid (BAO-PSO) algorithm where the Butterfly Optimisation Algorithm (BOA) is used for clustering and Particle Swarm Optimisation (PSO) is used for the routing protocol. The performance of the proposed algorithm is compared with the benchmark protocols LEACH, DEEC, PSO, PSO-GA, and PSO-HAS. Residual energy, network throughput, and network lifetime are considered performance matrices. The simulation result showed that the proposed algorithm increases network lifetime by 10%-20% by comparison with the benchmark algorithm.

The last-mile logistics in cities have become an indispensable part of the urban logistics system. This study aims to explore the effective selection of last-mile logistics nodes to enhance the efficiency of logistics distribution, strengthen the corporate distribution image, and further reduce corporate operating costs and alleviate urban traffic congestion. This paper proposes a clustering-based approach to identify urban logistics nodes from the perspective of geographic information fusion. This method comprehensively considers several key indicators, including the coverage, balance, and urban traffic conditions of logistics distribution. Additionally, we employed a greedy algorithm to identify secondary nodes around primary nodes, thus constructing an effective nodal network. To verify the practicality of this model, we conducted an empirical simulation study using the logistics demand and traffic conditions in the Xianlin District of Nanjing. This research not only identified the locations of primary and secondary logistics nodes but also provided a new perspective for constructing the urban last-mile logistics system, enriching the academic research related to logistics node construction. The results of this study are of significant theoretical and practical importance for optimizing urban logistics networks, enhancing logistics efficiency, and promoting the improvement of urban traffic conditions.

Vehicular traffic in urban areas continues to be a constant challenge today, due to the continuous population growth and the increase of vehicles in circulation. Vehicular congestion, as a recurrent problem, generates a negative impact on urban mobility and citizens’ quality of life. It is hypothesized that a dynamic clustering method of vehicle trajectory data can provide an accurate and up-to-date representation of real-time traffic behavior. To evaluate this hypothesis, data were collected from three different cities: San Francisco, Rome and Guayaquil. A dynamic clustering algorithm was applied to identify traffic congestion patterns and an indicator was applied to identify and evaluate the congestion conditions of the areas. The results show a high precision and recall in congestion classification compared to a method based on static cells.

The process of testing software is examining the artifacts and behavior of the software under test by validating and verifying it. Testing can provide valuable information about the software. Given an input to the system, there is a challenge of distinguishing correct from potentially incorrect behavior, which is the test oracle problem. Although the combinatorial testing approach can effectively reduce the number of test cases, the manual inspection of the outputs is still required. In this paper, we propose an approach to automatically classify the return pages with conducting combinatorial testing based on page similarities and hierarchical clustering, by which potential output anomalies can be identified. In the experiment, we apply our approach to a real-world e-commerce website, an anomaly can be found with the visualization of the clustering hierarchy, which suggests the potential of the applicability of the approach.

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.

The human interferon-induced transmembrane (IFITM) proteins inhibit the fusion of a broad spectrum of enveloped viruses, both when expressed in target cells and when present in infected cells. Upon expression in infected cells, IFITMs incorporate into progeny virions and reduce their infectivity by a poorly understood mechanism. Since only a few Env glycoproteins are present on HIV-1 particles, and Env clustering has been proposed to be essential for optimal infectivity, we asked if IFITM protein incorporation modulates HIV-1 Env clustering. The incorporation of two members of the IFITM family, IFITM1 and IFITM3, into HIV-1 pseudoviruses verified by Western blotting correlated with a marked reduction of infectivity. Super-resolution imaging of Env distribution on single HIV-1 pseudoviruses did not reveal significant effects of IFITMs on Env clustering. However, IFITM3 markedly reduced the Env processing and incorporation into virions relative to control and IFITM1-containing viruses. These results suggest that IFITM1 and IFITM3 restrict progeny HIV-1 infectivity via distinct mechanisms. We propose that IFITM1 interferes with viral fusion by altering the properties of the viral membrane or Env functionality by means other than disrupting Env clusters, while IFITM3 also targets Env processing and incorporation into progeny virions.

The global prevalence of type 2 diabetes mellitus (T2DM) has surged in recent decades and the identification of differential glycemic responders can aid tailored treatment for prevention of pre-diabetes and T2DM. A mixed meal tolerance test (MMTT) based on regular foods offers potential to uncover differential responders in dynamical postprandial events. We aimed to fit a simple mathematical model on dynamic postprandial glucose data from repeated MMTTs among partic-ipants with elevated T2DM risk, to identify response clusters and investigate their association with T2DM risk factors and gut microbiota. Data were used from a 12-week multi-center dietary inter-vention trial involving high-risk T2DM adults, comparing high- versus low-glycemic index foods within a Mediterranean diet context (MEDGICarb). Model-based analysis of MMTTs from 155 participants (81 females, 74 males) revealed two distinct plasma glucose response clusters that were associated with baseline gut microbiota. Cluster A, inversely associated with HbA1c and waist circumference and directly with insulin sensitivity, exhibited a contrasting profile to cluster B. Findings imply that a standardized breakfast MMTT using regular foods could effectively distin-guish non-diabetic individuals at varying risk levels for T2DM using a simple mechanistic model.

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.

Current State-of-the-Art (SotA) chatbots are able to produce high quality sentences, handling different conversation topics, and larger interaction times. Unfortunately, the generated responses highly depend on the data on which they have been trained, the specific dialogue history and current turn used for guiding the response, the internal decoding mechanisms, ranking strategies, among others. Therefore, it may happen that for semantically similar questions asked by users, the chatbot may provide a different answer, which can be considered as a form of hallucination or produce confusion in long-term interactions. In this research paper, we propose a novel methodology consisting of two main phases: a) hierarchical automatic detection of topics and subtopics in dialogue interactions using a Zero-Shot learning approach, and b) detecting inconsistent answers using K-Means and the Silhouette coefficient. To evaluate the efficacy of topic and subtopic detection, we used a subset of the DailyDialog dataset and real dialogue interactions gathered during the Alexa Socialbot Grand Challenge 5 (SGC5). The proposed approach enables detecting up to 18 different topics and 102 subtopics. For the purpose of detecting inconsistencies, we manually generate multiple paraphrased questions and employ several pre-trained SotA chatbot models to generate responses. Our experimental results demonstrate a weighted F-1 value of 0.34 for topic detection, a weighted F-1 value of 0.78 for subtopic detection in DailyDialog, then 81% and 62% accuracy for topic and subtopic classification in SGC5; finally, to predict the number of different responses, we obtained a mean squared error (MSE) of 3.4 when testing smaller generative models and 4.9 in recent large language models.

Extensive growth in the volume of irregular brain cells is known as brain tumor. Human brain is surrounded by stiff skull. There are various issues that occur due to the growth of any tumor inside this restricted space. The malignant and benign are two main categories of the brain tumor. The skull is pressurized to enlarge from inside in case of growth of any benign or malignant tumor. This tumor leads to harm in brain and it may be dangerous to life also. The brain tumor is divided into two kinds - primary or secondary. The brain tumor detection techniques have various phases. In this paper, comparative study of CNN with GLCM approach and superpixel based spectral clustering is done tumor. This work takes into account metrics like accuracy, sensitivity and specificity for drawing the comparison between both the techniques.

Bounce Back Loan is amongst a number of UK business financial support schemes launched by UK Government in 2020 amidst pandemic lockdown. Through these schemes, struggling businesses are provided financial support to weather economic slowdown from pandemic lockdown. £43.5bn loan value has been provided as of 17^th Dec2020. However, with no major checks for granting these loans and looming prospect of loan losses from write-offs from failed businesses and fraud, this paper theorizes prospect of applying spatiotemporal modelling technique to explore if geospatial patterns and temporal analysis could aid design of loan grant criteria for schemes. Application of Clustering and Visual Analytics framework to business demographics, survival rate and Sector concentration shows Inner and Outer London spatial patterns which historic business failures and reversal of the patterns under COVID-19 implying sector influence on spatial clusters. Combination of unsupervised clustering technique with multinomial logistic regression modelling on research datasets complimented by additional datasets on other support schemes, business structure and financial crime, is recommended for modelling business vulnerability to certain types of financial market or economic condition. The limitations of clustering technique for high dimensional is discussed along with relevance of an applicable model for continuing the research through next steps

In the last two decades, there have been massive advancements in high throughput technologies, which resulted in the exponential growth of public repositories of gene expression datasets for various phenotypes. It is possible to unravel biomarkers by comparing the gene expression levels under different conditions, such as disease vs. control, treated vs. not treated, drug A vs. drug B, etc. This problem refers to a well-studied problem in the machine learning domain, i.e., the feature selection problem. In biological data analysis, most of the computational feature selection methodologies were taken from other fields, without considering the nature of the biological data. For gene expression data analysis, most of the existing feature selection methods rely on expression values alone to select the genes; and biological knowledge is integrated at the end of the analysis in order to gain biological insights or to support the initial findings. Thus, integrative approaches that utilize the biological knowledge while performing feature selection are necessary for this kind of data. The main idea behind the integrative gene selection process is to generate a ranked list of genes considering both the statistical metrics that are applied to the gene expression data, and the biological background information which is provided as external datasets. Since the integrative approach attracted attention in the gene expression domain, lately the gene selection process shifted from being purely data-centric to more incorporative analysis with additional biological knowledge.

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.

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.

In recent years, governments applied intelligent transportation system (ITS) technique to provide several convenience services (e.g., garbage truck app) for residents. This study proposes a garbage truck fleet management system (GTFMS) and data feature selection and data clustering methods for travel time prediction. A GTFMS includes mobile devices (MD), on-board units, fleet management server, and data analysis server (DAS). When user uses MD to request the arrival time of garbage truck, DAS can perform the procedure of data feature selection and data clustering methods to analyses travel time of garbage truck. The proposed methods can cluster the records of travel time and reduce variation for the improvement of travel time prediction. After predicting travel time and arrival time, the predicted information can be sent to user’s MD. In experimental environment, the results showed that the accuracies of previous method and proposed method are 16.73% and 85.97%, respectively. Therefore, the proposed data feature selection and data clustering methods can be used to predict stop-to-stop travel time of garbage truck.

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need of prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

Optical communication systems pose significant challenges, including the effects of nonlinear noises. The nonlinearities, including Kerr-induced phase noise, become more problematic in m-QAM as the orden of the format increases becoming a highly densed set of data-symbols and therefore, requiring advanced signal processing for successful separation of symbols at the demodulation stage. Machine learning techniques have recently been applied to improve signal integrity in such scenarios. This paper explores the application of a spectral clustering algorithm adapted to deal with data streaming to mitigate nonlinear noise in long-haul optical channels dominated by nonlinear phase noise, offering a promising solution to a pressing issue. We demonstrate that the spectral clustering algorithm outperforms the k-means algorithm in the face of nonlinear phase noise in -90, -100, and -110 dBc/Hz scenarios at 1 MHz in a simulated 10 GHz symbol rate channel.

Transport systems are essential in the path towards sustainable urbanisation and the transition to more sustainable living. Recently, European cities have undergone substantial changes, owing to which suburbanisation is posing new challenges. Suburban areas are often more affordable in terms of housing, but their neighbourhoods tend to be car-oriented. This leads to higher commuter costs, immobility, transport and time poverty, pollution, and accident rates and a lack of social interaction. To offer sustainable mobility options to citizens, we must comprehensively understand their specific mobility practices, together with their personal characteristics, and the built environment. This study centred on the Barcelona Metropolitan Region, which has a public transport network that covers the entire area. The aim of this study was to examine the relationship between travel behaviour, transport mode use, individual characteristics, and place of residence, using detailed information sources. Herein, we used data from the annual travel survey conducted in the Barcelona region from 2018 to 2021, together with land-use and other information sources. Our findings suggest that transport policies have encouraged sustainable mobility practices, particularly in the centre of Barcelona. Despite the positive results, considerable disparities exist between the inner and outer city, with notably decreased sustainable mobility practices in the latter. Our results indicate that promoting sustainable mobility policies requires further changes in transport, city, and land-use planning that consider equity, the socioeconomic profile of citizens, and mixed urban planning.

The increasing importance of hydropower generation has led to the development of new smart technologies and the need for reliable and efficient equipment in this field. As long as hydropower power plants are more complex to build up than other power plants, the operation regimes and maintenance activities become essential for the hydropower companies to optimize their performance, such that including the data-driven approaches in the decision-making process represents a challenge. In the paper, a comprehensive and multi-task framework integrated into a Knowledge Discovery module based on Data Mining to support the decisions of the operators from the control rooms and facilitate the transition from the classical to smart Supervisory Control and Data Acquisition (SCADA) system in hydropower plants has been designed, developed, and tested. It integrates tasks related to detecting the outliers through advanced statistical procedures, identifying the operating regimes through the patterns associated with typical operating profiles, and developing strategies for loading the generation units that consider the number of operating hours and minimize the water amount used to satisfy the power required by the system. The proposed framework has been tested using the SCADA system's database of a hydropower plant belonging to the Romanian HydroPower Company. The framework can offer the operators from the control room comparative information for a time horizon longer than one year. The tests demonstrated the utility of a Knowledge Discovery module to ensure the transition toward smart SCADA systems that will help the decision-makers improve the management of the hydropower plants.

Background: Gait analysis systems are crucial for rehabilitation but are often time-consuming and less accessible in low and middle-income countries like Brazil. GAITWell^® was developed to address these challenges with its modular and portable design for automated gait data extraction and analysis. This study evaluates its methodological properties. Methods: GAITWell^® uses discrete binary sensors on interconnected plates to collect gait data, analyzed via the DBSCAN algorithm. Each plate measures 44 cm x 37 cm and features an 11 x 7 discrete sensor array with 4 cm spacing. Test-retest reliability was assessed using the intraclass correlation coefficient (ICC), standard error of the mean (SEM), and Bland-Altman plots. Concurrent validity was evaluated by comparing the GAITWell^® measurements with those obtained from the Qualisys Pro-Reflex through correlations. Results: Participated 38 healthy young adults, including 18 females (47.4%). The sample had an average age of 33.2 years (SD 13.0) and an average BMI of 26.6 kg/m² (SD 5.4). Correlations between GAITWell^® and Qualisys ranged from moderate to very high for most gait variables, except stride length (r = .360, p < .05). ICC_2,1 showed moderate to good agreement for most variables, except for double support times, cadence, and base of support. Preliminary analysis suggests that increasing the sensor resolution to 1.2 cm x 1.2 cm could potentially decrease the measurement error from 2 cm to 0.6 cm, representing a theoretical reduction of 70%. Conclusions: While low resolution affected GAITWell^® reliability, it remains a promising tool. Future research should focus on enhancing sensor accuracy to improve reliability.

Mediterranean countries are a cauldron of cultural exchange, with a strong emphasis on wild plants in cuisine traditions. Many of these plants belong to the family Apiaceae. The common climate determines the common range of distribution. While many plants have wide distribution, the range of distribution of others is restricted to Western Mediterranean or North Africa. This review investigates wild plants from the family Apiaceae traditionally used as food in 13 study sites - 11 countries in the Mediterranean and adjacent territories - the mainland and 3 islands. The aim is to trace patterns of native distribution versus consumption. As a result, 81 wild umbellifers are listed, traditionally used as food. Their consumption and distribution patterns are described and discussed. Interestingly in 8 of the 13 study sites (61.5%) are recorded 50 plants (66.7% of all wild umbellifers, traditionally used as food) which are consumed in only one particular country. These are as follows: 8 taxa in Morocco, 9 taxa in Spain, 2 taxa in Sicily, 3 taxa in Bulgaria 3 taxa in Crete, 8 taxa in Armenia, 14 taxa in Turkey, and 3 taxa in Jordan. However, these 50 restrictedly consumed plants are distributed in more than one country (except 15 taxa, which are endemics). Many of the plants that are used in certain countries are not consumed by the neighboring people. The results of the two statistical tests, namely Jaccard index and heatmap clustering (double dendrogram) are discussed. The presence of an outlier, such as Bulgaria, which shares borders, history, and culture with Greece and Turkey, emphasizes the importance of local climate on plant distribution and consumption over cultural interactions. The same was observed for some pairs of countries, such as Spain and Morrocco and Turkey and Armenia, although they had the highest number of common plants, that are both distributed and consumed as food.

In this project the EEG – electroencephalogram - channel(s) will be characterized to diagnose PTSD – Post-traumatic stress disorder – cases. For this aim, we applied boosting methods including a combination of K-mean and Support Vector Machine (SVM) models to find the feature weights to detect the PTSD cases. We classified 32 channels of 12 subjects including 6 PTSD and 6 healthy controls using a 6-mean classifier. The linear SVM found the weights of distinguished channels within each subject for each cluster. It was found that the significant SVM weights of F4, F8, and Pz are smaller in PTSD than in healthy subjects. This new method can be used as a tool to better understand the interaction of EEG signals and diagnosis.

Advances in technology have introduced remarkable capabilities, particularly in the realm of gathering and accessing vast amounts of data, which has led to the emergence of the "Big Data" era, presenting exciting opportunities to harness the wealth of the generated information. Traffic management centers comprise a stakeholder that can exploit such data towards improving road network operation. This research, explores the utilization of real traffic data, collected by distinct sources on an interurban motorway: static location based aggregate traffic data and probe vehicle data. The first is collected by traffic detectors, while the second involves patrol vehicles’ GNSS data. The traffic quantity analysed is vehicle speed, while specific emphasis has been given on the ap-plication of heatmaps to represent daily traffic patterns and the utilization of k-means clustering. The performed analysis demonstrates the importance of considering spatiotemporal variables as a unified entity when analysing speed in transportation networks. The limitations of using patrol vehicles as estimators of ambient speed, especially in low and heavy traffic conditions, are deline-ated, while the dual purpose of data gathered from these vehicles towards enhancing driving performance and enabling detector maintenance is emphasized. Valuable traffic insights are offered through comprehensive spatiotemporal speed behavior analysis and data combination. The inte-gration of these techniques enhances decision-making for a streamlined and secure transportation system

Determining accurate PM2.5 pollution concentrations and understanding their dynamic patterns is crucial for scientifically informed air pollution control strategies. Traditional reliance on linear correlation coefficients for ascertaining PM2.5 related factors only uncovers superficial relationships. Moreover, the invariance of conventional prediction models restricts their accuracy. To enhance the precision of PM2.5 concentration prediction, this study introduces a novel integrated model that leverages feature selection and a clustering algorithm. Comprising three components - feature selection, clustering, and integrated prediction, the model first employs the non-dominated sorting Genetic Algorithm (NSGA-III) to identify the most impactful features affecting PM2.5 concentration within air pollutants and meteorological factors. This step offers more valuable feature data for subsequent modules. The model then adopts a two-layer clustering method (SOM+K-means) to analyze the multifaceted irregularity within the dataset. Finally, the model establishes the Extreme Learning Machine (ELM) weak learner for each classification, integrating multiple weak learners using the Adaboost algorithm to obtain a comprehensive prediction model. Through feature correlation enhancement, data irregularity exploration, and model adaptability improvement, the proposed model significantly enhances the overall prediction performance. Data sourced from 12 Beijing-based monitoring sites in 2016 were utilized for an empirical study, and the model's results compared with five other predictive models. The outcomes demonstrate that the proposed model significantly heightens prediction accuracy, offering useful insights and potential for broadened application to multifactor correlation concentration prediction methodologies for other pollutants.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

The rising global population amidst the growing concerns of climate change will have a dire consequence on global food security and socio-economic activities. Wheat is one of the most important staple foods consumed by more than four billion people in the world, but climate change impacts account for a decline of 5.5% in wheat yield and predictions indicate that the production could further dwindle by nearly 30% in 2050, due to trends in temperature, precipitation, and carbon dioxide. An effective annual crop estimate is necessary not only to inform government the status of national food security, but also is used to determine the benchmark on which agricultural commodities are priced in the market. Thus, annual crop monitoring and yield estimate is paramount to determine the amount of wheat imports required to make up for the shortfalls in the national wheat production in South Africa, which has been a net importer of wheat since 1998. A joint project between South Africa and Poland investigated satellite based-crop growth monitoring using Sentinel 2 and determined the most distinguishable crop phenology for an accurate winter wheat classification during the growing season from August – December with Random Forest (RF) algorithm. The winter wheat crop was more accurately identified during the crop ‘heading’ stage in October yielding the highest user’s (75.56%) and producer’s (92.52%) accuracies, despite the relatively lower overall accuracy (78.14%) compared to that of December with OA of 83.58% obtained during the maturity stage. This study, therefore, confirms the suitability of sentinel 2 for an effective phenology-based winter wheat crop classification during the heading stage, reducing the ambiguity of spectral confusion created with surrounding grass and maize crops.

We present a hierarchical reinforcement learning (RL) architecture that employs various low-level agents to act in the trading environment, i.e. the market. The highest level agent selects among a group of specialised agents, and then the selected agent decides when to sell or buy a single asset for some period. This period can be variable according to a termination function. We hypothesized that due to different market regimes, more than one single agent is needed when trying to learn from such heterogeneous data, and instead, multiple agents will perform better, with each one specialising in a subset of the data. We use $k-means$ clustering to partition the data and train each agent with a different cluster. Partitioning the input data also helps model-based RL (MBRL), where models can be heterogeneous. We also add two simple decision-making models to the set of low-level agents, diversifying the pool of available agents and thus increasing overall behaviour flexibility. We perform multiple experiments showing the strengths of a hierarchical approach and test various prediction models at both levels. We also use a risk-based reward at the high level, which transforms the overall problem into a risk-return optimization. This type of reward shows a significant reduction in risk while minimally reducing profits. Overall, the hierarchical approach shows significant promise, especially when the pool of low-level agents is highly diverse.

Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph regularized Lp smooth nonnegative matrix factorization (HGSNMF), by incorporating hypergraph regularization and Lp smoothing constraint terms into the standard NMF. The hypergraph regularization term can capture the intrinsic geometry structure of the high dimension space data more comprehensively than simple graph, the Lp smoothing constraint may yield a smooth and more accurate solution to the optimization problem. The updating rules are given using multiplicative update techniques, and the convergence of HGSNMF is theoretically investigated. The experimental results on four different data sets show that the proposed method has better clustering effect than the related state-of-the-art methods in the vast majority of cases.

In today's world, news events are emerging incessantly. Classifying the same event reported by different countries is of significant importance for public opinion control and intelligence gathering. Due to the diverse types of news, relying solely on translators would be costly and inefficient, while depending solely on translation systems would incur considerable performance overheads in invoking translation interfaces and storing translated texts. To address this issue, we mainly focus on the clustering problem of cross-lingual news. To be specific, we use a combination of sentence vector representations of news headlines in a mixed semantic space and the topic probability distributions of news content to represent a news article. In the training of cross-lingual models, we employ knowledge distillation techniques to fit two semantic spaces into a mixed semantic space. We abandon traditional static clustering methods like K-Means and AGNES in favor of the incremental clustering algorithm Single-Pass, which we further modify to better suit cross-lingual news clustering scenarios. Our main contributions are as follows: (1) We adopt the English standard BERT as the teacher model and XLM-Roberta as the student model, training a cross-lingual model through knowledge distillation that can represent sentence-level bilingual texts in both Chinese and English. (2) We use the LDA topic model to represent news as a combination of cross-lingual vectors for headlines and topic probability distributions for content, introducing concepts such as topic similarity to address the cross-lingual issue in news content representation. (3) We adapt the Single-Pass clustering algorithm for the news context to make it more applicable. Our optimizations of Single-Pass include adjusting the distance algorithm between samples and clusters, adding cluster merging operations, and incorporating a news time parameter.

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

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.

Brain tissue segmentation is an important component of clinical diagnosis of brain diseases by means of multi-modal magnetic resonance imaging (MR). Brain tissue segmentation is developed by many unsupervised methods in literature. The most commonly used unsupervised methods are: K-Means, Expectation Maximization and Fuzzy Clustering. Fuzzy clustering methods offer considerable benefits compared with the aforementioned methods as they are capable of handling brain images which are complex, largely uncertain and imprecise in nature. However, this approach suffers from the intrinsic noise and intensity inhomogeneity (IIH) in the data resulted from the acquisition process. To resolve these issues, we propose a fuzzy consensus clustering algorithm that defines a membership function resulted from a voting schema to cluster the pixels. In particular, we first pre-process the MRI data and employ several segmentation techniques based on traditional fuzzy sets and intuitionistic sets. Then, we adopted a voting schema to fuse the results of the applied clustering methods. Finally, to evaluate the proposed method, we used the well-known performance measures (boundary measure, overlap measure and volume measure) on two publicly available datasets (OASIS and IBSR18). The experimental results show the superior performance of the proposed method in comparison with the recent state of the arts.

A comprehensive presentation of a variety of biologically sounding properties of genomes is present; chloroplast genomes are used as a biological matter. Triplet frequency composition is the general issue standing behind the properties. Besides, the new alignment-free error-tolerant method of sequences comparison highly efficient for in/del mismatches is present, for transposons search. Triplet frequency dictionaries determined for a genome, or for a part of that latter were studied through various clustering techniques. The interplay between triplet composition and function reveals on tRNA genes unambiguously shows the prevalence of the function encoded in tRNA gene over the phylogeny: the genes gather into the clusters comprising the genes encoding the same amino acid; more exactly, few gene families exhibit fine cluster pattern corresponding the synonymous codons of amino acid. Previously reported symmetry in chloroplast genomes is shown for a set of gymnosperm: that is mirror symmetry, rotational symmetry, and the second Chargaff's parity rule asymmetry. A family of transposons was found in gymnosperm chloroplast genomes. This family is revealed through the novel comparison method based on convolution calculation, for a set of DNA sequences.

Oleraceins are a class of indoline amide glycosides found in Portulaca oleracea L. (Portulacaceae), or purslane. These compounds are characterized with 5,6-dihydroxyindoline-2-carboxylic acid N-acylated with cinnamic acid derivatives, and many are glucosylated. Herein, hydromethanolic extracts of the aerial parts of purslane were subjected to UHPLC-Orbitrap-HRMS analysis, conducted in negative ionization mode. Diagnostic ion filtering (DIF), followed by diagnostic difference filtering (DDF), were utilized to automatically filter out MS data and select plausible oleracein structures. After an in-depth MS2 analysis, a total of 51 oleracein compounds were tentatively identified. Of them, 26 had structure matching one of already known oleraceins and the other 25 are new, undescribed in the literature structures, belonging to the oleracein class. Moreover, diagnostic fragment ions were selected, based on which clustering algorithms and visualizations were employed. As we demonstrate, clustering methods can provide valuable insights into the mass fragmentation elucidation of natural compounds in complex mixtures.

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.

As air traffic demand grows, robust, data-driven anomaly detection methods are required to ensure that aviation systems become safer and more efficient. The terminal airspace is identified as the most critical airspace for both individual flight-level and system-level safety and efficiency. As such, developing data-driven anomaly detection methods to analyze terminal airspace operations is paramount. With the expansion of ADS-B technology, open-source flight tracking data has become more readily available to enable larger-scale analyses of aircraft operations. This paper makes a distinction between spatial metrics in ADS-B trajectory data and energy metrics derived from ADS-B trajectory data. Motivated by the limited number of approaches that simultaneously consider both spatial and energy metrics, this paper introduces the concepts of spatial anomalies and energy anomalies. In particular, it proposes a novel, unified framework for detection of spatial and energy anomalies in ADS-B trajectory data (and associated derived metrics). The framework consists of three main parts - a data processing procedure, a spatial anomaly detection method, and an energy anomaly detection method. The framework is demonstrated utilizing four months of ADS-B trajectory data associated with arrivals at San Francisco International Airport, and the relationship between the spatial and energy anomalies in this terminal airspace is explored. The results that stem from the implementation of this framework indicate that if an aircraft is spatially not conforming to an identified set of air traffic flows representing standard spatial operations, then this aircraft is more likely to experience non-conformance to standard operations in its energy metrics. Aviation operators, such as air traffic controllers, may benefit from this observation, as it may factor into decision-making in instances where there is the potential to instruct an aircraft to spatially deviate from standard operations. Additionally, this research revealed underlying differences between trajectories that are spatially nominal yet energy-anomalous and those trajectories that are spatially anomalous and energy-anomalous. Focusing solely on energy anomaly detection does not provide insight into potential spatial-related decisions that may have been made to result in off-nominal energy behavior.

Pattern recognition has long been regarded as key role for crime prevention and reduction. Crime analysts and policy makers can formulate effective strategies and allocate resources with reference to spatial and temporal pattern of crime. In order the combat and prevent severe crime in New York City (NYC), this study analyzed Felony Crime data of NYC in previous 5 years (2015 2020) and discovered criminal hotspots pattern and temporal patterns with open criminal complaint data provided by New York Police Department (NYPD). This study adapt a human computer interactive appraoch to draw patterns from crime data, whereas computations and visualization are performed by Python libraries, and human to inform the decision of visualization methods, computational parameters and direction of this exploratary analysis. Density based clustering algorithms, Grid Thematic Mapping and Density Heatmap are displayed to identify hotspots and demonstrates their associations with spatial features. Timeline analysis on moments of crime occurance demonstrates seasonality where crimes are mostly commited, while aoristic analysis showed hours of day when crime is mostly committed considering their timespan. Lastly, 3D visualization improved recognition of the displacement of hotspot over time, and suggested long term hotspots in NYC in 3 D visualization. This inform strategic plans for police deployment.

In document forensic, Ink mismatch relays very important information about forgeries in this way we can find out the authenticity of documents. Finding out and distinguishing these unique inks from the multispectral document is very challenging task. In this paper we proposed the method to identify the inks using clustering. We used K-Mean clustering instead of widely known Fuzzy C-Means Clustering (FCM) and successfully identity the number of inks. For the purpose of optimizing and improving our results we used two optimization techniques such as Elbow and silhouette optimization techniques.