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.

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.

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

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.

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.

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.

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.

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.

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.

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.

This paper describes a memory model with 3 levels of information. The lower-level stores source data, is Markov-like and unweighted. Then a middle-level ontology is created from a further 3 phases of aggregating source information, by transposing from an ensemble to a hierarchy at each level. The ontology is useful for search processes and the aggregating process transposes the information from horizontal set-based sequences to more vertical typed-based clusters. The base memory is essentially neutral, where any weighted constraints or preferences should be sent by the calling module. This therefore allows different weight sets to be imposed on the same linking structure. The success of the ontology typing is open to interpretation, but the author would suggest that when clustering text, the result was types based more on use and context, for example, 'linking' with 'structure' or 'provide' with 'web,' for a document describing distributed service-based networks. This allows the system to economise over symbol use, where links to related symbols will be clustered together. The author then conjectures that a third memory substrate would be more neural in nature and would include functions or operations to be performed on the data, along with related memory information.

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.

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.

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.

The ongoing outbreak of the novel coronavirus pneumonia (also known as COVID-19) has triggered a series of stringent control measures in China, such as city closure, traffic restrictions, contact tracing and household quarantine. These containment efforts often lead to changes in the contact pattern among individuals of the population. Many existing compartmental epidemic models fail to account for the effects of contact structure. In this paper, we devised a pairwise epidemic model to analyze the COVID-19 outbreak in China based on confirmed cases reported during the period February 3rd--17th, 2020. By explicitly incorporating the effects of family clusters and contact tracing followed by household quarantine and isolation, our model provides a good fit to the trajectory of COVID-19 infections and is useful to predict the epidemic trend. We obtained the average of the reproduction number $R=1.494$ ($95\%$ CI: $1.483-1.507$) for Hubei province and $R=1.178$ ($95\%$ CI: $1.145-1.158$) for China (except Hubei), suggesting that some existing studies may have overestimated the reproduction number by neglecting the dynamical correlations and clustering effects. We forecasted that the COVID-19 epidemic would peak on February 13th ($95\%$ CI: February $9-17$th) in Hubei and 6 days eariler in the regions outside Hubei. Moreover the epidemic was expected to last until the middle of March in China (except Hubei) and late April in Hubei. The sensitivity analysis shows that ongoing exposure for the susceptible and population clustering play an important role in the disease propagation. With the enforcement of household quarantine measures, the reproduction number $R$ effectively reduces and epidemic quantities decrease accordingly. Furthermore, we gave an answer to the public concern on how long the stringent containment strategies should maintain. Through numerical analysis, we suggested that the time for the resumption of work and production in China (except Hubei) and Hubei would be the middle of March and the end of April, 2020, respectively. These constructive suggestions may bring some immeasurable social-economic benefits in the long run.

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

Due to the influence of background conditions, lighting conditions, occlusion issues and the image resolution, how to extract robust person features is one of the difficulties in ReID research. Vision in Transformers (ViT) has achieved significant results in the field of computer vision. However, the existing problems still limit its application in ReID due to slow extraction of person features and difficulty in utilizing local features of people. To solve the mentioned problems, we utilize Pyramid Vision Transformer (PVT) as the backbone of feature extraction and propose a PVT-based ReID method in conjunction with other studies. Firstly, some improvements suitable for ReID are used on the PVT backbone, and we establish a basic model by using powerful methods verified on CNN-based ReID. Secondly, in an effort to further promote the robustness of the person features extracted by the PVT backbone, two new modules are designed. (1) The local feature clustering (LFC) is recommend to enhance the robustness of person features by calculating the distance between local features and global feature to select the most discrete local features and clustering them. (2) The side information embeddings (SIE) are used to encode non-visual information and send it into the network for training to reduce its impact on person features. Finally, the experiments show that PVTReID has achieved excellent results in ReID datasets and are 20% faster on average than CNN-based ReID methods.

