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.

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.

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

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.

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.

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 complication of people with diabetes causes an illness known as Diabetic Retinopathy (DR). It is very widespread among middle-aged and older people. As diabetes progresses, patients' vision may deteriorate and cause DR. People to lose their vision because of this illness. To cope with DR, early detection is needed. Patients will have to be checked by doctors regularly, which is a waste of time and energy. DR can be divided into two groups: non-proliferative (NPDR) while the other is proliferative (PDR). In this study, machine learning (ML) techniques are used to diagnose DR early. These are PNN, SVM, Bayesian Classification, and K-Means Clustering. These techniques will be evaluated and compared with each other to choose the best methodology. A total of 300 fundus photographs are processed for training and testing. The features are extracted from these raw images using image processing techniques. After an experiment, it is concluded that PNN has an accuracy of about 89%, Bayes Classifications 94%, SVM 97%, and K-Means Clustering 87%. The preliminary results prove that SVM is the best technique for early detection of DR.

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.

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.

SARS-CoV-2 is mutating and creating divergent variants across the world. An in-depth investigation of the amino acid substitution in the genomic signature of SARS-CoV-2 proteins is highly essential for understanding its host adaptation and infection biology. A total of 9587 SARS-CoV-2 structural protein sequences collected from 49 different countries are used to characterize protein-wise variants, substitution pattern (type and location), and major substitution changes. The majority of the substitutions are distinct, occurred mostly in a particular location, and leads to a change in amino acid's biochemical properties. In terms of mutational changes, Envelope (E) and Membrane (M) proteins are relatively stable than Nucleocapsid (N) and Spike (S) proteins. Several co-occurrence substitutions are observed, particularly in S and N proteins. Substitution specific to active sub-domains reveals that Heptapeptide Repeat, Fusion peptides, Transmembrane in S protein, and N-terminal and C-terminal domains in N protein are remarkably mutated, and also found few deleterious mutations in these domains.

With the rapid development of smart phones, tablets and their operative systems, many positioning enabled sensors have been built into these devices. Users can now accurately fix their location according to the function of GPS receivers. For indoor environments, as in the case we are studying, WiFi based positioning is preferred to GPS due to the attenuation or obstruction of signals. This paper deals with the automatic classification of customers in a Sports Shop Center on the basis of their movements around the shop's premises. To achieve this goal, we start by collecting (x,y) coordinates from customers while they visit the store. Consequently, any costumer's path through the shop is formed by a list of coordinates, obtained with a frequency of one measurement per minute. Then, a guess about the full trajectory is constructed and a number of parameters about these trajectories is calculated before performing an Unsupervised Learning Clustering Process. As a result, we can identify several types of customers, and the dynamics of their behavior inside the shop. This information is of great value to the company, to be used both in the long term and also in short periods of time, monitoring the current state of the shop at any moment, identifying different types of situation appearing during restricted periods, or predicting customer flow conditions

Considering the great growth of IoT networks and the need for highly reliable networks and also considering the manufacturing divides of IoT equipment which are highly limited by their memory, processing power and battery; we need a highly efficient routing for guaranteeing our network's high life span. So, this paper has suggested an efficient energy routing method based on the overlapping clustering method which is inspired from the Grey theory. The Overlap clustering method means that some Things collect data that must be sent to two or more Fog nodes for processing. In the suggested method the best node is selected as the cluster head based on factors such as remaining energy, distance, link expiration time, signal power for receiving data from things by the Fog nodes. In the next step the Fog node's data are sent in a hierarchical method using a symmetrical tree of processed data to the server. Thus, the main issue here is making using a proper routing method for data sending to the Cloud that doesn't just focus on energy, but also considers other factors such as delay and network life span. The simulation results show that the HR-IoT reduces the average end to end delay more than 17.2% and 23.1%, decreases the response time more than 20.1% and 25.78% and increase packet delivery rate more than 23.1% and 28.78% and lifetime more than 25.1% and 28.78% compared to EECRP and ERGID approaches.

