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.

Based on the prosed criterion of the type of heating, a classification of the sources of pulsed electron beams was carried out, for better understanding both the nature of the thermal processes occurring under irradiation and for predicting their suitability for certain applications. The melting thresholds of materials were calculated over the wide ranges of accelerating voltages and pulse durations. On the basis of calculations, a refractoriness series of metals for surface-volume pulsed heating was proposed.

We simulate elementary calcium release events (sparks) in a single calcium release unit in ventricular myocyte. Previously developed and tested electron-conformational model of the stochastic dynamics of RyR-channels is integrated to the calcium dynamics model in the cardiac cell. This approach allows to observe RyRs opening/closing in details on the macromolecular level during the calcium dynamics course. We simulate calcium diffusion in the dyadic space and “domino-like” RyR’s activation during the so-called “calcium induced-calcium release process”. Ca²⁺ sparks initiation, spread and termination are investigated in the computer experiments. Sparks’ initiation and termination rate dependence on the Ca²⁺ diffusion velocity is observed. We show that sarcoplasmic reticulum lumen local depletion and RyR’s stochastic attrition could be the reasons of Ca²⁺ spark termination.

The term Air Quality (AQ) pertains to the standard of air, which has a direct impact on the health and well-being of individuals. It is crucial to maintain high Air Quality (AQ), for better health and productivity. Though most of people spend more time indoors nowadays, it is not to be overlooked that the pollutant concentration in indoor air is directly linked to the outdoor air quality. Due to the changes in occupancy patterns, outdated maintenance of ventilation systems, and structural flaws in buildings, the indoor air is significantly polluted; pollutants emitted outdoors enter indoor air through open windows, ventilation systems and infiltration. In this paper, we have proposed a new technique, DTMCPM (discrete-time Markov chain (DTMC) model for the analysis and forecasting of AQ, using the power method). Specialized sensors and equipment to measure different pollutants, such as particulate matter, ozone, nitrogen dioxide, sulfur dioxide, benzene and toluene, are used to collect data by the Institute of Pakistan Air Quality Monitor in various cities; the data is converted to US EPA standard for all pollutant species. This data is used to calculate the transition matrix, steady-state values and mean return rate for the analysis of IAQ. The calculated and actual return rates have been compared and the proposed model is found to have a low average prediction error of 2.356%.

In this paper, we aim to assess the electric current parameters and report the analysis of the associated degree of ventricular recovery during left ventricular assist device (LVAD) support. An assumption was made there is a linear relationship between ventricular recovery degree and the pump electric current pulsatility index (PI). The experimental study was carried out using the ViVitro Pulse Duplicator System with Sputnik 1 LVAD connected. Cardiac output (CO) and cardiac power output (CPO) were used as a measure of ventricular recovery degree. Different heart rates (HR) (59, 73, 86 bpm) and pump speeds (7600–8400 rpm in 200 rpm steps) were investigated. Ventricular stroke volumes in the range of 30–80 ml for each heart rate at certain pump speed were used. The obtained relationships of CO and CPO vs. PI was linear as the coefficients of determination for each regression curve were more than 0.8. CO vs. PI: R2=0.9218; 0.9271; 0.9172 and CPO vs. PI: R2=0.8517; 0.841; 0.8244 for HR=59 bpm; 73 bpm; 86 bpm, respectively. Study findings suggest that adequate interpretation of parameters could potentially serve as a valuable clinical tool to assess ventricular recovery based on LVAD infrastructure without requiring any special hemodynamic assessment.

In this paper, we investigate the Green measure for a class of non-Gaussian processes in $\mathbb{R}^{d}$. These measures are associated with the family of generalized grey Brownian motions $B_{\beta,\alpha}$, $0

This study considers an application of the first-order Grey Markov Model to foresee the values of Italian power generation in relation to the available energy sources. The model is used to fit data from the Italian energy system from 2000 to 2022. The integration of Markovian error introduces a random element to the model, which is able now to capture inherent uncertainties and misalignments between the Grey model predictions and the real data. This application provides valuable insights for strategic planning in the energy sector and future developments. The results show good accuracy of the predictions, which provides powerful information for the effective implementation of energy policies concerning the evolution of energy demand in the country. Despite advancements, Italy’s 2032 energy mix will still significantly rely on fossil fuels, emphasizing the need for sustained efforts beyond 2032 to enhance sustainability.