In the clock network design, the trade-off between power consumption and timing closure is an important and difficult issue. To achieve this target, a hybrid clock network architecture that combines both clock tree and clock mesh seems to be a promising solution. In this paper, we propose a novel clock mesh architecture – cross-mesh, with the average dispersion of the overall driving force, our methodology creates small non-zero skew clock trees. In addition, we integrate clock gating and register clustering techniques to further reduce dynamic power consumption. The proposed algorithms have four stages: cross-mesh planning, register clustering, mesh line connecting, and load balancing. Experimental results show that our methodology and algorithms get feasible solution effectively and improve both power consumption and clock skew simultaneously.

Several sun models suggest the radioactive balance where the concentration of greenhouse gases and the albedo effect are related to the Earth's surface temperature. There is a considerable increment of greenhouse gases due to anthropogenic activities. Climate change correlates with this alteration in the atmosphere and an increase in surface temperature. Efficient forecasting of climate change and its impacts of 1.5°C global warming above pre-industrial levels could be helpful to respond to the threat of c.c. and develop sustainably. Many studies have predicted the temperature change in the coming years. The global community has to create a model that can realize good predictions to ensure the best way to deal with the warming. Thus, we propose a finite-time thermodynamic (FTT) approach in the present work. The FTT can solve problems such as the faint young sun paradox. In addition, we use different machine learning models to evaluate our method and compare the experimental prediction and results.

A better understanding of background tropospheric ozone delivers multiple benefits. Robust estimates of regional background ozone assist policy makers to understand the limits to reducing ozone by controlling anthropogenic emissions alone and assist in characterising changes in the atmospheric environment and its composition. Long time series of background ozone measurements can also help quantify the influence of human activity on the global and regional atmosphere. Background tropospheric ozone measurements representative of continental air masses are however scarce in Australia, limiting our knowledge of background atmospheric composition. Here we use k-means clustering to identify a cluster of measurements from the long-term monitoring station at Oakdale, NSW which are likely to be representative of background air. The cluster is associated with NOx-limited air masses of continental origin. From this analysis we estimate background ozone representative of Eastern Australia. We find recent (2017-2022) mean ozone mixing ratios of 28.5 ppb and identify a statistically significant (α=0.05) trend in the mean of +1.8 (1.0 – 2.8) ppb/decade. Our methods demonstrate that some long-term monitoring stations within or near urban areas can provide suitable conditions and datasets for regional Global Atmosphere Watch monitoring.

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

Inflation and exchange rates have great influence on consumer prices especially on imports and exports. Exchange rate fluctuations create inefficiency and distort world prices whereas changes in inflation rates have a direct impact on consumer goods prices which incidentally include exchange rates. There is a direct interdependence between inflation and exchange rates and this paper is aimed at investigating this relationship in dynamic context. It tries to find out how changes in inflation and exchange rates impact on another by adopting the econometric and copula approaches. Both inflation and exchange rates data are susceptible to volatility clustering, possess fat tails and are skewed coupled with conditional heteroskedasticity. Hence we model the univariate distributions by using ARMA$(p,q)$-GARCH$(x,y)$ so as to capture the most important stylized features of inflation and exchange rates. A bivariate model is then constructed by coupling the marginal distributions of inflation and exchange rates using the survival Clayton copula. Empirical results from monthly inflation and exchange rates data show positive correlation between the two based on Kendall $\tau$ test which confirms that a change in inflation results in change of exchange rates an vice versa hence there is co-movement. Furthermore, by the Granger causality test, exchange rates spikes cause changes in inflation rates. The results of the study have implications on economic policy design and hedging strategies for traders on imports and exports.

We experimentally demonstrate, for the first time, blind nonlinearity compensation using the Density-Based Spatial-Clustering of Applications with Noise (DBSCAN) algorithm for a 40-Gb/s 16-quadrature amplitude modulated being transmitted at 50 km of standard single-mode fiber. At high launched optical powers, DBSCAN offers up to 0.83- and 8.84-dB enhancement in Q-factor when compared to conventional K-means clustering and linear equalization, respectively.