MALDI-TOF (Matrix-Assisted Laser Desorption/Ionization Time-of Flight) is a type of mass spectrometry (MS) that has been widely implemented for the rapid identification of microorganisms over the last decade. The accuracy and flexibility of this method has encouraged researchers to implement the analysis of protein spectra obtained by MALDI-TOF for the discrimination of close-related species and bacterial typing. In this study, a standardized methodology based on the detection of species-specific protein peaks from the spectra obtained with MALDI-TOF is described. The methodology was applied to a collection of Cryptococcus spp. (n=70) previously characterized by Amplified Fragment Length Polymorphism (AFLP) and sequencing of the ITS1-5.8S-ITS2 region. An expanded ad-hoc database was also built for their discrimination with MALDI-TOF. This approach did not allow the discrimination of the interspecies hybrids. However, the performance of peak analysis with the application of the PLS-DA and SVM algorithms in a two-step analysis allowed 96.95% and 96.55% correct discrimination of C. neoformans from the interspecies hybrids, respectively. Besides, PCA analysis prior to SVM provided 98.45% correct discrimination of the 3 analyzed species in a one-step analysis. The method is cost-efficient, rapid and user-friendly. The procedure can also be automatized for an optimized implementation in the laboratory routine.

Educational data-mining is an evolving discipline that focuses on the improvement of self-learning and adaptive methods. It is used for finding hidden patterns or intrinsic structures of educational data. In the arena of education, the heterogeneous data is involved and continuously growing in the paradigm of big-data. To extract meaningful information adaptively from big educational data, some specific data mining techniques are needed. This paper presents a clustering approach to partition students into different groups or clusters based on their learning behavior. Furthermore, personalized e-learning system architecture is also presented which detects and responds teaching contents according to the students’ learning capabilities. The primary objective includes the discovery of optimal settings, in which learners can improve their learning capabilities. Moreover, the administration can find essential hidden patterns to bring the effective reforms in the existing system. The clustering methods K-Means, K-Medoids, Density-based Spatial Clustering of Applications with Noise, Agglomerative Hierarchical Cluster Tree and Clustering by Fast Search and Finding of Density Peaks via Heat Diffusion (CFSFDP-HD) are analyzed using educational data mining. It is observed that more robust results can be achieved by the replacement of existing methods with CFSFDP-HD. The data mining techniques are equally effective to analyze the big data to make education systems vigorous.

Software engineers from all over the world solve independently a lot of similar problems. In this condition the problem of code or even better architecture reusing becomes an issue of the day. In this paper two phase approach to determining the functional and structural likenesses of software projects is proposed. This approach combines two methods of artificial intelligence: natural language processing techniques with a novel method for comparing software projects based on ontological representation of their architecture automatically obtained from the projects source code. Additionally several similarity metrics are proposed to estimate similarity between projects.

Integration of multi-view datasets which are comprised of heterogeneous sources or different representations is challenging to understand the subtle and complex relationship in data. Such data integration methods attempt to combine efficiently the complementary information of multiple data types to construct a comprehensive view of underlying data. Nonnegative matrix factorization (NMF), an approach that can be used for signal compression and noise reduction, has aroused widespread attention in the last two decades. The Kullback–Leibler divergence (or relative entropy) information distance can be used to measure the loss function of NMF. In this article, we propose a fast and robust framework (RSNMF) based on symmetric nonnegative matrix factorization (SNMF) and similarity network fusion (SNF) for clustering human microbiome data including functional, metabolic and phylogenetic profiles. Many existing methods typically utilize all the information provided by each view to create a consensus representation, which often suffers a lot from noise in data and cannot provide a precise representation of the latent data structures. In contrast, RSNMF combines the strength of SNMF and the advantage of SNF to form a robust clustering indicator matrix thus can reduce the noise influence. We conduct experiments on one synthetic and two real dataset (microbiome data, text data) and the results show that the proposed RSNMF has better performance over the baseline and the state-of-art methods, which demonstrates the potential application of RSNMF for microbiome data analysis.