To increase the calculation speed of the computational fluid dynamics (CFD) based simulation for the gas-solid flow in fluidized beds, a Markov chain model (MCM) is developed to simulate the particle movement in a two-dimensional (2D) circulating fluidized bed (CFB) riser. As a statistic model, the MCM takes the CFD-discrete element method (DEM) results as samples to calculate the transition probability matrix of particles, which can describe the macroscopic regularities of the particle movement and guide the numerical simulation of the particle motion based on the Monte Carlo method. The particle distribution snapshots, residence time distribution (RTD) and mixing obtained from both the CFD-DEM and the MCM are compared. Results show that the computational speed of the MCM is faster than that of the CFD-DEM by about 2 orders of magnitude, and the difference of the mean particle residence time calculated by the two models is less than 2%. Besides, the MCM can well describe the time-averaged particle mixing compared to the CFD-DEM.

Improper sitting positions are known as the primary reason for back pain and the emergence of musculoskeletal disorders (MSD) among individuals who spend prolonged time working with computer screens, keyboards, and mice. At the same time, it is well understood that automated technological tools can play an important role in the process of unhealthy habit alteration, so plenty of research efforts are focused on research and technology development (RTD) activities that aim to provide support to the prevention of back pain or the development of MSD. Here, we report on creating a new resource in support of RTD activities aiming at the automated detection of improper sitting positions. It consists of multimodal multisensory recordings of 100 persons made with a video recorder, camera, and wrist-attached sensors that capture physiological signals (PPG, EDA, Skin temperature), as well as motion sensors (three-axis accelerometer). Our multimodal multisensory dataset (MMD-MSD) opens new opportunities for modeling the body stance (sitting posture and movements), physiological state (stress level, attention, emotional arousal, valence), and performance (success rate on the Stroop test) of people working with a computer. Finally, we demonstrate two use cases: improper neck posture detection from pictures and cognitive load detection from physiological signals.

A two-layer Fe-Cr-Al-Zr surface alloy was synthesized on a zirconium substrate by magnetron sputtering and subsequent low-energy high-current electron-beam (LEHCEB) processing. Thicknesses of the top Fe69Cr20Al11 (at.%) relatively large-grained (~1 µm) and transition Fe-Zr Cr-Al amorphous layers were about 0.7 and 0.6 µm, respectively. In turn, the amorphous layer consisted of two Fe64–54Zr8–22Cr21–17Al8–7 and Fe40–16Zr42–78Cr12–4Al6–2 (at.%) sublayers, differing in both zirconium and iron concentrations in wide ranges, which were separated by another nanocrystalline interlayer. The Fe-Cr-Al-Zr surface alloy serve as a diffusion barrier, preventing interaction of the zirconium substrate with oxygen from an environment. It was thermally stable up to ≈1173 K.

A new evolutionary game is introduced which incorporates states and actions into the strategies of the organisms of the evolving populations. The game centrally features actions that result in demographic flow between states that may not conserve organism numbers. It is by this feature that the game encapsulate a range of other evolutionary games, and can encode almost very complex interactions between organisms, species and populations. The game's formalism is expounded and the nature of the game's equilibrium is discussed. This discussion leads to an algorithm for numerically determining the stable equilibrium points which is exemplified in the context of a modified Hawk-Dove game. The game's flexibility for modeling population dynamics is evaluated and compared with other evolutionary games.

Numerous types of oligonucleotide modifications have been developed since automated synthesis of DNA/RNA became a common instrument in the creation of synthetic oligonucleotides. Despite the growing number of types of oligonucleotide modifications under development, only a few of them, and moreover, their combinations have been studied wide enough in terms of their in-fluence on the properties of corresponding NA constructions. In the present study, a number of oligonucleotides with combinations of 3′ end lipophilic (single cholesteryl or pair of dodecyl residues) and phosphate backbone modifications were synthesized. The influence of the combi-nation of used lipophilic groups with phosphate modifications of various nature and different position on the efficiency of cell penetration was evaluated. Obtained results indicate that even a couple of phosphate modifications are able to affect a set of oligonucleotide properties in a complex manner and can remarkably change cellular uptake. These data clearly show that the strategy of using different patterns of modification combinations has great potential for the ra-tional design of oligonucleotide structures with desired predefined properties.

This paper aims to address the exponential stability and stabilization problems for a class of delayed nonlinear Markov jump systems under randomly occurring Denial-of-Service (DoS) attack and packet loss. Firstly, the stochastic characteristics of DoS attack and packet loss are depicted by the attack success rate and packet loss rate. Secondly, a Period Observation Window (POW) method and a hybrid-input strategy are proposed to compensate for the impact of DoS attack and packet loss on the system. Thirdly, A Dynamic Event-triggered Mechanism (DETM) is introduced to save more network resources and ensure the security and reliability of systems. Then, by constructing a general common Lyapunov functional and combining with the DETM and other inequality analysis techniques, the less conservative stability and stabilization criteria for the underlying systems are derived. In the end, the effectiveness of our result is verified through a numerical example.