Authentication systems based on biometrics characteristics and data represents one of the most important trend in the evolution of our world. In the near future, biometrics systems will be everywhere in the society, such as government, education, smart cities, banks etc. Due to its uniqueness characteristic, biometrics systems will become also vulnerable, privacy being one of the most important challenge. The classic cryptographic primitives are not sufficient to assure a strong level of secureness for privacy. The following work paper represents an effort to present the main cryptographic techniques and algorithms that can give us the possibility to raise a certain level of secureness for privacy. We will show their own challenges (strengths and weaknesses). We will demonstrate how we can use the most common and well-known techniques and algorithms in order to get a maximum efficiency and a high level in assuring the integrity of the biometrics data.

Data mining plays a critical role in the sustainable decision making. The k-prototypes algorithm is one of the best-known algorithm for clustering both numeric and categorical data. Despite this, however, clustering a large number of spatial object with mixed numeric and categorical attributes is still inefficient due to its high time complexity. In this paper, we propose an efficient grid-based k-prototypes algorithms, GK-prototypes, which achieves high performance for clustering spatial objects. The first proposed algorithm utilizes both maximum and minimum distance between cluster centers and a cell, which can remove unnecessary distance calculation. The second proposed algorithm as extensions of the first proposed algorithm utilizes spatial dependence that spatial data tend to be more similar as objects are closer. Each cell has a bitmap index which stores categorical values of all objects in the same cell for each attribute. This bitmap index can improve the performance in case that a categorical data is skewed. Our evaluation experiments showed that proposed algorithms can achieve better performance than the existing pruning technique in the k-prototypes algorithm.

A lightweight composite bridge deck system composed of steel orthotropic deck stiffened with thin Ultra-High Performance Concrete (UHPC) layer is developed to eliminate fatigue cracks in orthotropic steel decks. During the construction and operation period of the bridge, the debonding between the steel deck and the UHPC layer may introduce the several issues, such as crack-induced water invasion and distinct reduction of the shear resistance. In the study, an effective and novel non-destructive interface condition monitoring approach using piezoelectric lead zirconate titanate (PZT)-based technologies is proposed to detect interfacial delamination between steel deck and UHPC layer. Experimental tests are performed on several steel-UHPC composite slabs and a conventional steel-concrete composite slab. The thin styrofoam sheets with different sizes and thicknesses are set on different locations of the steel deck as the artificial debondings. The PZT ceramic patches are bonded on the surfaces of the steel deck and UHPC layer as the actuators/sensors. An improved PSO (Particle Swarm Optimization)-K-means clustering algorithms is proposed to obtain the debonding patterns based on the feature data set. The laboratory tests demonstrate that the proposed approach provides an effective and accurate way to detect interfacial debonding of steel-UHPC composite slab.

In this paper, a land utilization efficiency evaluation model, which takes environmental loss into consideration, has been structured via taking advantage of the slack-based measure (SBM) model. Meanwhile, based on the panel data from 280 prefecture-level cities in China from 2003 to 2013, the paper thoroughly probed into, and discussed, the effect imposed by industry clustering and specialization on the utilization efficiency of urban land. Research results indicate several conclusions, as follows: (1) Taking environmental loss into account, the land utilization efficiency of prefecture-level cities in China is generally low. During the research period, the average value of the land utilization efficiency of prefecture-level cities in China is only 0.349, with, first, a declining trend, and then a rise. Geographically speaking, the land utilization efficiency presents a “depression in the center” phenomenon which means the land utilization efficiency of prefecture-level cities in the central China are relatively lower than in the east and west. Now, the difference among the urban land utilization efficiency in China significantly reflects the distinctions among Eastern, Western, and Central China. Moreover, the contribution degree of the difference of the land utilization efficiency among cities of central China to the aggregation difference shows an ascending momentum. Additionally, the relation between the population scale and land utilization efficiency in cities manifests as a U shape; (2) theoretically speaking, the relation between industry clustering and urban land utilization efficiency presents an inverted-U shape. However, this kind of relation is not significant in Western and Central China and medium-sized cities. Moreover, most of cities are still relatively far away from the inflection point or the critical value; and (3) the industry professional level has imposed a positive influence on urban land utilization efficiency. However, that influence is not significant in Eastern China and large cities. Consequently, strengthening the industry professional development of Western and Central China and small and medium-sized cities, facilitating diversified development of industries in Eastern China and large cities, and accelerating industrial clustering, all of these measures above will be conducive to improving urban land utilization efficiency in China.

