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

Static and dynamic analysis of website security risks is generally used for website security meas-urements. The website security measurements method recently proposed includes similarity hash-based website security risk analysis and machine learning-based website security risk anal-ysis. In this study, a method that can be performed through information disclosed on the Internet was proposed to measure the risk of a website. DNS information, IP information, and website history information are required to measure the risk of a website. In addition, global traffic rank-ing, malicious code distribution history, and HTTP access status can be checked in the website history information. In this study, information related to the security risk of websites in a total of 2,000 domains was collected and analyzed in 1,000 normal and malicious domains. Through the experiment results, 11 open information collection items were selected to measure the security risk of the website. This study presented the possibility of using public information collection to measure website security risk.

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

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

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

Meals on Wheels (MoWs) are critical in enabling adults with care and support needs to live independently. However, many individuals are unaware that the service exists. The aim of this study was to review the websites of local authorities in the UK, and those of 3^rd-party providers they signpost to, to establish the quality of online information available on MoWs services, and the websites’ overall quality. Two data capture forms were used to extract information from local authority and 3^rd-party providers, consisting of 35 items across five domains, and 36 items across five domains, respectively. Items were awarded a score based on whether certain criteria were met or not, resulting in a maximum total score of 50 and 43 points for each local authority, and 3^rd-party provider, website, respectively. A total of 271 websites (223 local authority and 48 3^rd-party provider) were reviewed. The mean total score was 14.9 (SD 10.6, range: 1-40 points) for local authority websites, and 21.4 (SD 5.3, range: 10-35 points) for 3^rd-party provider websites. For all websites combined, online provision of MoWs information was generally poor, with the vast majority of websites (69.4%, n=188) assessed as requiring improvement, whereas only 4.4% of websites (n=12) were assessed as very good. These findings suggest that local authorities and 3^rd-party providers in the UK should seek to improve their online information provision on MoWs to enhance awareness of the service, and ensure that potential service users, and individuals who refer them to the service, can access high-quality information on MoWs.

This study measures the communication ability of wineries in two extreme territories of Southern Italy, Mount Etna and the island of Pantelleria. The evaluation of four dimensions of web communication was carried out by the AGIL Scheme (i.e. adaptation, goal-attainment, integration, latent pattern maintenance). The study provides a generalizable model to be applied in other similar studies. Also, focus groups of experts were carried out. The method proved to be suitable to measure the communication effectiveness of wineries through websites. Extreme territories may add value to the wine, regardless of the brand. The heroic wines may become the symbol of these territories helping environmental safeguard and contrasting territory abandonment by rural communities. The findings highlight that effective communication of heroic viticulture may be used to reposition these wines and increase their competitive advantage in foreign markets. The study generates new ideas for reflection on new types of web communication.

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.

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

The aerospace industry develops prognosis and health management algorithms to ensure better safety on board. Particularly for in-flight controls where jamming is dreaded. For that, vibration signals are monitored to predict future defect occurrences. However, time series are not labeled according to severity level, and the user can only assess the system health from the data mining procedure. To that extent, we developed a clustering algorithm using a deep neural network core. We encoded the time series into pictures to be feed into an artificially trained neural network: U-NET. From the segmented output, one-dimensional information on cluster frontiers is extracted and filtered without any parameter selection. Then, a kernel density estimation finally transforms the signal into an empirical density. Ultimately, a Gaussian mixture model extracts the latter independent components. The method empowered us to reveal different degrees of severity faults in the studied data, with their respective likelihood without prior knowledge. We compared it to state-of-the-art machine learning algorithms. However, internal clustering results evaluation for time series is an open question. As state-of-the-art indexes were not producing relevant results, we built a new indicator to fulfill this task. We applied the whole method to an actuator consisting of an induction machine linked to a ball screw. This study lays the groundwork for future training of diagnosis and prognosis structures in the health management framework.