Reducing the costs of repairing concrete structures damaged due to the appearance of cracks and reducing the number of people involved in the process of their repair is the subject of a multitude of experimental studies. Special emphasis should be placed on research involving industrial by-products, the disposal of which has a negative environmental impact, as is the case in the research presented in this paper. The basic idea was to prepare a mortar with added granulated blast furnace slag from Smederevo Steel Mill and then treat artificialy produced cracks with a Sporosarcina pasteurii DSM 33 suspension under the conditions of sterile demineralized and water from Danube river in order to simulate natural conditions. The results show a bio-stimulated healing efficiency of 32.02% in sterile demineralized water and 42.74% in Danube water already after 14 days. The SEM images clearly show calcium carbonate crystals as the main compound that has started to fill the crack, and the crystals are much more developed under the Danube water conditions. As a special type of research, microscopic images of cracks were classified into those with and without the presence of bacterial culture. By applying convolutional neural networks (ResNet 50), the classification success rate was 91.55%.

The prolonged static sitting at the workplace is considered as one of the main risks for development of musculoskeletal disorders (MSDs) and adverse health effects. Factors such as poor posture and extended sitting are perceived to be a reason for conditions such as lumbar hyperlordosis and lower back pain (LBP), even though the scientific explanation of this relationship is still unclear and raises disputes in the scientific community. This publication proposes the low back pain assessment (LBPA) dataset collected through experiment with 100 participants and consisting of photogrammetric images with intentionally placed body markers, calculated postural angles and tags correct and incorrect posture assessed by habilitated rehabilitator, as well as questionnaire-based self-reports regarding the occurrence of LBP and similar symptoms among the participants. Machine learning models trained with this data are employed for recognizing incorrect body postures. Two scenarios have been elaborated for modeling purposes: scenario 1, based on natural body posture tagged as correct and incorrect, and scenario 2, based on incorrect body postures, corrected additionally by the rehabilitator. The achieved accuracies of respectively 75.3% and 85% for both scenarios reveal the potential for future research in enhancing awareness and actively managing posture-related issues that elevate the likelihood of developing lower back pain symptoms.

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.

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

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

Markov chain Monte Carlo sampling propagators, including numerical integrators for stochastic dynamics, are central to the calculation of thermodynamic quantities and determination of structure for molecular systems. Efficiency is paramount, and to a great extent, this is determined by the integrated autocorrelation time (IAcT). This quantity varies depending on the observable that is being estimated. It is suggested that it is the maximum of the IAcT over all observables that is the relevant metric. Reviewed here is a method for estimating this quantity. For reversible propagators (which are those that satisfy detailed balance), the maximum IAcT is determined by the spectral gap in the forward transfer operator, but for irreversible propagators, the maximum IAcT can be far less than or greater than what might be inferred from the spectral gap. This is consistent with recent theoretical results (not to mention past practical experience) suggesting that irreversible propagators generally perform better if not much better than reversible ones. Typical irreversible propagators involve a parameter controlling the mix of ballistic and diffusive movement. To gain insight into the effect of the damping parameter for Langevin dynamics, its optimal value is obtained here for a multidimensional quadratic potential energy function.

The study examines projected changes in dry- and wet-spell probabilities in West Africa using a Markov chain approach. Four simulations of regional climate models from the CORDEX-Africa program were used to analyze projected changes in intraseasonal variability. The results show an increase in the probability of having a dry day, a dry day preceding a wet day and a dry day preceding a dry day, and a decrease in the probability of wet days in the Sahel region under anthropogenic forcing scenarios RCP4.5 and RCP8.5. The decrease in wet days is stronger in the far future and under the RCP8.5 scenario (up to -30%). The study also finds that the probability of consecutive dry days (lasting at least 7 days and 10 days) is expected to increase in the Western Sahel, the Central Sahel, and the Sudanian Area under both scenarios, with stronger increases in the RCP8.5 scenario. In contrast, the decrease is expected over the Guinea Coast, with the changes more important under the RCP4.5. These changes in dry- and wet-spell probabilities are important for water management decisions and risk reduction in the energy and agricultural sectors. The study also highlights the need for decision-makers to implement mitigation and adaptation policies to minimize the adverse effects of climate change.