It is a significant task to assess the safety of the aging offshore jacket platform in order to extend the service life. This paper analyzes the multiple risk factors of an aging jacket platform in Bohai Bay, China and builds the safety evaluation index system, which includes three levels, namely, the target layer, the first-grade indicators layer and the second-grade indicators layer. The target layer consists of three first-grade indicators: ocean environments, structure status, and human and organizational factors. Each first-grade indicator is divided into three second-grade indicators. The weight of each indicator is calculated by analytic hierarchy process to weaken subjective effect. Grey clustering method is applied to estimate the failure risk of the platform in Bohai Bay qualitatively and quantitatively. The assessment standard is divided into five grades and the whitening function of each grey cluster is determined by the assessment scheme. The grey evaluation weight vector of each second-grade indicator is calculated by the table dispatching method. Through layer by layer calculation, the grey assessment value of the target layer is finally estimated by making the grey assessment weight vector single-value and the grey grade is determined according to the maximum principle. The evaluation results show quantitatively that the failure risk grade of the jacket platform in Bohai Bay is medium and the safety assessment method is reasonable and feasible.

Titanium dioxide nanoparticles have risen concerns about their possible toxicity and the European Food Safety Authority recently banned the use of TiO2 nano-additive in food products. Following the intent of relating nanomaterials atomic structure with their toxicity without having to conduct large scale experiments on living organisms, we investigate the aggregation of titanium dioxide nanoparticles using a multi-scale technique: starting from ab initio Density Functional Theory to get an accurate determination of the energetics and electronic structure, we switch to classical Molecular Dynamics simulations to calculate the Potential of Mean Force for the connection of two identical nanoparticles in water; the fitting of the latter by a set of mathematical equations is the key for the upscale. Lastly, we perform Brownian Dynamics simulations where each nanoparticle is a spherical bead. This coarsening strategy allows studying the aggregation of a few thousand nanoparticles. Applying this novel procedure, we find three new molecular descriptors, namely, the aggregation free energy and two numerical parameters used to correct the observed deviation from the aggregation kinetic described by the Smoluchowski theory. Molecular descriptors can be fed into QSAR models to predict the toxicity of a material knowing its physicochemical properties, without having to conduct large scale experiments on living organisms.

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

The COVID-19 disease spreads swiftly, and nearly three months after the first positive case was confirmed in China, Coronavirus started to spread all over the United States. Some states and counties reported an extremely high number of positive cases and deaths, while some reported too few COVID-19 related cases and mortality. In this paper, the factors that could affect the transmission of COVID-19 and its risk level in different counties have been determined and analyzed. Using Pearson Correlation, K-means clustering, and several classification models, the most critical ones were determined. Results showed that mean temperature, percent of people below poverty, percent of adults with obesity, air pressure, percentage of rural areas, and percent of uninsured people in each county were the most significant and effective attributes.

This paper presents an effective heart disease prediction model through detecting the anomalies, also known as outliers, in healthcare data using the unsupervised K-means clustering algorithm. Most existing approaches for detecting anomalies are based on constructing profiles of normal instances. However, such techniques require an adequate number of normal profiles to justify those models. Our proposed model first evaluates an \textit{optimal} value of K using Silhouette method. Next, it intends to locate anomalies that are far from a certain threshold distance with respect to their clusters. Finally, the five most popular classification techniques such as K-Nearest Neighbor (KNN), Random Forest (RF), Support Vector Machines (SVM), Naive Bayes (NB), and Logistic Regression (LR) are applied to build the resultant prediction model. The effectiveness of the proposed methodology is justified using a benchmark dataset of heart disease.

In Lagrangian dynamics, the detection of coherent clusters can help understand the organization of transport by identifying regions with coherent trajectory patterns. Many clustering algorithms, however, rely on user-input parameters, requiring a priori knowledge about the flow and making the outcome subjective. Building on the conventional spectral clustering method of Hadjighasem et al (2016), a new parameter-free spectral clustering approach is developed that automatically identifies parameters and does not require any user-input choices. A noise-based metric for quantifying the coherence of the resulting coherent clusters is also introduced. The parameter-free spectral clustering is applied to two benchmark analytical flows, the Bickley Jet and the asymmetric Duffing oscillator, and to a realistic, numerically-generated oceanic coastal flow. In the latter case, the identified model-based clusters are tested using observed trajectories of real drifters. In all examples, our approach succeeded in performing the partition of the domain into coherent clusters with minimal inter-cluster similarity and maximum intra-cluster similarity. For the coastal flow, the resulting coherent clusters are qualitatively similar over the same phase of the tide on different days and even different years, whereas coherent clusters for the opposite tidal phase are qualitatively different.