Predicting the outcome of a future game between two National Basketball Association (NBA) teams poses a challenging problem of interest to statistical scientists as well as the general public. In this article, we formalize the problem of predicting the game results as a classification problem and apply the principle of maximum entropy to construct NBA maximum entropy (NBAME) model that fits to discrete statistics for NBA games, and then predict the outcomes of NBA playoffs by the NBAME model. The best NBAME model is able to correctly predict the winning team 74.4 percent of the time as compared to some other machine learning algorithms which is correct 69.3 percent of the time.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.

The article aims to explore social aspects in the area of energy research by using bibliometrics methods and tools. The study is based on the data of Energy Research & Social Science journal publications exported from ScienceDirect database during 2019-2023. Methodologically, the work included clustering of the bibliometric records under consideration. This allowed to identify the main topics of publications and those in which the research of social problems prevails. This stage of the work was carried out using carrot2, an engine for clustering search results. Next, the analysis of publication topics related to social issues research was carried out using VOSviewer — a software tool for visualizing scientific landscapes. The topics of the four clusters obtained at this stage were described by key terms with the maximum total link strength. For the principal ones, a definition was made on the basis of the texts of publications that most fully disclose the meaning of these terms. The 1537 publications in the journal during the period under review deal with many aspects of energy transition research, renewable energy, energy policy, energy justice and energy systems, but only 78 of them are dominated by social issues. The paper reveals the main social issues in the field of energy research: sociology of energy, socio-technical system, community energy, energy democracy, sociology of the future, energy sovereignty, socio-technical imaginary and shows the insufficient attention to this topic, especially to the investment of such research.

Spatiotemporal climate variability is a leading environmental constraint to the rain-fed agricultural productivity and food security of communities in the Abbay basin and elsewhere in Ethiopia. The previous one-size-fits-all approach to soil and water management technology targeting did not effectively address climate-induced risks to rain-fed agriculture. This study, therefore, delineates homogenous climatic regions and identifies climate-induced risks to rain-fed agriculture that are important to guide decisions and selection of site-specific technologies for green water management in the Abbay basin. The k-means spatial clustering method was employed to identify homogenous climatic regions in the study area, while the Elbow method was used to determine an optimum number of the climate clusters. The k-mean clustering used the Enhancing National Climate Services (ENACTS) daily rainfall, minimum and maximum temperatures, and other derived climate variables that include daily rainfall amount, length of growing period (LGP), rainfall onset and cessation dates, and rainfall intensity, temperature, potential evapotranspiration (PET), soil moisture and AsterDEM to define climate regions. Accordingly, 12 climate clusters or regions were identified and mapped for the basin. Clustering a given geographic region into homogenous climate classes is useful to accurately identify and target locally relevant green water management technologies to effectively address local-scale climate-induced risks. The study has also provides a methodological framework that can be used in the other river basins of Ethiopia and indeed elsewhere.

The utilization of tempered blast furnace (BF) slag through the direct fiber forming process to create high-value thermal insulation materials offers a dual benefit: it efficiently harnesses the latent heat within unused slag and substantially enhances the value of blast-furnace slag utilization. However, gauging the melting properties of iron slag under high temperatures is a challenge. In this study, we explore the melting behavior of SiO2 within a high-temperature molten pool. We employ dynamic visual data (video stream) captured via a non-contact charge coupled device (CCD) video recording system to extract SiO2 contours through image processing. The change in image centroid characteristics is used to establish a convolution function relationship, and MATLAB's traversal search algorithm determines SiO2's centroid position. Given that SiO2 is proportionate to crucible pixels, the area of SiO2 is calculated through pixel statistics within these contours. Subsequently, we propose a new indirect method to process image information, yielding SiO2 volume and mass at different time points. An exponential fitting yields the melting rate function of SiO2. Finally, we compare this indirect method with shape from shading (SFS), quantitative characterization, and dimensional analysis techniques. We also discuss the strengths and limitations of each method. Our findings reveal that the indirect solution method presented here boasts straightforward calculation steps and imposes minimal image format requirements. This research provides theoretical and technical support for blast-furnace slag's direct fiber forming process.