The goal of clustering is to identify common structures in a data set by forming groups of homogeneous objects. The observed characteristics of many economic time series motivated the development of classes of distributions that can accommodate properties such as heavy tails and skewness. Thanks to its flexibility, the Skewed Exponential Power Distribution (also called Skewed Generalized Error Distribution) ensures a unified and general framework for clustering possibly skewed and heavy tailed time series. This paper develops a clustering procedure of model-based type, assuming that the time series are generated by the same underlying probability distribution but with different parameters. Moreover, we propose to optimally combine the estimated parameters to form the clusters with an entropy weighing $k$-means approach. The usefulness of the proposal is showed by means of application to financial time series, demonstrating also how the obtained clusters can be used to form portfolio of stocks.

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.

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.

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

Keywords: Requirements prioritization, Next release plan, Software product planning, Decision support, MoSCoW, AHP, K-Menas, GMM, BIRCH, PAM, Hierarchical, Clustering, Clusters Evaluation

Anomaly Detection in real time data is accepted as a vital research area. Clustering has effectively been tried for this purpose. As the datasets are real time, the time of generating of the data is also important. In this article, we introduce a mixture of partitioning and agglomerative hierarchical approach to detect anomalies from such datasets. It is a two-phase method which follows partitioning approach first and then agglomerative hierarchical approach. The dataset can have mixed attributes. In phase-1, a unified metric defined on mixed attributes is used. The same is also used for merging of similar clusters in phase-2. Also, we have kept the track of time attribute of each data instance which produces the clusters with their lifetimes in phase-1. Then in phase-2, we merge the similar clusters. While merging, the similar clusters, the lifetimes of the corresponding clusters with overlapping cores are to be superimposed producing fuzzy time intervals. This way, each cluster will have an associated fuzzy lifetime. The data instances either belonging sparse clusters or not belonging to any of the clusters can be treated as anomalies. The efficacy of the algorithms can be established using both complexity analysis as well as experimental studies.

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

With increasing constraints on energy and resource markets and the non-decreasing trend in energy demand, the need for relevant clean energy generation and storage solutions is growing and is gradually reaching the individual home. But small-scale energy storage is still an expensive investment in 2022 and the risk/reward ratio is not yet attractive enough for individual homeowners. One solution is for homeowners not to store excess clean energy individually but to produce hydrogen for mutual use. In this paper a collective production of hydrogen for a daily filling of a bus is considered. Following our previous work on the subject, the investigation consists of finding an optimal buy/sell rule to the grid, and the use of the energy with an additional objective: mobility. The dominant technique in the energy community is reinforcement learning, which is however difficult to use when the learning data is limited as in our study. We chose a less data-intensive and yet technically well-documented approach. Our results show that rulebooks, different but more interesting than the usual robust rule, exist and can be cost-effective. But they require fine-tuning as to not deteriorate system performance. In some cases, it is worth missing the H2 production requirement in exchange for higher economic performance.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

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

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

Life in the modern century is heavily reliant on an enormous amount of electricity consumption as technology has become the most integral part of daily life. In this context, smart grid systems play a pivotal role to maintain the uninterrupted power supply which needs to be monitored in a timely fashion to keep track of the electric consumers’ usage pattern. The smart meter is the one of smart applications of the smart grid that collects huge amounts of consumer load data on a daily basis which has become a focus for various researchers and analyzers to study load characterization. In this paper, an approach has been proposed to recognize the energy consumption patterns among diverse types of consumers ranging from residential to industrial levels. This approach is worth considering not only for load pattern recognition but also for involving customers in different events such as demand response or peak shaving. In such a way, this analytical mechanism certainly assists in reducing power wastage and saving costs. The proposed methodology is based on a two-fold clustering algorithm with the use of state-of-the-art technology, machine learning. The primary goal is to classify electric customers' data collected from smart meters. Then, analyzing the classified results with an aim to predict power consumption patterns for the customers in the future and making the right energy policy that will benefit both the grid operator and consumers as well.