In Cameroon, alcoholic beverages remain the main consumed drink. In the Northern regions, indigenous sorghum beers are popular and widely consumed in an actively fermenting state by the people. In this study, some physicochemical parameters of the alcoholic sorghum beverages and correlations between them were evaluated during fermentation for 10 days. The indigenous white and red beers were produced at the laboratory scale assisted by experimented producers and some parameters (pH, total acidity, alcohol, sugars, density, total solids, temperature, and conductivity) were measured on the wort and fermented beverages. The pH decreases from 3.2 to 2.4 and 3.11 to 2.41; total acidity increases from 1.07 to 5.1 g/l and 0.5 to 4.6 g/l; alcohol enhances from 0 to 9.5% and 0 to 6.8% (v/v); total solids drop from 13.6 to 5°P and 12.2 to 3.3°P were observed respectively in the white and red sorghum beers. The multivariate analysis showed a good correlation between consumption of sugar, the decrease of total solids and density with the decrease in pH. It was also shown that, a perfect link exist between the production of alcohol and organic acids. The hierarchical analysis showed that indigenous red beer samples fermented for 1 and 2 days and those fermented for 4 to 10 days are related and could be separate in two distinct groups, whereas white turbid beer samples are separated in three different groups, those fermented for 1 to 4 days, those 5 to 6 days and those 7 to 10 days. The results obtained could serve as a guide to better understand the fermentation process of the indigenous alcoholic sorghum-based beverages.

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

Energy efficiency of Data Center (DC) operations heavily relies on IT and cooling systems performance. A reliable and efficient cooling system is necessary to produce a persistent flow of cold air to cool servers that are subjected to constantly increasing computational load due to the advent of IoT- enabled smart systems. Consequently, increased demand for computing power will bring about increased waste heat dissipation in data centers. In order to bring about a DC energy efficiency, it is imperative to explore the thermal characteristics analysis of an IT room (due to waste heat). This work encompasses the employment of an unsupervised machine learning modelling technique for uncovering weaknesses of the DC cooling system based on real DC monitoring thermal data. The findings of the analysis result in the identification of areas for energy efficiency improvement that will feed into DC recommendations. The methodology employed for this research includes statistical analysis of IT room thermal characteristics, and the identification of individual servers that frequently occur in the hotspot zones. A critical analysis has been conducted on available big dataset of ambient air temperature in the hot aisle of ENEA Portici CRESCO6 computing cluster. Clustering techniques have been used for hotspots localization as well as categorization of nodes based on surrounding air temperature ranges. The principles and approaches covered in this work are replicable for energy efficiency evaluation of any DC and thus, foster transferability. This work showcases applicability of best practices and guidelines in the context of a real commercial DC that transcends the set of existing metrics for DC energy efficiency assessment.

Hyperspectral imaging provides vital information about the objects and elements present inside the image. That’s why they are very useful in satellite imagery as well as image forensics. Hyperspectral document analysis (HSDI) can be used for document authentication using ink analysis which can provide sufficient information about the composition and type of ink. In this project, we have implemented HSDI based ink classification technique using Principle Component Analysis for dimensionality reduction and K-means clustering for ink classification. This is unsupervised learning approach and it is very simple and efficient in order to classify limited number of bands. We have used this technique to classify 33 different bands of ink.