A theoretical account of development in mesocortical anatomy is derived from the free energy principle, operating in a neural field with both Hebbian and anti-Hebbian neural plasticity. An elementary structural unit is proposed, in which synaptic connections at mesoscale are arranged in paired patterns with mirror symmetry. Exchanges of synaptic flux in each pattern form coupled spatial eigenmodes, and the line of mirror reflection between the paired patterns operates as a Markov blanket, so that prediction errors in exchanges between the pairs are minimized. The theoretical analysis is then compared to the outcomes from a biological model of cortical neurodevelopment, in which neuron precursors are selected by apoptosis for cell body and synaptic connections maximizing synchrony and also minimizing axonal length. It is shown that this model results in patterns of connection with the anticipated mirror symmetries, at micro-, meso- and inter-arial scales, among lateral connections, and in cortical depth, explaining the spatial organization and functional significance of neuron response preferences, and compatible with features of both columnar and noncolumnar cortex. Multi-way interactions of mirrored representations provide a preliminary anatomically realistic model of cortical information processing.

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

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

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

A correctly obtained Land-use/land-cover (LULC) prediction map is essential to under-standing and assessing future patterns. In the study, the LULC map of Urmia/Iran in 2030 was produced using two different prediction methods CA-Markov and Artificial Neural Network (ANN). In general, the study followed a methodology consisting of three steps. In the first steps, Landsat satellite images acquired in 2000, 2010 and 2020 were classified with maximum likelihood algorithm and LULC maps were prepared for each year. In the second stage, to investigate the LULC prediction methods' validation (CA-Markov and ANN) the LULC prediction map of 2020 was produced using the LULC map of 2000 and 2010; In this step, the predicted LULC map of 2020 and the actual LULC map of 2020 were evaluated by correctness, completeness and quality indexes. Finally, The LULC map for 2030 was prepared using all two algorithms and the change map was extracted. The results show that the area of soil and vegetation decreased, and built-up regions increased during the research period. The methods validation results show that the two algorithms are much closer to each other. Nevertheless, in general, ANN has the highest completeness (96.21%) and quality (93.8%) and CA-Markov the most correctness (96.47). This study shows that the CA-Markov algorithm is most successful in predicting the future that had larger areas and a higher percentage in the region (urban and vegetation cover) and the ANN algorithm in predicting phenomena that had smaller levels with fewer percentages (soil and rock).

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.

Theoretical mathematics is a key evolution factor of Artificial Intelligence (AI). Nowadays, representing a Smart system as a mathematical model helps to analyze any system with under development and support different case studies found in the real life. Additionally, the Markov chain has shown itself to be an invaluable tool for decision-making systems, natural language processing, and predictive modelling. In an Internet of Things (IoT), Machine-to-Machine (M2M) traffic necessitates new traffic models due to its unique pattern and different goals. In this context, we have two types of modeling: 1) Source Traffic modeling used to design stochastic processes such that they match the behavior of physical quantities of measured data traffic (e.g., video, data, voice). 2) Aggregated Traffic modeling which refers to the process of combining multiple small packets into a single packet in order to reduce the header overhead in the network. In real world, the heavy challenge is striking a balance between the model accuracy and dealing with a massive number of M2M devices. On the one hand, due to their reliability, Source traffic models have a competitive advantage over Aggregated traffic models. On the other hand, their complexity is expected to make managing the exponential growth of M2M devices difficult. In this paper, we propose a Markov Modulated Poisson Processes (MMPP) framework to study M2M heterogeneous traffic effects as well as Human-to-Human (H2H) traffic using MMPP. To characterize the H2H and M2M coexistence, we use Markov chains as a stochastic process tool. Once using the traditional evolved Node B (eNodeB), our simulation results show that the network's service completion rate will suffer significantly. In the worst-case scenario, when an accumulative storm of M2M requests attempts to access the network simultaneously, the degradation reaches 8% as a completion task rate. However, using our "Coexistence of Heterogeneous traffic Analyzer and Network Architecture for Long term evolution" (CHANAL) solution, we can achieve a service completion rate of 96%.

Purpose: To construct a hidden Markov model (HMM) for vigilance assessment to improve the real-time performance and accuracy of current vigilance measurement. Methods: ECG signal was collected by sensors, while the noise and baseline drift was eliminated from the original ECG signal. 10 volunteers were randomly selected. Their heart rate variability (HRV) were measured and trained parameters of the modified Hidden Markov model for vigilance assessment. Then, these data were collected to optimize using the Baum-Welch algorithm and obtained the state transition probability matrix A ̂ and the observation probability matrix B ̂. Finally, the data of three volunteers with different transition patterns of mental state were selected randomly and used the Viterbi algorithm to find the optimal state, which compared with the actual state. Results: The constructed vigilance assessment model had a high accuracy rate the accuracy rate of data prediction for these three volunteers exceeded 80%. Conclusion: The Hidden Markov model for vigilance assessment can accurately predict the vigilance level and indicate broad application prospects.

Let us assume that defence mechanisms are so strong that the average outcome of a hacking attack is unsuccessful. How to calculate the costs arising from false positives and false negatives in intruder detection? Is it better for the hacker to make fewer but more effective attacks rather than several but less effective attacks? How to calculate the difference between these alternative strategies?

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.