Cell-free massive multiple input multiple output (MIMO) has the potential of providing joint services including joint initial access, efficient clustering of access points (APs) and pilot allocation to user equipments (UEs) over large coverage area with reduced interference. In cell-free massive MIMO, large coverage area corresponds to provision and maintenance of scalable quality of service requirements for infinitely large number of UEs. The research in cell free massive MIMO is mostly focused on time division duplex mode due to availability of channel reciprocity which aids in avoiding feedback overhead. However, frequency division duplex (FDD) protocol still dominates the current wireless standards and the provision of angle reciprocity aids in reducing this overhead. The challenge of providing a scalable cell-free massive MIMO system in FDD setting is also prevalent, since computational complexity regarding signal processing tasks such as channel estimation, precoding/combining and power allocation, becomes prohibitively high with increase in number of UEs. In this work, we consider an FDD based scalable cell-free network with angular reciprocity and dynamic cooperation clustering approach. We have proposed scalability for our FDD cell-free and perform comparative analysis with reference to channel estimation, power allocation and precoding/combining techniques. We present expressions for scalable spectral efficiency, angle based precoding/combining schemes and provide comparison of overhead between conventional and scalable angle based estimation as well as combining schemes. Simulations confirm that the proposed scalable cell-free network based on FDD scheme outperforms the conventional matched filtering scheme based on non-scalable precoding/combiming schemes. The angle based LP-MMSE in FDD cell-free network provides 14.3% improvement in spectral efficiency and 11.11% improvement in energy efficiency compared to non-scalable MF scheme.

High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is of great significance for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a Park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the Filter algorithm, this article proposed a triangular grid filter based on Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground points extraction, this method has good accuracy, stability and achieves good results in separating ground points from non-ground points. At first, using Slope Filter to remove some non-ground points, to reduce the error of taking ground points as non-ground points; Secondly, established a triangular grid based on the triangular relationship between each point, the violation-triangle can determin through the grid, and then the corresponding violation points were found in the violation-triangle; Thirdly, according to the three-point collinear method to extract the regular points, used these points to extract the regular landmarks by KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm; Finally, removed disperse points and irregular landmarks by Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 sample data provided by ISPRS, and obtained an average error of 3. 46%. The results showed that the algorithm in this article have a high processing efficiency and accuracy, which can greatly improve the processing efficiency of point cloud data in practical applications.

The objective of this article: analysis of research trends on the topic "Materials Science for Energy Engineering" for the period 2012-2021. Materials and methods: bibliometric analysis of data from the Scopus abstract database.Results. It is shown that this topic is developing faster than the general energy topics.The key feature of the research trends is a significant increase in work on the development of materials for renewable energy and a decrease in the number of publications related to nuclear power.The primary goal of many studies is to increase the efficiency of renewable energy production through the use of new materials.The importance of the topic is evidenced by the emergence of new journals that quickly entered the first quartile of the abstract databases Scopus and Web of Science, for example: ACS Applied Energy Materials.There has been a significant increase of interest in perovskite solar cells, layered semiconductors, triboelectric nanogenerators, cobalt compounds, sulfur compounds, and oxygen and hydrogen evolution reaction during Electrolysis.Publications on electric batteries are well represented in all time intervals. The focus is on electrode materials and battery efficiency.