Comorbidities can have a cumulative effect on hospital outcomes of care, such as the length of stay (LOS), and hospital mortality. This study examines patients hospitalized with Congestive Heart Failure (CHF), a life-threatening condition, which, when it coexists with a burdened disease profile, the risk for negative hospital outcomes increases. Since coexisting conditions co-interact, with a variable effect on outcomes, clinicians should be able to recognize these joint effects. In order to study CHF comorbidities, we used medical claims data from CMS. After extracting the most frequent cluster of CHF comorbidities, we: (i) Calculated, step-by-step, the conditional probabilities for each disease combination inside this cluster (ii) Estimated the cumulative effect of each comorbidity combination on the LOS and hospital mortality (iii) Constructed (a) Bayesian, scenario-based graphs and (b) Bayes-networks to visualize results. Results show that, for CHF patients, different comorbidity constructs have variable effect on the LOS and hospital mortality. Therefore, dynamic comorbidity risk assessment methods should be implemented for informed clinical decision making in any ongoing effort for quality of care improvements.

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

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

Smart grids require flexible data driven forecasting methods. We propose clustering tools for bottom-up short-term load forecasting. We focus on individual consumption data analysis which plays a major role for energy management and electricity load forecasting. The two first sections are dedicated to the industrial context and a review of individual electrical data analysis. We are interested in hierarchical time-series for bottom-up forecasting. The idea is to disaggregate the signal in such a way that the sum of disaggregated forecasts improves the direct prediction. The 3-steps strategy defines numerous super-consumers by curve clustering, builds a hierarchy of partitions and selects the best one minimizing a forecast criterion. Using a nonparametric model to handle forecasting, and wavelets to define various notions of similarity between load curves, this disaggregation strategy applied to French individual consumers leads to a gain of 16\% in forecast accuracy. We then explore the upscaling capacity of this strategy facing massive data and implement proposals using R, the free software environment for statistical computing. The proposed solutions to make the algorithm scalable combines data storage, parallel computing and double clustering step to define the super-consumers.

Containing hundreds of spectral bands (features), hyperspectral images (HSIs) have high ability in discrimination of land cover classes. Traditional HSIs data processing methods consider the same importance for all bands in the original feature space (OFS), while different spectral bands play different roles in identification of samples of different classes. In order to explore the relative importance of each feature, we learn a weighting matrix and obtain the relative weighted feature space (RWFS) as an enriched feature space for HSIs data analysis in this paper. To overcome the difficulty of limited labeled samples which is common case in HSIs data analysis, we extend our method to semisupervised framework. To transfer available knowledge to unlabeled samples, we employ graph based clustering where low rank representation (LRR) is used to define the similarity function for graph. After construction the RWFS, any arbitrary dimension reduction method and classification algorithm can be employed in RWFS. The experimental results on two well-known HSIs data set show that some dimension reduction algorithms have better performance in the new weighted feature space.

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

Software reliability is an important characteristic for ensuring the qualities of software products. Predicting the potential number of bugs from the beginning of a development project allows practitioners to make the appropriate decisions regarding testing activities. In the initial development phases, applying traditional software reliability growth models (SRGMs) with limited past data does not always provide reliable prediction result for decision making. To overcome this, herein we propose a new software reliability modeling method called deep cross-project software reliability growth model (DC-SRGM). DC-SRGM is a cross-project prediction method that uses features of previous projects’ data through project similarity. Specifically, the proposed method applies cluster-based project selection for training data source and modeling by a deep learning method. Experiments involving 15 real datasets from a company and 11 open source software datasets show that DC-SRGM can more precisely describe the reliability of ongoing development projects than existing traditional SRGMs and the LSTM model.

Ubiquitous computing comprises scenarios where networks, devices within the network, and software components change frequently. Market demand and cost-effectiveness are forcing device manufacturers to introduce new-age devices. Also, the Internet of Things (IoT) is transitioning rapidly from the IoT to the Internet of Everything (IoE). Due to this enormous scale, effective management of these devices becomes vital to support trustworthy and high-quality applications. One of the key challenges of IoT device management is automatic device classification with the logically semantic type and using that as a parameter for device context management. This would enable smart security solutions. In this paper, a device classification approach is proposed for the context management of ubiquitous devices based on unsupervised machine learning. To classify unknown devices and to label them logically, a proactive device classification model is framed using a k-Means clustering algorithm. To group devices, it uses the information of network parameters such as Received Signal Strength Indicator (rssi), packet_size, number_of_nodes in the network, throughput, etc. Experimental analysis suggests that the well-formedness of clusters can be used to derive cluster labels as a logically semantic device type which would be a context for resource management and authorization of resources. This paper fulfills an identified need of proactive device classification for device management.