Reliable models of pavement performance play a crucial role in effective decision-making for maintaining and rehabilitating this class of infrastructure assets. Probabilistic modeling approaches have gained popularity in pavement performance modeling because they account not only for the stochastic nature of pavement behavior and deterioration factor variations but also for the imperfections and inadequacy of pavement condition data in certain situations. One of these approaches, Markov chains, has been used extensively to model the probabilistic performance of pavements through an interesting variety of methodological tweaks in the Markov model structure. Unfortunately, the current literature lacks a synthesis of Markov chain models and their associated methodologies, as used in this manner. It is anticipated that a comprehensive synthesis of these models and their various forms can provide some insight into the variations of Markov model forms and methodologies, and the appropriate Markov model type to use for pavement deterioration and performance modeling under given conditions of data types and availability. To address this issue, this paper reviews Markov chain models used in the literature to model pavement deterioration and the methodologies used to estimate the transition probabilities matrix which is the key feature of Markov chain models. The paper presents a critical analysis of various aspects of Markov chain models as they were applied in the literature, reveals gaps in knowledge, and offers suggestions to address these gaps. The paper also develops a decision tree to select the appropriate Markov model type and TPM estimation methodology to model pavement deterioration under given conditions of data availability. This paper therefore provide guidance and decision support for researchers and highway agencies in selecting an appropriate probabilistic technique for modeling their pavement infrastructure performance in a robust manner.

In this paper, a Markov random field model is proposed to determine a site’s light pollution risk level. The specific data of 12 indicators of five typical cities in China is first collected to establish a hierarchical indicator system using an R-type clustering algorithm. Then, the entropy weight method is used to filter, determine 10-factor indicators, three potential impact indicators, and a light pollution risk index, and establish an undirected probability map model. A light pollution measurement based on Markov random field is obtained, and a location-based light pollution risk assessment index (LBLPRAI) is proposed. LBLPRAI of different types of sites is analyzed, and three possible intervention strategies are proposed to solve the light pollution problem: road lighting system planning, increasing vegetation coverage, and building system planning. Finally, the simulated annealing algorithm is used to determine the best intervention strategy, and it is concluded that the use of strategy 1 in the urban community 2 is the most effective measure, which can reduce the risk level of light pollution by 17.2%.

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

The idea of developing a robot controlled by iris movement to assist physically disabled individuals is indeed innovative and has the potential to significantly improve their quality of life. This technology can empower individuals with limited mobility and enhance their ability to interact with their environment. Disability of movement has huge impact on the life of physically disabled people. Therefore, there is need to develop a robot which can be controlled using iris movement. The main idea of this work revolves around iris recognition from an eye image, specifically identifying the centroid of the iris. The centroid's position is then utilized to issue commands to control the robot. This innovative approach leverages iris movement as a means of communication and control, offering a potential breakthrough in assisting individuals with physical disabilities. The proposed method aims to improve the precision and effectiveness of iris recognition by incorporating advanced segmentation techniques and fuzzy clustering methods. The fast gradient filters using a fuzzy inference system (FIS) is employed to separate the iris from its surroundings. Then, the bald eagle search (BES) algorithm is employed to locate and isolate the iris region. Subsequently, the Fuzzy KNN algorithm is applied for the matching process. This combined methodology aims to improve the overall performance of iris recognition systems by leveraging advanced segmentation, search, and classification techniques. The results of the proposed model are validated using True Success Rate (TSR) and compared to other existing models. The results highlight the effectiveness of the proposed method for the 400 tested images representing 40 people.

Organisms in the wild have cryptic life stages that are sensitive to changing environmental conditions and can be difficult to survey. In this study, I used mark-recapture methods to repeatedly survey Anaea aidea (Nymphalidae) caterpillars in nature, then modeled caterpillar demography as a hidden Markov process to assess if temporal variability in temperature and density influence the survival and growth of A. aidea over time. Individual encounter histories result from the joint likelihood of being alive and observed in a particular stage, and I included hidden states by separating demography and observations into parallel and independent processes. I constructed a demographic matrix containing the probabilities of all possible fates for each stage, including hidden states, e.g., eggs and pupae. I observed both dead and live caterpillars with high probability. Peak caterpillar abundance attracted multiple predators, and survival of fifth instars declined as per capita predation rate increased through spring. A time lag between predator and prey abundance was likely the cause of improved fifth instar survival estimated at high density. Growth rates showed an increase with temperature, but the most likely model did not include temperature. This work illustrates how state-space models can include unobservable stages and hidden state processes to evaluate how environmental factors influence vital rates of cryptic life stages in the wild.

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