Finding anomalies in the real-time system is recognized as one of most challenging study in information security. It has so many applications like IoT, and Stock-Market. In any IoT system the data generated are real-time, and temporal in nature. Since due to the extreme exposure to Internet and interconnectivity of devices, the IoT systems often face issues like fraud, anomalies, intrusions etc. Discovering anomaly in such domain can be interesting. Clustering and rough set theory have been tried in many cases. Considering the time-stamp associated with IoT data, time-dependent patterns like periodic clusters can be generated which could be helpful for the efficient detection of anomalies by providing more in-depth analysis of the system. In this paper, a mixed method comprising of nano topology, a modified k-means clustering and an interval superimposition technique is used for finding fuzzy periodic clusters in the subspace generated by the nano topology. For every clusters there will be an associated sequence of time-intervals where it exists. The sequence time-intervals accompanying with each clusters may exhibit some remarkable patterns. For example, there may exist different types of periodicity namely yearly, monthly, daily, and hourly etc. For finding such fuzzy periodicity, an operation called interval-superimposition has been used. The time-intervals associated with each cluster are superimposed if they have reasonable overlapping. Each superimposed time-interval generates a fuzzy time-interval. The data instances are thought to be anomalous if they either belong to sparse clusters or don't belong to any clusters. The efficacy of the method can be assessed by means of both time-complexity analysis and comparative studies with existing clustering-based anomaly detection algorithms with a real-life and a synthetic dataset. It can been found experimentally that our method can extract anomaly with 98% of accuracy and it runs cubic time approximately.

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.

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.

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.

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.

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

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

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

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

In this work, we propose a self-supervised multi-agent system that meets the online learning of clustering tasks for video behavior recognition spatio-temporal tasks. Encoding visual behavioral actions as discrete temporal sequence(DTS). Real-time clustering recognition task in a multi-agent system for continuous model building, training, and correction. Finally, we implemented a fully decentralized multi-agent system and completed its feasibility verification in a surveillance video application scenario on vehicle path clustering.

We describe a new approach for integrating multiple views of data into a common latent space using non-negative tensor factorization (NTF). This approach, which we refer to as the "Integrated Sources Model" (ISM), consists of two main steps: embedding and analysis. In the embedding step, each view is transformed into a matrix with common non-negative components. In the analysis step, the transformed views are combined into a tensor and decomposed using NTF. Noteworthy, ISM can be extended to process multi-view data sets with missing views. We illustrate the new approach using two examples: the UCI digit dataset and a public cell type gene signatures dataset, to show that multi-view clustering of digits or marker genes by their respective cell type is better achieved with ISM than with other latent space approaches. We also show how the non-negativity and sparsity of the ISM model components enable straightforward interpretations, in contrast to latent factors of mixed signs. Finally, we present potential applications to single-cell multi-omics and spatial mapping, including spatial imaging and spatial transcriptomics, and computational biology, which are currently under evaluation. ISM relies on state-of-the-art algorithms invoked via a simple workflow implemented in a Jupyter Python notebook.

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

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.

The question of molecular similarity is core in cheminformatics, and is usually assessed via a pairwise comparison based on vectors of properties or molecular fingerprints. We recently exploited variational autoencoders to embed 6M molecules in a chemical space, such that their (Euclidean) distance within the latent space so formed could be assessed within the framework of the entire molecular set. However, the standard objective function used did not seek to manipulate the latent space so as to cluster the molecules based on any perceived similarity. Using a set of some 160,000 molecules of biological relevance, we here bring together three modern elements of deep learning to create a novel and disentangled latent space, viz transformers, contrastive learning, and an embedded autoencoder. The effective dimensionality of the latent space was varied such that clear separation of individual types of molecules could be observed within individual dimensions of the latent space. The capacity of the network was such that many dimensions were not populated at all. As before, we assessed the utility of the representation by comparing clozapine with its near neighbours, and did the same for various antibiotics related to flucloxacillin. Transformers, especially when as here coupled with contrastive learning, effectively provide one-shot learning, and lead to a successful and disentangled representation of molecular latent spaces that at once uses the entire training set in their construction while allowing ‘similar’ molecules to cluster together in an effective and interpretable way.