Cluster-based routing in Mobile Ad-Hoc Networks is considered one of the convenient methods of routing. The existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. In this paper, a clustering algorithm using hierarchical routing for mobile ad hoc networks is proposed. In the proposed method, first, clusters are formed by the FLOC clustering method with low overlapping. Then, according to the most important network criteria, including hop count, noise ratio, distance, remaining energy, and link expiration time, head clusters are selected based on the weighting algorithm. To transfer data in the proposed method, two types of communication are used, e.g., inter-cluster communication and intra-cluster communication in which the shortest path to the target cluster is selected. The proposed P-METHOD technique is based on hierarchy and clustering as well as using a weighted algorithm that reduces delay in data transmission on the network. Moreover, P-METHOD is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the MANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), delay, residual energy, and lifetime.

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

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

In this paper, we propose a simple tool to help the energy management of a large buildings stock defining clusters of buildings with the same function, setting alert thresholds for each cluster, and easily recognizing outliers. The objective is to enable a building management system to be used for detection of abnormal energy use. First, we framed the issue of energy performance indicators, and how they feed into data visualization (Data Viz) tools for a large building stock, especially for university campuses. Both for Data Viz and clustering algorithm processes, we discussed two possible approaches to choose the right number of clusters and the identification of alert thresholds and outliers, after a brief presentation of the University of Turin's building stock case study. Different Data Viz tools have been studied to apply a specific clustering algorithm, the k-means one. An explorative analysis based on the general Multidimensional detective approach by Inselberg has been performed. Two multidimensional analysis tools, the Scatter Plot Matrix and the Parallel coordinates method have been used. Secondly, the k-means clustering algorithm has been applied on the same dataset in order to test the hypothesis made during the explorative analysis. Data Viz techniques developed in this study revealed to be very useful to explore quickly and simply a large buildings' stock, identifying the worst efficient buildings and clustering them according to their distinct functions.

The present investigation has been conducted on one hundred tissue fragments of breast cancer, collected and immediately cryopreserved following the surgical resection. The fragments were selected from patients with invasive ductal carcinoma of the breast, the most common and potentially aggressive type of mammary cancer, with the objective to increase the knowledge of breast cancer molecular markers, useful for diagnostic and prognostic categorization of patients, in assessing post-surgical therapeutic regimes. The proteomic screening, by 2D-IPG and mass spectrometry, allowed us to identify two main classes of protein clusters: proteins expressed ubiquitously at high levels in all patients, and proteins expressed sporadically among the same patients. Within the group of ubiquitous proteins, glycolytic enzymes and proteins with anti-apoptotic activity were predominant. Among the sporadic ones, proteins involved in cell motility, molecular chaperones and proteins involved in the detoxification appeared prevalent. The data of the present study indicates that the primary tumor growth is generally supported by two concurrent pathways: the inhibition of apoptosis and the stimulation of cellular proliferation. The second phase of the evolution of the tumor can be prematurely scheduled by the occasional presence of proteins involved in cell motility and in the defenses of the oxidative stress. To our knowledge this report on large-scales proteomics of breast cancer is currently a unique approach in the literature that offers the opportunity to evaluate the presence and recurrence of proteins to be used as prognostic indicators and susceptibility to metastasis in patients operated on for invasive ductal carcinoma of the breast.

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.

The Covid-19 crisis has been one of the most relevant economic shocks in the history of the modern economy, mainly due to the restrictions on travel and social interaction taken by the authorities (quarantines, closure of schools, artistic activities, bars, and restaurants, capacity in stores), to reduce the transmission of the virus (Sars-Cov2), having consequences on the national productions of all countries (about 7% for the loss of GDP worldwide). In our study, we analyze, through clustering methods, the effects of the level of contagion, economic projections, and economic mitigation measures taken by governments for managing the pandemic. According to the analyses, it can be concluded that a low infection rate implies a lower loss of product and economic savings when applying economic mitigation measures, taking relevance in the management of sanitary measures to reduce the transmission of the virus (and the temporality of these).