Hyper spectral imaging (HSI) is a technique that is used to obtain the spectrum for each pixel in the image. It helps in finding objects and identifying materials etc. Such an identification is very difficult using other imaging techniques. It allows the researchers to investigate the documents without any physical contact. Nowadays detection of unequal Ink mismatch based on HSI has shown vast improvement in distinguishing the inks. Detection of unequal Ink mismatch is an unbalanced clustering problem. This paper used K-means Clustering for ink mismatch detection. K-means Clustering find same subgroups in the data based on Euclidean distance. This paper demonstrates performance in unequal Ink mismatch based on HSI.

The paper presents the results of the research concerning an evaluation of information 1 technology of gene expression profiles processing stability with the use of gene expression profiles 2 with different levels of noise component. The information technology is presented as a structural 3 block-chart, which contains all stages of the studied data processing. The hybrid model of objective 4 clustering based on SOTA algorithm and the technology of gene regulatory networks reconstruction 5 have been studied to evaluate the stability to the level of the noise component. The results of the 6 simulation have shown that the hybrid model of objective clustering has high level of stability 7 to noise component and vice versa, the technology of gene regulatory networks reconstruction is 8 very sensitivity to level of noise component. The obtained results indicate the importance of gene 9 expression profiles preprocessing at early stage of gene regulatory network reconstruction in order to 10 remove background noise and non-informative genes in terms of used criteria

In this paper, the forecast horizon and solar variability influences on MHFM model based on multiscale decomposition, AR and NN models, are studied. This article follows the works published in [1] showing the performance of the MHFM using 3 multiscale decomposition methods and a forecast horizon equal to 1 hour. Several forecast horizon strategies and his influence on the MHFM performances are investigated. We show that the best strategy for a rRMSE variying from $4.43\%$ to $10.24\%$ is obtained for forecast horizons from $5$ minutes to $6$ hours. In a second part, the solar variability influence on the MHFM is studied. A classification based on a shows that the best performance of MHFM is obtained for clear sky days with a rRMSE of $2.91\%$ and worst for cloudy sky days with a rRMSE of $6.73\%$.

In this paper, a new method is proposed to detect traffic regulations at intersections using GPS traces. The knowledge of traffic rules of regulated locations can help various location-based applications in the context of Smart Cities, such as the accurate estimation of travel time and fuel consumption from a starting point to a destination. Traffic regulations as map features, however, are surprisingly still largely absent from maps, although they do affect traffic flow which in turn affects vehicle idling time at intersections, fuel consumption, CO_2 emissions and arrival time. In addition, mapping them using surveying equipment is costly and any update process has severe time constraints. This fact is precisely the motivation for this study. Therefore, its objective is to propose an automatic, fast, scalable and inexpensive way to identify the type of intersection control (e.g. traffic lights, stop signs). A new method based on summarizing the collective behavior of vehicles crossing intersections is proposed. A modification of a well-known clustering algorithm for detecting stopping and decelerating events is presented. These detected events are then used to categorize vehicle crossing of intersections into four possible traffic categories (p1: free flow, p2: deceleration without stopping events, p3: only one stopping event, p4: more than one stopping event). The percentages of crossings of each class per junction arm, together with other speed/stop/deceleration features, extracted from trajectories, are then used as features to classify the junction arms according to their traffic control type dynamic model). The classification results of the dynamic model are compared with those of the static model, where the classification features are extracted from OpenStreetMap. Finally, a hybrid model is also tested, where a combination of dynamic and static features is used, which outperforms the other two models. For each of the three models, two variants of the feature vector are tested: one where only features associated with a single junction arm are used (one-arm model) and another where features also from neighbouring junction arms of the same junction are used to classify an arm (all-arm model). The methodology was tested on three datasets and the results show that all-arm models perform better than single-arm models with an accuracy of 94\% to 97\%.