This article shows the numerical results and the analysis of households' degree of knowledge in an intermediary city such as Huelva (Andalusia, Spain) about the sustainable use of urban water. It analyzes the needs and values regarding water and the attitudes that households maintain regarding the acceptance of reclaimed water and the use of new technologies to achieve more efficient and sustainable consumption. These results are part of the stages of needfinding and synthesis of Design Thinking methodology, adopted as a framework to improve the efficiency and sustainability of urban water among households in this city. Different statistical analysis techniques of surveys sent to households and the use of clustering are the mathematical tools used to draw conclusions and recommendations that allow the design of a web-based prototype grounded on Product Service Systems methodology, as a tool to improve the engagement of households concerning water and align citizens with the sustainability of their city. Strategies of customization and technological facilitators will be the means to improve the hydrosocial contract among households in Huelva in future later stages of the project.

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.

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

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

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

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

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

In the field of industrial process monitoring, more and more interest is being shown in specific process categories. These include time-varying processes, that is, those processes whereby the response one receives as output from the system depends on when the input signal is sent into it. There are many reasons for this process variability and such contexts are not always analyzed with this operational characteristic at their core. At the same time, interest in certain categories of techniques is also becoming more prominent, to meet certain application needs. Among these, clustering and unsupervised techniques in general are gaining ground. This is largely due to the difficulty of finding fault data with which to train, for example, supervised models. On the other hand, the clustering technique, on which this contribution focuses, also makes it possible to compensate for the lack of complete knowledge of the structure of the process itself. With these two considerations in mind, this contribution proposes a literature review on the topic of clustering applied in time-varying contexts, in the maintenance field. The aim is to present an overview of the main fields of study, the role of clustering in this context and the main clustering techniques used.

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.

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.

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.

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.

Vehicular ad-hoc network (VANET) is a type of mobile network which is used for establishing connection between vehicles (M2M) and also between vehicles and nearby stationary equipment which are often road-side equipment. The main target of VANET is to provide security and convenience for the passengers. In order to achieve this goal, a special electronic device called OBU (On-Board Unit) is embedded in each vehicle which makes the connection between vehicles and between the vehicles and the road-side equipment possible. In this paper, the Location-Aware Clustering in Vehicular Ad-hoc Networks (LAC-VANET) is proposed. We try to achieve the main and major goal in VANET networks, i.e. fast propagation of security and urgent messages in ITS systems, using clustering and selecting the best cluster head based on Fuzzy logic such that the cluster head can transfer important information such as the obstacles and accidents detected on the road with a suitable speed and without creating a large traffic load in the vehicle network in order to notify other vehicles and prevent the danger and vehicle accidents. Moreover, LAC-VANET method is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the VANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), end to end delay, and packet loss rate.

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.

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.

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

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

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.

Two well-known drawbacks in fuzzy clustering are the requirement of assign in advance the number of clusters and random initialization of cluster centers.; the quality of the final fuzzy clusters depends heavily on the initial choice of the number of clusters and the initialization of the clusters, then it is necessary to apply a validity index to measure the compactness and the separability of the final clusters and run the clustering algorithm several times. We propose a new fuzzy C-means algorithm in which a validity index based on the concepts of maximum fuzzy energy and minimum fuzzy entropy is applied to initialize the cluster centers and to find the optimal number of clusters and initial cluster centers in order to obtain a good clustering quality, without increasing time consumption. We test our algorithm on UCI machine learning classification datasets comparing the results with the ones obtained by using well-known validity indices and variations of FCM using optimization algorithms in the initialization phase. The comparison results show that our algorithm represents an optimal trade-off between the quality of clustering and the time consumption.

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.

Cardiovascular disease is the number one cause of death in the world and Quoting from WHO, around 31% of deaths in the world are caused by cardiovascular diseases and more than 75% of deaths occur in developing countries. The results of patients with cardiovascular disease produce many medical records that can be used for further patient management. This study aims to develop a method of data mining by grouping patients with cardiovascular disease to determine the level of patient complications in the two clusters. The method applied is principal component analysis (PCA) which aims to reduce the dimensions of the large data available and the techniques of data mining in the form of cluster analysis which implements the K-Medoids algorithm. The results of data reduction with PCA resulted in five new components with a cumulative proportion variance of 0.8311. The five new components are implemented for cluster formation using the K-Medoids algorithm which results in the form of two clusters with a silhouette coefficient of 0.35. Combination of techniques of Data reduction by PCA and the application of the K-Medoids clustering algorithm are new ways for grouping data of patients with cardiovascular disease based on the level of patient complications in each cluster of data generated.