The purpose of this study is to estimate the mean transitioning probabilities from a Healthy state to malaria positive uncomplicated state or to malaria positive severe state. It also classifies the various transitioning probabilities of moving through the various states based on some baseline characteristics. Malaria test results for 2019 over a 12-month period were collected from the University of Ghana school clinic. An H-U model for the study was developed and the transition rates from the cross-sectional data are indicated. With two states Healthy (H) and Uncomplicated (U) forming a state space, there were four possible transitions. The results show that the probability of transitioning from a Healthy state to a malaria positive state is 0.03% while the probability that an individual will remain at Healthy state (H) after the test is 99.73%. It was found that if an individual is already positive and has taken medication the probability that its second test came out negative is 6.45% while the chances that it will remain positive but uncomplicated is 93.55%. The study also showed that in the long run, about 95.98% of persons who visited the student clinic with malaria symptoms recorded negative tests for malaria parasite while about 4% recorded positive for malaria. In terms of disaggregation by gender, it was realized that the number of reported negative test results were higher for females (97.08%) than for males (96.13%). However, the infection rate is higher for males (3.87%) than females (2.92%). It is recommended that in as much as the University of Ghana has two health centers (a clinic and hospital), there should be a centralized system to track students’ health so research done would not be biased.

We consider the maximum entropy Markov chain inference approach to characterize the collective statistics of neuronal spike trains, focusing on the statistical properties of the inferred model. We review large deviations techniques useful in this context to describe properties of accuracy and convergence in terms of sampling size. We use these results to study the statistical fluctuation of correlations, distinguishability and irreversibility of maximum entropy Markov chains. We illustrate these applications using simple examples where the large deviation rate function is explicitly obtained for maximum entropy models of relevance in this field.

Experimental recordings of the collective activity of interacting spiking neurons exhibit random behavior and memory effects, thus the stochastic process modeling the spiking activity is expected to show some degree of time irreversibility. We use the thermodynamic formalism to build a framework, in the context of spike train statistics, to quantify the degree of irreversibility of any parametric maximum entropy measure under arbitrary constraints, and provide an explicit formula for the information entropy production of the inferred Markov maximum entropy process. We provide examples to illustrate our results and discuss the importance of time irreversibility for modeling the spike train statistics.

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

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 investigates the dynamic tail dependence risk between BRICS economies and world energy market in the context of the COVID-19 financial crisis of 2020, to determine optimal investment decisions based on risk metrics. For this purpose, the study employs a combination of novel statistical techniques ranging from Markov Switching, GARCH and Vine copula. Using a dataset consisting of daily stock and world crude oil prices; we find high probability of transition between lower and higher volatility regimes. Furthermore, our results based on the C-Vine copula confirm the existence of two types of tail dependence: - symmetric tail dependence between South Africa and China; South Africa and Russia; and lower tail dependence between South Africa and India; South Africa and Brazil; South Africa and Oil. For the purpose of diversification in these markets, we formulate an asset allocation problem using C-vine copula-based returns and optimize it using Particle Swarm algorithm with a rebalancing strategy. The results show an inverse relationship between the risk contribution and asset allocation of South Africa and oil market supporting the existence of lower tail dependence between them. This suggests that when South African stocks are in distress, investors tend to shift their holdings in oil market. Similar results are found between China and oil. In the upper tail, South African asset allocation is found to have an inverse relationship with that of Brazil, Russia and India suggesting that these three markets might be good investment destinations when things are not good in South Africa and vice-versa.

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.

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.

The fifth Generation (5G) mobile networks use millimeter Waves (mmWaves) to offer giga bit data rates. However, unlike microwaves, mmWave links are prone to user and topographic dynamics. They easily get blocked and end up forming irregular cell patterns for 5G. This in turn cause too early, too late, or wrong handoffs (HOs). To mitigate HO challenges, sustain connectivity and avert unnecessary HO, we propose a HO scheme based on Jump Markov Linear System (JMLS) and Deep Reinforcement Learning (DRL). JMLS is widely known to account for abrupt changes in system dynamics. DRL likewise emerges as an artificial intelligence technique for learning highly dimensional and time-varying behaviors. We combine the two techniques to account for time-varying, abrupt, and irregular changes in mmWave link behaviour by predicting likely deterioration patterns of target links. The prediction is optimized by meta training techniques that also reduces training sample size. Thus, the JMLS-DRL platform formulates intelligent and versatile HO policies for 5G. Results show our proposed prediction scheme about target link behavior post HO to be highly reliable. The scheme also averts unnecessary HOs thus ably supports longer dew time.