Studying and understanding the behavior of people and vehicles on public roads can be of utmost importance for supporting the activities of many institutional stakeholders. It may allow automated supervision of the ongoing situation in a given place, with warnings or alarms raised in case of anomalies. It may be used to plan their interventions on road and town organization. It may provide them with advanced support to decision-making. The number of involved entities and places to manage makes it infeasible to manually handle all the traffic-related tasks. Moreover, the complexity of the tasks to be carried out requires the adoption of advanced approaches. Many AI solutions are nowadays mature to support these requirements. In some cases, the motivations and objectives of traffic management require the AI outcomes to be understandable, interpretable and explainable. In this paper, we propose TrAnSIT (TRaffic ANalysis Supervision and Interpretation Tool), an AI-based framework that combines several modules, each aimed at tackling a specific traffic-related task, so as to cover a wide landscape of traffic-related issues, from overall urban or suburban traffic management to surveying specific road segments that fall under the scope of one camera. Most of these modules are based on AI techniques that support a human-level understanding of the outcomes.

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.

Video behavior recognition often needs to focus on object motion processes. In this work, a self-organizing computational system oriented to behavioral clustering recognition is proposed, which achieves the extraction of motion change patterns by binary encoding and completes motion pattern summarization using a similarity comparison algorithm. And in the face of unknown behavioral video data, a self-organizing structure with layer-by-layer accuracy progression is used to achieve motion law summarization by using a multi-layer agent design approach. Finally, the real-time feasibility is verified in the prototype system using real scenes to provide a new feasible solution for unsupervised behavior recognition and space-time scenes.

The characteristics of the eddy mass transport are estimated depending on the values of the parameters of a large-scale flow that forms under the conditions of the shelf seas in the Arctic. For this, the results of numerical simulation of the Kara Sea with a horizontal resolution permitting the development of mesoscale eddies are used. The parameters resulting from numerical experiment are considered as a statistical sample and are analyzed using methods of sensitivity study and clustering of sample elements. Functional dependencies are obtained that are closest to the simulated distributions of quantities. These expressions make it possible, within the framework of large-scale models, to evaluate the characteristics of the cross-isobatic eddy mass transport in the diffusion approximation with a counter-gradient flux. Numerical experiments using the SibCIOM model showed that areas along the Fram branch of the Atlantic waters trajectory in the Arctic as well as the shelf of the East Siberian and Laptev seas with adjacent deep water areas are most sensitive to proposed parameterization of eddy exchanges. Accounting for counter-gradient eddy fluxes turned out to be less important.

This article presents an estimation of the hypertension risk based on a dataset on 1007 individuals. The application of a Tobit Model shows that “Hypertension” is positively associated to “Age”, “BMI-Body Mass Index”, and “Heart Rate”. The data show that the element that has the greatest impact in determining inflation risk is “BMI-Body Mass Index”. An analysis was then carried out using the fuzzy c-Means algorithm optimized with the use of the Silhouette coefficient. The result shows that the optimal number of clusters is 9. A comparison was then made between eight different machine-learning algorithms for predicting the value of the Hypertension Risk. The best performing algorithm is the Gradient Boosted Trees Regression according to the analyzed dataset. The results show that there are 37 individuals who have a predicted hypertension value greater than 0.75, 35 individuals who have a predicted hypertension value between 0.5 and 0.75, while 227 individuals have a hypertension value between 0.0 and 0.5 units.

Premature ventricular contraction (PVC) is one of the common ventricular arrhythmias, which may cause stroke or sudden cardiac death. Automatic long-term electrocardiogram (ECG) analysis algorithms could provide diagnosis suggestion even early warning for physicians, however, they are mutually-exclusive in terms of robustness, generalization and low complexity. In this study, a novel PVC recognition algorithm that combines deep learning-based heartbeat template clusterer and expert system-based heartbeat classifier is proposed. Long short-term memory-based auto-encoder (LSTM-AE) network was used to extract features from ECG heartbeats for K-means clustering. Thus, the templates were constructed and determined based on clustering results. Finally, the PVC heartbeats were recognized based on a combination of multiple rules, including template matching and rhythm characteristics. Three quantitative parameters, sensitivity (Se), positive predictive value (P+) and accuracy (ACC), were used to evaluate the performances of the proposed method on the MIT-BIH Arrhythmia database and the St. Petersburg Institute of Cardiological Technics database. Se on the two test databases was 87.51% and 87.92%, respectively; P+ was 92.47% and 93.18%, respectively; and ACC was 98.63% and 97.89%, respectively. The PVC scores on the 3rd China Physiological Signal Challenge 2020 training set and hidden test set were 36,256 and 46,706, respectively, which could rank first in the open-source codes. The results showed that the combination strategy of expert system and deep learning can provide new insights for robust and generalized PVC identification from long-term single-lead ECG recordings.