Recently, various applications of indoor location-based services using Wi-Fi fingerprint data have been studied. However, since fingerprint data collected at a specific location does not have continuous information between signals and correlation information between signals, path data cannot exist in principle. Therefore, most indoor positioning technologies are based on predicting the position of a stationary positioner at a specific location based on signal data collected at a specific location in the indoor space. Due to the discontinuous nature of these signals, they are unable to account for user movement. Therefore, there is a need for techniques to improve the accuracy of indoor positioning in moving situations. This paper proposes a method for enriching all data points with relevant information to obtain improved indoor positioning results and an improved technique for generating movement path data. The proposed technique generates relevant information with continuity by expressing data points as Bounding Boxes (BB) and subsequently clustering them using grid cells. Through the proposed method, we represented and expanded the indoor location data, which consists of data points, as BB. However, data points represented by BB do not have any adjacency information with each other, and as a result, it is not possible to create a movement path between neighboring BB. To solve the problem, we used clustering, a machine learning technique that categorizes data points into groups, to group BBs. This was done by constructing a YOLO (You Only Look Once) grid cell that included all BBs and clustered them into grid cells that were divided into specific regions through the suggestion phase. The clustering results align with the indoor structure of the building, indicating that the data points have been appropriately clustered. BBs inside a grid cell are contained within a moveable area and have related information. We also generated association information between neighboring grid cells through the proposal technique, and then generated path information that can be traveled between grid cells. In this paper, we use the movement path information generated from a dataset as training data for machine learning, and through this, we propose an enhanced indoor positioning technology.

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.

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.

Worldwide, about one in eight people live in slums. Empirical studies based on satellite data have identified that the size distributions of this type of settlement are similar in different cities of the Global South. Based on these results, we developed a model describing the formation of slums with a Turing mechanism, in which patterns are created by diffusion-driven instability and the inherent characteristic length of the system is independent of boundary conditions. We examine the model in this paper by critically reflecting its assumptions, comparing them with recent empirical observations and discussing possible adjustments and future extensions based on new methods of identifying pattern formation mechanisms.

Various type of soils have been identified based on their electrical and magnetic properties, especially with regards to peat soils. Peat soils are commonly considered as partly decomposed vegetation. In this study, electrical and magnetic properties have been used in K-means clustering to identify layers of peat soils. K-means clustering is a partitioning method that treats observations in the data. Data cores were obtained at every centimeter and examined for their electrical conductivity (σ) and magnetic susceptibility (χ_m) properties. A 291 cm core was obtained at Tegal Arum Village in South Kalimantan, Indonesia. The K-means clustering results indicate two different layers at 148 cm, and this is supported by loss on ignition (LOI) measurements. In the first layers, a 87.65% LOI was found associated with peat soils (above 248 cm). Whereas, in the second layers, there was a 26.11% LOI associated with mineral soils (below 248 cm). The results of this study using K-means clustering can be used to delineate soil layers.

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.

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 safe and reliable operation of autonomous vehicles in complex and dynamic environments is heavily dependent upon exteroceptive and proprioceptive sensors. A LiDAR system generates accurate 3D point clouds, which are crucial for the detection, classification, and tracking of multiple targets. LiDAR data, however, presents significant challenges due to its density, noise, and varying sampling rates. In this study, various clustering and MTT techniques for LiDAR point clouds will be identified and classified within the context of autonomous driving to assess the state-of-the-art methods’ key challenges and their performances. We have categorized clustering and MTT methods used in AV applications, identified research gaps and challenges and analyzed existing algorithms and their challenges in detail. Researchers and practitioners in the field of autonomous driving will find this review to be a valuable resource.