Starting with a particle in the cube system, we investigate the exotic possibility that the quantum numbers (n_x,n_y,n_z) satisfy the Markov equation. We find that the proposed particle in the Markov-cube system follows from a non-classical information entropic space by the quantum potential Q. We study the classical correspondents of the proposed particle in the Markov-cube system. According to our proposition, this particle identified by detailed measurements of the confinement particle-energy levels is an artifact or occurs in nature.

This paper investigates the inverse option problems (IOP) in the extended Black--Scholes model arising in financial markets. We identify the volatility and the drift coefficient from the measured data in financial markets using a Bayesian inference approach, which is presented as an IOP solution. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by a Markov Chain Monte Carlo (MCMC) algorithm, which exploits the posterior state space. The efficient sampling strategy of the MCMC algorithm enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown trend and volatility coefficients from the measured data.

Hidden markov models are a very useful tool in the modelling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden markov model to analyze the underlying structure of an ancient and complex manuscript, known as Voynich's manuscript, that remains still undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscript we train the network by means of the $\alpha$ and $\beta$-pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices in order to compare with known languages concerning the frequency of consonant and vowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.

Pomegranate (Punica granatum L.) is well known for its high content in bioactives including polyphenols, flavonoids and tannins, which have been shown to exhibit a wide range of biological activity such as antioxidant, antimicrobial and anticancer effects. It is worth noting that the majority of these molecules are found in the peels (PP), which are usually disposed of after processing, causing a significant amount of waste, amounting to more than 3.6 million t/y. This work investigates MW-assisted extraction (MAE) in water for the recovery of antioxidants from PP, including the optimization of temperature and extraction times. The total phenolics, anthocyanin, flavonoid and tannin contents of the recovered extracts have been determined, as have their antioxidant activities, which were found to be 356.35 mgGAE/gextr., 303.97 µgCy3G/gextr., 37.28 mgQE/gextr., 56.48 mgGAE/gextr. and 1.43 µmolTE/gextr., respectively (according to the adopted reference). All results have been compared with those obtained using a conventional protocol. In addition, the potential for water recycling by means of nanofiltration downstream in optimized MAE has been investigated, leading to overall water reuse of approx. 75%. Energy consumption (20.92W/mgGAE) and the common green metrics, RME, E-Factor and PMI (PME), have been considered in evaluating the proposed PP valorization strategy. Finally, the biological activity of the main products has been assessed. The antimicrobial properties of the PP extracts against three Gram-positive and three Gram-negative bacteria, and their antiproliferative activity towards human cancer cells have been tested. The S. aureus bacteria was the most susceptible to the PP extracts. All tested products displayed antiproliferative activity in HeLa cells when higher concentrations were tested, with D-PP/NF being the most effective. This result was also confirmed in a clonogenic analysis, which generally indicated the possible anti-cancer activity of pomegranate peel extracts obtained using this green approach.

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.

Deep learning methods have been widely used in PolSAR image classification. To learn the polarimetric information, many deep learning methods expect to learn high-level semantic features from original PolSAR data. However, only original data cannot learn multiple scattering features and complex structures for extremely heterogeneous terrain objects. In addition, deep learning methods always cause edge confusion due to the high-level features. To overcome these shortages, we propose a double-channel CNN network combined with an edge-preserving MRF model(DCCNN-MRF) for PolSAR image classification. Firstly, to combine complex matrix data and multiple scattering features together, a double-channel convolution network(DCCNN) is developed, which consists of a Wishart-based complex matrix and multi-feature subnetworks. The Wishart-based complex matrix network can learn the statistical characteristics and channel correlation well, and the multi-feature network can learn high-level semantic features well. Then, a unified network framework is designed to fuse two kinds of features to enhance advantageous features and reduce redundant ones. Finally, an edge preserving MRF model is designed to combine with the DCCNN network. In the MRF model, a sketch map-based edge energy function is designed by defining adaptive weighted neighborhood for edge pixels. Experiments are conducted on four real PolSAR data sets with different sensors and bands. Experimental results demonstrate the effectiveness of the proposed DCCNN-MRF method.

COVID-19, a global health crisis, occurred unexpectedly and has led to global transformation over all countries in the world today. While COVID-19 had claimed lives and led to an economic crisis, the impacts on the financial market cannot be overemphasized. Considering the previous financial crisis, which occurred due to poor regulations and unchecked misconduct by financial market stakeholders, COVID-19 is the first to mention an indirect crisis that almost has no direct relationship to the financial system. Thus, this paper explores the impacts of COVID-19 from a stochastic approach on Local markets by applying the GARCH model to measure the level of volatility of two (2) US stock indexes (NASDAQ and NYSE) and a Europe index (EURONEXT). Our results show that volatility existed before COVID-19, but the volatility rate increased after COVID-19, possibly due to the COVID-19 shock. We also explore the Markov-Switching Dynamic Regression (MSDR) model to corroborate our findings. We validated that there is a very high persistent volatility for all the considered local markets at the early stage COVID-19 period.

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