This article identifies promising research areas on the PETROLEUM SCIENCE topic via bibliometric analysis of the 2018-2021 publications in the highly cited Journal of Petroleum Science and Engineering, which is included in the Journal Citation Reports Section: ENERGY & FUELS — Q2 Quartile, ENGINEERING, PETROLEUM — Q1 Quartile. Bibliometric metadata from Web of Science were used for 866 articles in 2018, 1,142 — in 2019, 1,138 — in 2020, and 1,832 in 2021. The clustering of articles was performed using the texts of the Title, Abstract, Keywords, and Keywords Plus fields. The demo version of the Lingo3G algorithm was used. For the two major clusters, the most promising research topics were determined by comparing the titles of the 350 most cited and 350 least cited articles for each year. The hypothesis that low-cited papers often have the same subject matter as high-cited papers of previous years is discussed.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

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

In the current natural environment, due to the complexity of the background and the high similarity of the color between immature green tomato and plant, the occlusion of the key organs (flower and fruit) by the leaves and stems will lead to low recognition rate and poor generalization of the detection model. Therefore, an improved tomato organ detection method based on convolutional neural network has been proposed in this paper. Based on the original Faster R-CNN algorithm, Resnet-50 with residual blocks was used to replace the traditional vgg16 feature extraction network, and K-means clustering method was used to adjust more appropriate anchor size than manual setting to improve detection accuracy. A variety of data augmentation techniques were used to train the network. The test results showed that compared with the traditional Faster R-CNN model, the mean average precision (mAP) of the optimal model was improved from 85.2% to 90.7%, the memory requirement decreased from 546.9MB to 115.9 MB, and the average detection time was shortened to 0.073S/sheet. As the performance greatly improved, the training model can be transplanted to the embedded system, which lays a theoretical foundation for the development of precise targeting pesticide application system and automatic picking device.

Context: Anomaly detection in a data center is a challenging task, having to consider different services on various resources. Current literature shows the application of artificial intelligence techniques to either log files or monitoring data: the former created by services at run time, while the latter produced by specific sensors directly on the physical or virtual machine. Objectives: We propose a model that exploits information both in log files and monitoring data to identify patterns and detect anomalies over time. Methods: The key idea is to use on one side natural language processing solutions to detect problems at service level, extracting words that represent anomalies. Clustering and topic modeling techniques have been used to identify patterns and group them with respect to topics. On the other side time series anomaly detection technique has been applied to sensors data in order to combine problems found in the log files with problems stored in the monitoring data. Results: We have tested our approach on a real data center equipped with log files and monitoring data that can characterize the behaviour of physical and virtual resources in production. We have observed a correspondence between anomalies in log files and monitoring data, e.g. an increase in memory usage or machine load. The results are extremely promising. Conclusion: Our model requires to integrate site administrators' expertise in order to consider all critical scenario in the data center and understand results properly.

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

With a reduction in the mortality rate of burn patients, patient length of stay (LOS) is increasingly adopted as an outcome measure. Some studies have attempted to identify factors that explain a burn patient's expected LOS. However, few have investigated the association between LOS and a patient's mental and socioeconomic status. There is anecdotal evidence for links between these factors and uncovering these will aid in better addressing the specific physical and emotional needs of burn patients, and facilitate the planning of scarce hospital resources. Here, we employ machine learning (clustering) and statistical models (regression) to investigate whether a segmentation by socioeconomic/mental status can improve the performance and interpretability of an upstream predictive model, relative to a unitary model derived for the full adult population of patients. Although we found no significant difference in the performance of the unitary model and segment-specific models, the interpretation of the segment-specific models reveals a reduced impact of burn severity in LOS prediction with increasing adverse socioeconomic and mental status. Furthermore, the models for the socioeconomic segments highlight an increased influence of living circumstances and source of injury on LOS. These findings suggest that, in addition to ensuring that the physical needs of patients are met, management of their mental status is crucial for delivering an effective care plan.