In this study we sought to investigate the impact of urbanization, presence of concrete river bottom, and nutrient pollution on microbial communities along the L.A. River. Six molecular markers were evaluated for identification of bacteria, plants, fungi, fish, and invertebrates in 90 samples. PCA (principal components analysis) was used with PAM (partitioning around medoids) clustering to reveal community structure and an NB (Negative binomial) model in DESeq2 was used for differential abundance analysis. PCA and factor analysis exposed the main axes of variation but were sensitive to outliers. Differential abundance of Proteobacteria was associated with soft bottom sites, and there was an apparent balance in the abundance of organisms responsible for nitrogen cycling. Nitrogen cycling was explained by differential abundance of ammonia oxidizing archaea, the complete ammonia oxidizers Nitrospira sp., nitrate reducing bacteria Marmoricola sp., and nitrogen fixing bacteria Devosia sp. which were differentially abundant at soft-bottom sites (p adj < 0.002). In contrast, differential abundance of several Cyanobacteria and other anoxygenic phototrophs was associated with the concrete bottom sites, which suggested the accumulation of excess nitrogen. The soft bottom sites tended to be represented by differential abundance of aerobes, whereas the concrete-associated species tended to be alkaliphilic, saliniphilic, calciphilic, sulfate dependent, and anaerobic. In Glendale Narrows, downstream from multiple water reclamation plants, there were differential abundance of cyanobacteria and algae, however indicator species for low nutrient environments and ammonia-abundance were also present. There was differential abundance of ascomycetes associated with Arroyo Seco and a differential abundance of Scenedesmaceae green algae and cyanobacteria in Maywood, in the analysis which compared suburban with urban river communities. The proportion of Ascomycota to Basidiomycota within the LA River differed from the expected proportion based on published worldwide freshwater and river 18S data; the shift in community structure was most likely associated with the extremes of urbanization. This study indicates that extreme urbanization can result in overrepresentation of cyanobacterial species that could cause reductions in water quality and safety.

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.

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.

Cardiovascular disease (CVD) and obesity are prevalent public health concerns with grave implications for morbidity and mortality, necessitating tailored interventions. This research explores the utility of fuzzy c-means clustering paired with principal component analysis (PCA) in detecting at-risk groups and personalizing health strategies for these conditions. Fuzzy c-means clustering allows for the dynamic classification of individuals into groups based on unique risk factors and intervention outcomes, while PCA aids in distilling complex data sets to uncover underlying patterns. The conjoined use of these methods has shown promise in identifying diverse risk profiles and in forecasting intervention success rates. The study acknowledges limitations, including possible biases stemming from data set composition and analytical parameter selection. Future research aims to refine these tools for clinical application. The results support implementing fuzzy c-means clustering and PCA for delineating specific target populations for health interventions, emphasizing careful use of these analytical approaches. Subsequent studies should focus on correlating these techniques with concrete clinical results to enhance public health measures.

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

Tuberculosis (TB), an infectious airborne disease caused by Mycobacterium tuberculosis (Mtb), is a serious public health threat reported as the leading cause of morbidity and mortality worldwide. South Africa is a high TB burden country with TB being the highest infectious disease killer. The study investigated the distribution and clustering of Mtb mutations and spoligotypes in rural Eastern Cape Province. The Mtb isolates included were 1,157 from DR-TB patients and analysed by LPA followed by spoligotyping of 441 isolates, of these, 36 were whole genome sequenced. Distribution of mutations and spoligotypes was done by spatial analysis and clustering analysis was done by Bayesian model-based clustering of allele frequencies at heterozygous sites, using Mclust package in R. The rpoB gene had highest number of mutations. The distribution of rpoB and katG mutations was more prevalent in four health care facilities, inhA mutations were more prevalent in three healthcare facilities and heteroresistant isolates were more prevalent in five healthcare facilities. The Mtb was genetically diverse with Beijing more prevalent and largely distributed. Spatial analysis and mapping of gene mutations and spoligotypes revealed better picture of distribution. Clustering of isolates indicates that there is transmission of mixed infection in this area.

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.

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.

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

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.