We provide methodology and numerical results for the Hattendorff differential equa- tion for the continuous time evolution of the variance of L(j)t , the loss at time t random variable for a multi-state process, given that the state at time t is j.

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.

This article proposes a monitoring system that allows to track transitions between different stages in the berry harvesting process (berry picking, waiting for transport, transport, and arrival to the packing) solely using information from temperature and vibration sensors located in the basket. The monitoring system assumes a characterization of the process based on Hidden Markov Models and uses the Viterbi algorithm to perform inference and estimate the most likely state trajectory. The obtained state trajectory estimate is then used to compute a potential damage indicator in real-time. The proposed methodology does not require information about the weight of the basket to identify each of the different stages, which makes it effective and more efficient than other alternatives available in the industry.

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

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.

Credit card payment platforms are increasingly used for e-commerce activities. Credit cards are payment cards issued to individuals so they can purchase products and services based on their accumulated debt. Since credit cards are becoming very popular and widely used, the number of related fraud cases is likewise increasing. Whereas, there are large numbers of credit card transactions daily; thus, it becomes complex to differentiate between fraudulent and non-fraudulent transactions. Accordingly, different machine learning (ML) tools have been deployed in the literature to filter credit card transactions to prevent cardholders and financial institutions from losing money. In this article, the ensemble hidden Markov model (EHMM) approach is deployed to predict credit card fraud. EHMM is a popular and flexible ML tool that can easily model randomly changing datasets. Yet, the performance of the EHMM solely depends on the adopted feature extraction technique. The more reliable the feature extraction technique, the better the performance of the EHMM. In this vein, this article analyses two feature extraction techniques that can be combined with the EHMM for the prediction of credit card fraud. First, the principal component analysis (PCA) feature extraction techniques are combined with the EHMM to effectively predict credit card fraud. Yet, the PCA increases the computational time complexity of the EHMM. Therefore, this article adapts some statistical features to reduce the computational time complexity imposed on the EHMM. These robust but simple statistical features termed MRE; Mean, Relative Amplitude, and Entropy, are merged to form a feature vector that can be combined with the EHMM to effectively predict credit card frauds. The performance of the PCA-EHMM and MRE-EHMM are evaluated using the credit card transactions dataset of European cardholders gathered within two days in September 2013. The results were documented using different performance metrics such as recall/sensitivity, specificity, precision, and F1-score. The findings of this article will offer solutions to the loss experienced by cardholders and financial institutions as a result of online banking which requires credit card details.

Infectious mononucleosis (Mono) is mostly caused by the Epstein-Barr virus (EBV), and can spread through infected people sharing food and drinks with others. Once this virus gets into your system, it is there to stay. The virus can get activated when a person has low immunity and can cause major complications. Furthermore, if physicians miss the diagnosis of this disease, and prescribe penicillin-based antibiotics, it can cause severe rash and adverse reactions that compromise patient safety. This paper develops a simple Hidden Markov Model using which a Viterbi algorithm provides the maximum a posteriori probability estimate for the most likely hidden state path, given a sequence of symptoms arising as observations from a patient with hidden EBV positive or negative states. Apart from bringing awareness to help reduce missed diagnoses and subsequent adverse events, this work provides a tool for health care systems to better incorporate prompts during electronic medical record (EMR) interactions to help physicians catch potential missed diagnoses during a visit. This research demonstrates how statistical models can be used to assess likelihood of underlying conditions that require tests to be offered by physicians in order to make a definitive diagnosis. The model developed and applied herein for estimating likelihood of EBV infection from a series of observations has the potential to alter guidelines within healthcare systems to ensure that the safety of patients, particularly teens, is not compromised due to a lack of definitive diagnosis for Mono at point of care.

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.

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.

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 glass crystallization behavior of 50ZnO:47B2O3:3Nb2O3:0.5Eu2O3 (G-0h) glass has been investigated in detail by DSC, XRD and TEM analysis. The luminescent properties of resulted glass-ceramics were also investigated. By XRD and TEM analysis crystallization of several crystalline phases have been proved (α-Zn3B2O6, β-Zn3B2O6 and ZnNb2O6). By calculating of crystal parameters it was found that europium ions are successfully incorporated in the β-Zn3B2O6. Photo-luminescent spectra show an increased emission in the resulting glass-ceramic samples as compared with the parent glass sample because of the higher asymmetry of Eu3+ ions in the crystalline phases obtained. It was established that the optimum emission intensity is registered for glass-ceramic sample obtained after 25 hours heat treatment of the parent glass.

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.

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

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.