Time series data are significant and are derived from temporal data, which involve real numbers representing values collected regularly over time. Time series have a great impact on many types of data. However, time series have anomalies. We introduce hybrid algorithm named novel matrix profile (NMP) to solve the all-pairs similarity search problem for time series data. The proposed NMP inherits the features from two state-of-the art algorithms: similarity time-series automatic multivariate prediction (STAMP), and short text online microblogging protocol (STOMP). The proposed algorithm caches the output in an easy-to-access fashion for single- and multidimensional data. The proposed NMP algorithm can be used on large data sets and generates approximate solutions of high quality in a reasonable time. The proposed NMP can also handle several data mining tasks. It is implemented on a Python platform. To determine its effectiveness, it is compared with the state-of-the-art matrix profile algorithms i.e., STAMP and STOMP. The results confirm that the proposed NMP provides higher accuracy than the compared algorithms.

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

Chromophobe renal cell carcinoma (chRCC) and oncocytoma (RO) are renal tumor types originating from alpha intercalated cells of the collecting ducts of the kidney. Both tumor types have similar gross histological morphology and increased mitochondria, which leads to difficulties differentiating between these tumors, especially with core biopsy samples. This study aims to apply a machine learning approach to develop a molecular classifier based on transcriptomics data. Here we generated a meta-data set containing 62 chRCC and 45 RO gene expression arrays. Arrays were subjected to quality control steps, and genes were selected based on differential expression and ROC analysis. The final gene list was evaluated with UMAP based dimension reduction followed by density-based clustering with 95.5% accuracy. Molecular profiling by KEGG pathway analysis identified enrichment of fatty acid oxidation pathway in RO. We finally identified and validated the 30-gene signature, with an accuracy of 94.4% to distinguish chRCC from RO on UMAP analysis. Our results show that chRCC and RO have a distinct gene signature that can differentiate these tumors and complement histology for routine diagnosis of these two tumors.

This paper is devoted to the foundational problems of dendrogramic holographic theory (DH-theory). We use the ontic-epistemic (implicate-explicate order) methodology. The epistemic counterpart is based on representation of data by dendrograms constructed with hierarchic clustering algorithms. The ontic Universe is described as the p-adic tree; it is zero dimensional, totally disconnected, disordered, and bounded (in p-adic ultrametric). Interrelation classical-quantum loses its sharpness; generally simple dendrograms are ``more quantum’’ than complex one. We use the CHSH-inequality as a measure of quantum(-likeness). We demonstrate that it can be violated by classical experimental data represented by dendrograms. The seed of this violation is neither nonlocality nor rejection of realism. This is nonergodicity of dendrogramic time series. Generally, violation of ergodicity is one of the basic features of DH-theory. We also consider DH-theory for Minkovski geometry and monitor the dependence of CHSH-violation and nonergodicity on geometry as well as a Lorentz transformation of data.

The COVID-19 pandemic starting in the first half of 2020 has changed the lives of everyone across the world. Reduced mobility was essential due to it being the largest impact possible against the spread of the little understood SARS-CoV-2 virus. To understand the spread, a comprehension of human mobility patterns is needed. The use of mobility data in modelling is thus essential to capture the intrinsic spread through the population. It is necessary to determine to what extent mobility data convey the same message of mobility within a region. This paper compares different mobility data sources by constructing spatial weight matrices and further compares the results through hierarchical clustering. This provides insight for the user into which data provides what type of information and in what situations a particular source is most useful.