Myocarditis is the form of an inflammation of the middle layer of the heart wall which is caused by a viral infection and can affect the heart muscle and its electrical system. It has remained as one of the most challenging diagnoses in cardiology. Myocardial is the prime cause of unexpected death in approximately 20% of adults less than 40 years of age. Cardiac MRI (CMR) has been considered as a noninvasive and golden standard diagnostic tool for suspected myocarditis and plays an indispensable role in diagnosing various cardiac diseases. However, the performance of CMR is heavily dependent on the clinical presentation and non-specific features such as chest pain, arrhythmia, and heart failure. Besides, other imaging factors like artifacts, technical errors, pulse sequence, acquisition parameters, contrast agent dose, and more importantly qualitatively visual interpretation can affect the result of the diagnosis. This paper introduces a new deep learning-based model called Convolutional Neural Network-Clustering (CNN-KCL) to diagnose the Myocarditis. The hybrid CNN-KCL method performs the early and accurate diagnosis of Myocarditis. To the best-of-our-knowledge, a Convolutional neural network has never been used before for the diagnosis of Myocarditis. In this study, we used 47 subjects to diagnose myocarditis patients from Tehran's Omid Hospital. The total number of data examined is 10425. Our results demonstrate that CNN-KCL achieves 92.3% in terms of diagnosis myocarditis prediction accuracy which is significantly better than those reported in previous studies.

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.

As Heterogeneous Wireless Sensor Network (HWSN) fulfill the requirements of researchers in the design of real life application to resolve the issues of unattended problem. But, the main constraint face by researchers is energy source available with sensor nodes. To prolong the life of sensor nodes and hence HWSN, it is necessary to design energy efficient operational schemes. One of the most suitable routing scheme is clustering approach, which improves stability and hence enhances performance parameters of HWSN. A novel solution proposed in this article is to design energy efficient clustering protocol for HWSN, to enhance performance parameters by EECPEP-HWSN. Propose protocol is designed with three level nodes namely normal, advance and super node respectively. In clustering process, for selection of cluster head we consider three parameters available with sensor node at run time, i.e., initial energy, hop count and residual energy. This protocol enhance the energy efficiency of HWSN, it improves performance parameters in the form of enhance energy remain in the network, force to enhance stability period, prolong lifetime and hence higher throughput. It is been found that proposed protocol outperforms than LEACH, DEEC and SEP with about 188, 150 and 141 percent respectively.

The research analysed the publications metric of literature regarding the impact of socially responsible investing (SRI) and environmental, social, and governance (ESG) on portfolio and financial performance. The study aimed to determine the latest trends, key themes, authors, and influential journals. Data from the SCOPUS database was used in this study. A total of 1377 research articles from academic journals related to this topic and published from 2013 to 2022, they data was cleaned to remove duplicate, and documents that do not meet the criteria of this study. For this bibliometric analysis, a total of 260 articles were chosen in order to summarise the collective knowledge and emerging patterns in ESG, SRI, ethical, and impact investing, a bibliometric analysis was employed. The thematic map classified the ESG, SRI, and performance relationship themes into four categories of themes: niche themes, motor themes (corporate financial performance, corporate social performance, ESG, ESG factors, sustainability, performance, integrated reporting, gender diversity, and board size), emerging or declining themes (social responsibility, environmental performance, socially responsible investment, ethical investment, and SRI), and basic or transversal themes (financial performance, corporate social performance, ESG performance, environmental, social, and governance). Social responsible investing, engagement, and ESG, implies a position between niche themes and highly developed topic/emerging or decreasing theme, and covid, ROA, while, tobin’s Q, implies a position between highly developed topic/emerging or decreasing theme and basic theme. The findings contribute to the enhanced understanding of ESG, SRI, ethical, and impact investing, which are crucial for an efficient capital market in promoting sustainability and sustainable development. The study offers vital practical implications and future research directions.

The chemical feedback between building blocks in templated polymerization of diblock copolymers and their consecutive micellization was studied for the first time by means of coarse-grained molecular dynamics simulations. Using a stochastic polymerization model, we were able to reproduce the experimental findings on the effect of chemical feedback on the polymerization rates at low and high solution concentrations. The size and shape of micelles were computed using a newly development software in python conjugated with graph theory. In full agreement with the experiments, our simulations revealed that micelles formed by the templated micellization are more spherical and have lower radius of gyration than those formed by the traditional two-step micellization method. Understanding the underlying mechanisms in templated reaction/assembly of polymers will help for rational design of new synthetic supramolecular materials.

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.

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