Search

Food loss ans waste, referred next as FLW, has a great extent on the economic and behavioural patterns of consumption. In this paper, we aim to present statistical univariate and multivariate analyses based on a statistical study run during a period of several months in the Romanian territory. In this matter, the main purpose of the analysis developed in this paper is to determine several patterns of FLW phenomenon. This is made based on a methodology which comprises two main sections: the univariate analysis, consisting in statistical determinations of indicators and direct observation, and the multivariate analysis, related to the clustering analysis. The clustering analysis is based on the usage of hierarchical method, which has as final result the determination of clusters describing patterns of consumption related to food loss and waste. After the analysis was run, five main clusters related to food waste behaviour patterns were determined, with slight differences between food consumption habits, but with various combinations between the parameters taken into consideration. The obtained clusters offer important information for policymakers and stakeholders aiming to customize interventions and programs to target specific demographic groups or segments of the population. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a very famous network because of its many applications. IoT network has an integration of large-scale IoT devices that generate data. These IoT devices are very low power computing devices due to which they have a low level of communication. These devices construct data and transmit the data to the base station via intermediate IoT devices. The base station gathers and integrates the data and sends it to the administrator for further processing. The data attains the base station using various routing algorithms with the goal of low power consumption. When discussing low power IoT devices, power efficiency is an important performance measurement when creating a routing algorithm. This paper proposes a Minimum Power Consumption Routing (MPCR) algorithm using Hierarchical Fuzzy Logic Clustering (HFLC) algorithm for IoT networks. The MPCR with HFLC algorithm is an energy-efficient algorithm because of its lower power consumption for the cluster by aggregating the data within the cluster head and decreasing the number of data transmissions to the base station. In this paper, the cluster formation and cluster-head selection are explained, and a simulation has been conducted. In addition, the proposed algorithm is compared with the existing algorithms based on different metrics such as throughput, packet delivery ratio, and energy consumption of the network. The experimental results show that the proposed MPCR with the HFLC algorithm provides high throughput and packet delivery ratio and reduces energy consumption more efficiently than other existing algorithms. [ABSTRACT FROM AUTHOR]

New discoveries and knowledge are summarized in thousands of published papers per year per scientific domain, making it incomprehensible for scientists to account for all available knowledge relevant for their studies. In this paper, we present ACCORDION (ACCelerating and Optimizing model RecommenDatIONs), a novel methodology and an expert system that retrieves and selects relevant knowledge from literature and databases to recommend models with correct structure and accurate behavior, enabling mechanistic explanations and predictions, and advancing understanding. ACCORDION introduces an approach that integrates knowledge retrieval, graph algorithms, clustering, simulation, and formal analysis. Here, we focus on biological systems, although the proposed methodology is applicable in other domains. We used ACCORDION in nine benchmark case studies and compared its performance with other previously published tools. We show that ACCORDION is: comprehensive, retrieving relevant knowledge from a range of literature sources through machine reading engines; very effective, reducing the error of the initial baseline model by more than 80%, recommending models that closely recapitulate desired behavior, and outperforming previously published tools; selective, recommending only the most relevant, contextspecific, and useful subset (15%-20%) of candidate knowledge in literature; diverse, accounting for several distinct criteria to recommend more than one solution, thus enabling alternative explanations or intervention directions. [ABSTRACT FROM AUTHOR]

Reverse mortgage is one of the products (perhaps the main one) that is good to obtain additional income by using the habitual residence as collateral. The main objective of this paper is to analyse the effects that reverse mortgage contracting has on household finances over the lifetime of a family according to the socioeconomic group to which it belongs in Spain. Four indicators are employed to measure the immediate and long-term effects. We use a stochastic model with a double source of randomness, survival and entry into dependency, and apply it to the three socioeconomic groups obtained with cluster methodology from the 2017 Spanish Household Financial Survey data. We conclude that the effects are very different depending on the group: regarding only the effects of hiring a reverse mortgage on the income of the family, widowed women aged between 81 and 85 years, with low income and expenses as well as little net wealth, and a habitual residence that represents half of her net wealth (Cluster 1) are the most benefited; considering that the highest impact indicators are on the probability of illiquidity and on the value of lack of liquidity, the use of reverse mortgages benefits more the families in Cluster 3 (high income and expenses and really high net wealth, head of household aged between 76 and 80 years) and less the families in Cluster 2 (medium income, net wealth and expenses, head of household aged between 65 and 75 years). [ABSTRACT FROM AUTHOR]

Traditional metrics may not adequately assess performance in certain situations, whereas the Area Under Curve (AUC) offers a comprehensive perspective by considering both sensitivity and specificity. This method enhances interpretability, addresses limitations, and promotes the development of robust clustering algorithms. In unsupervised learning, utilizing AUC is a significant method for improving the precision and accuracy of machine learning models. Our work is inspired by several recent related works that implement approaches to manage the challenges of developing new metrics that can effectively assess and evaluate the performance of clustering algorithms. The research question relies on the concept of using an optimal metric for model evaluation of classification and clustering. Therefore, the paper investigates the use of the classification metric AUC for clustering validation purposes. The methodology we adopt is a hybrid clustering model because such a technique offers a robust model by combining the strengths of each model. The linkage approach directly impacts the clustering results, so we give significant attention to this feature in our implementation. Among the various linkage methods, we utilized single and average linkages. The Manhattan and Euclidean metrics are the distance measures used in this work. Thus, our contribution is to explore the benefit of using linkages and distance measurement in clustering with the help of the AUC metric. In addition, the entire proposed work and the contributions of this paper are evaluated and applied to the NSL-KDD dataset. Based on the proposed approach of using AUC with clustering, the Detection Rate (DR), False Alarm Rate (FAR), and other criteria are chosen to examine the model's results and capabilities. [ABSTRACT FROM AUTHOR]

The problem of image-based detection of the variety of beans, using artificial intelligence, is currently dealt with by scientists of various profiles. The idea of this paper is to show the possibility of applying different types of distances, primarily those that are fuzzy metrics, in clustering models in order to improve existing models and obtain more accurate results. The paper presents the method of variable neighborhood search, which uses both standard and fuzzy t-metrics and dual fuzzy s-metrics characterized by appropriate parameters. By varying those parameters of the fuzzy metric as well as the parameters of the metaheuristic used, we have shown how it is possible to improve the clustering results. The obtained results were compared with existing ones from the literature. The criterion function used in clustering is a fuzzy metric, which is proven in the paper. [ABSTRACT FROM AUTHOR]

Enhancing the management and monitoring of oil and gas processes demands the development of precise predictive analytic techniques. Over the past two years, oil and its prediction have advanced significantly using conventional and modern machine learning techniques. Several review articles detail the developments in predictive maintenance and the technical and non-technical aspects of influencing the uptake of big data. The absence of references for machine learning techniques impacts the effective optimization of predictive analytics in the oil and gas sectors. This review paper offers readers thorough information on the latest machine learning methods utilized in this industry's predictive analytical modeling. This review covers different forms of machine learning techniques used in predictive analytical modeling from 2021 to 2023 (91 articles). It provides an overview of the details of the papers that were reviewed, describing the model's categories, the data's temporality, field, and name, the dataset's type, predictive analytics (classification, clustering, or prediction), the models' input and output parameters, the performance metrics, the optimal model, and the model's benefits and drawbacks. In addition, suggestions for future research directions to provide insights into the potential applications of the associated knowledge. This review can serve as a guide to enhance the effectiveness of predictive analytics models in the oil and gas industries. [ABSTRACT FROM AUTHOR]

The aim of this paper is to examine the impact of a country's entry into the monetary union on its economic variables growth rate of real GDP as well as on GDP per capita growth for the period from 2010 to 2020. The clustering method and the ANFIS method were used in the data analysis. A total of two cluster analyses were performed. The first cluster includes countries that joined the EU in 2004 and became EZ members by 2010. The second cluster refers to those countries that joined the EU in 2004 but are not yet members of the EZ. For the first individual cluster analysis two models were analysed and for the second individual cluster three models were analysed using the ANFIS method. As expected, the results showed that GDP growth is connected with trade, inflation and gross investments in fixed capital in the observed countries, while GDP per capita is connected with unemployment, interest rates and public debt. With regard to GDP growth, the difference between countries that are in the eurozone and those that are not is not significant, which is in line with other studies. [ABSTRACT FROM AUTHOR]

The phenomenon of algal bloom seriously affects the function of the aquatic ecosystems, damages the landscape of urban river and lakes, and threatens the safety of water use. The introduction of a multi-attribute decision-making method avoids the shortcomings of traditional algal bloom management that relies on manual experience. However, the weight-calculation part of this method still receives the artificial influence of human factors, which reduces the accuracy and scientific rigor of the decision. This paper presents a group decision-making method based on information self-learning which makes decision weights automatically clustered and assigned. A general framework of decision-making management is constructed for the algal bloom management process. In the decision-making process, an improved density-based clustering algorithm is used to automatically cluster and rank the decision data in the form of the three-parameter interval number, and ultimately obtain the optimal management method that meets the management objectives. Finally, the method was applied at the monitoring station of Sanjiadian Reservoir in Beijing, China. Based on the treatment objectives and water quality monitoring data of the station, relevant experts were invited to evaluate the management solutions, and the information self-organizing algorithm of this paper was used to automatically rank the decision-making methods, and finally obtain the most suitable management method for the station. Comparison with the water quality data and treatment inputs after the previous man-made selection of treatment options, and discussion among experts, show that the decision-making method is feasible and effective, and contributes to the sustainable treatment of algal blooms. [ABSTRACT FROM AUTHOR]

Path-based clustering algorithms typically generate clusters by optimizing a benchmark function. Most optimization methods in clustering algorithms often offer solutions close to the general optimal value. This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance, Maximum Spanning Tree "MST", and meta-heuristic algorithms, including Genetic Algorithm "GA" and Particle Swarm Optimization "PSO". The Fast Path-based Clustering "FPC" algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations. The FPC does this operation using MST, the minimax distance, and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations. This algorithm can achieve the global optimal value, and the main clustering process of the algorithm has a computational complexity of O (k² × n). However, due to the complexity of the minimum distance algorithm, the total computational complexity is O (n²). Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers. In addition, the FPC requires the number of clusters as the only parameter to perform the clustering process. A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed, stability, and performance. [ABSTRACT FROM AUTHOR]

Further reducing greenhouse gas and pollutant emissions from road vehicles is a major task for the automotive industry. Stricter regulations regarding emissions and fleet fuel consumption require the continuous development of new powertrains and methods. In particular, the combination of hybrid powertrains on the technical side and the focus on real driving emissions (RDE) on the legislative side pose significant challenges to the vehicle calibration process. Against this background, new test methods and environments are being investigated to counteract the high number of interactions between hybrid drive systems and quasi-infinite test conditions due to RDE. Complementary to new test environments, innovative methods for data analysis are needed that allow the exploitation of the complete potential of measurement data. The application of such a method in the field of emission calibration is presented in this paper. For this purpose, a clustering method (HDBSCAN) is applied to critical sequences from emission tests. Within this presentation, the clustering process is based on a single signal only. This paper shows how signals of various characteristics can be processed with dynamic time warping and generically structured with the clustering method used. Here, 959 single events are automatically categorized into 24 clusters. This provides a new basis for system evaluation, enabling the automatic identification, categorization, and prioritization of calibration weaknesses. Using twelve signals of different characteristics, the generic usability of the clustering method is demonstrated. [ABSTRACT FROM AUTHOR]

This paper proposes a new approach to defect detection system design focused on exact damaged areas demonstrated through visual data containing gear wheel images. The main advantage of the system is the capability to detect a wide range of patterns of defects occurring in datasets. The methodology is built on three processes that combine different approaches from unsupervised and supervised methods. The first step is a search for anomalies, which is performed by defining the correct areas on the controlled object by using the autoencoder approach. As a result, the differences between the original and autoencoder-generated images are obtained. These are divided into clusters using the clustering method (DBSCAN). Based on the clusters, the regions of interest are subsequently defined and classified using the pre-trained Xception network classifier. The main result is a system capable of focusing on exact defect areas using the sequence of unsupervised learning (autoencoder)–unsupervised learning (clustering)–supervised learning (classification) methods (U2S-CNN). The outcome with tested samples was 177 detected regions and 205 occurring damaged areas. There were 108 regions detected correctly, and 69 regions were labeled incorrectly. This paper describes a proof of concept for defect detection by highlighting exact defect areas. It can be thus an alternative to using detectors such as YOLO methods, reconstructors, autoencoders, transformers, etc. [ABSTRACT FROM AUTHOR]

Copyright of Revista Científica is the property of Revista Cientifica, Universidad Distrital Francisco Jose de Caldas and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The stability of Wireless Sensor Networks (WSNs) is a crucial requirement in real-time applications such as military, defense, and other surveillance systems. Clustering in WSNs is one of the most predominant techniques, offering benefits such as minimizing communication time, optimizing energy utilization, lengthening the network lifespan, and ensuring network stability. Moreover, achieving the balance between energy consumption and maintaining network stability is significantly influenced by the cluster size. This research paper addresses the challenges associated with clustered-based routing and cluster formation paradigm, introducing a novel algorithm employing the principle of Artificial Neural Networks (ANN). In particular, the proposed algorithm integrates a hybrid strategy of Self Organizing Map (SOM) and K-mean clustering to form energy-efficient clusters, even ensuring the energy distribution evenly among them. The validity of the proposed algorithm has been confirmed through experimental analysis conducted using MATLAB. The simulation results demonstrate that the hybrid combination of SOM and K-means clustering is highly efficient in minimizing energy consumption and maintaining network stability. The findings also reveal an average of 80% stable network lifetime and achieve a packet reception ratio (PRR) of 98% which is much higher than two other protocols i.e. LEACH and MODLEACH protocols. [ABSTRACT FROM AUTHOR]

As an extension of Fuzzy C-Means (FCM), Evidence C-Means (ECM) is proposed in the framework of Dempster–Shafer theory (DST) and has been applied to many fields. However, the objective function of ECM involves only the distortion between the object and the prototype, which relies heavily on the initial prototype. Therefore, ECM may encounter the problem of local optimization. To solve this problem, this paper introduces ECM with Particle Swarm Optimization (PSO) initialization to determine the initial clustering centroids, and proposes Particle Swarm Optimization-based Evidential C-Means (PSO-ECM), which reduces the influence of bad initial prototypes and improves the local optimality problem of ECM. PSO-ECM is compared with three other clustering algorithms in four experiments and with ECM on a noise-containing dataset. According to the experimental results, PSO-ECM performs well in terms of different clustering validity metrics compared with existing clustering algorithms, has high stability of clustering, and can effectively and stably cluster noise-containing datasets and accurately identify outlier points. [ABSTRACT FROM AUTHOR]

Money laundering identification (MLI) is a challenging task for financial AI research and application due to its massive transaction volume, label sparseness, and label bias. Most of the existing MLI methods focus on individual-level abnormal behavior while neglecting the community factor that money laundering is a collaborative group crime. Furthermore, the massive volume of transactions and the issue of label shifting also impede the application of supervised or semi-supervised models. To this end, this paper proposes an efficient community-oriented algorithm, namely SEGE, to identify money laundering based on structural entropy minimization (SEM) with graph embedding in an unsupervised approach. Experiments on both a private real-world money laundering network and a public synthetic dataset show that our SEGE algorithm derives prominent performance and outperforms the parameterized learning-based graph representation methods. Moreover, we find that there are pervasive sub-communities in the real-world money laundering network. Based on our local algorithm, we propose a real combat strategy against the money laundering group, in which when we have several scattered suspicious accounts in the transaction network, we are able to retrieve the whole money laundering group by the union of sub-communities with both high precision and high recall rates. [ABSTRACT FROM AUTHOR]

Recently, business sectors have focused on offering a wide variety of services through utilizing different modern technologies such as super apps in order to fulfill customers' needs and create a satisfactory user experience. Accordingly, studying the user experience has become one of the most popular trends in the research field due to its essential role in business prosperity and continuity. Thus, many researchers have dedicated their efforts to exploring and analyzing the user experience across social media, blogs, and websites, employing a variety of research methods such as machine learning to mine users' reviews. However, there are limited studies concentrated on analyzing super app users' experiences and specifically mining Arabic users' reviews. Therefore, this paper aims to analyze and discover the most important topics that affect the user experience in the super app environment by mining Arabic business sector users' reviews in Saudi Arabia using biterm topic modeling, CAMeL sentiment analyzer, and doc2vec with k-means clustering. We explore users' feelings regarding the extracted topics in order to identify the weak aspects to improve and the strong aspects to enhance, which will promote a satisfactory user experience. Hence, this paper proposes an Arabic text annotation framework to help the business sector in Saudi Arabia to determine the important topics with negative and positive impacts on users' experience. The proposed framework uses two approaches: topic modeling with sentiment analysis and topic modeling with clustering. As a result, the proposed framework reveals four important topics: delivery and payment, customer service and updates, prices, and application. The retrieved topics are thoroughly studied, and the findings show that, in most topics, negative comments outweigh positive comments. These results are provided with general analysis and recommendations to help the business sector to improve its level of services. [ABSTRACT FROM AUTHOR]

Belief and plausibility functions based on evidence theory (ET) have been widely used in managing uncertainty. Various generalizations of ET to fuzzy sets (FSs) have been reported in the literature, but no generalization of ET to q-rung orthopair fuzzy sets (q-ROFSs) has been made yet. Therefore, this paper proposes a novel, simple, and intuitive approach to distance and similarity measures for q-ROFSs based on belief and plausibility functions within the framework of ET. This research addresses a significant research gap by introducing a comprehensive framework for handling uncertainty in q-ROFSs using ET. Furthermore, it acknowledges the limitations inherent in the current state of research, notably the absence of generalizations of ET to q-ROFSs and the challenges in extending belief and plausibility measures to certain aggregation operators and other generalizations including Hesitant fuzzy sets, Bipolar fuzzy sets, Fuzzy soft sets etc. Our contribution lies in the proposal of a novel approach to distance and similarity measures for q-ROFSs under ET, utilizing Orthopairian belief and plausibility intervals (OBPIs). We establish new similarity measures within the generalized ET framework and demonstrate the reasonability of our method through useful numerical examples. Additionally, we construct Orthopairian belief and plausibility GRA (OBP-GRA) for managing daily life complex issues, particularly in multicriteria decision-making scenarios. Numerical simulations and results confirm the usability and practical applicability of our proposed method in the framework of ET. [ABSTRACT FROM AUTHOR]

Kidney segmentation from abdominal computed tomography (CT) images is essential for computer-aided kidney diagnosis, pathology detection, and surgical planning. This paper introduces a kidney segmentation method for clinical contrast-enhanced CT images. First, it begins with shape-based preprocessing to remove the spine and ribs. Second, a novel clustering algorithm and an initial kidney selection strategy are utilized to locate the initial slices and contours. Finally, an adaptive narrow-band approach based on active contours is developed, followed by a clustering postprocessing to address issues with concave parts. Experimental results demonstrate the high segmentation performance of the proposed method, achieving a Dice Similarity Coefficient of 97.4 ± 1.0% and an Average Symmetric Surface Distance of 0.5 ± 0.2 mm across twenty sequences. Notably, this method eliminates the need for manually setting initial contours and can handle intensity inhomogeneity and varying kidney shapes without extensive training or statistical modeling. [ABSTRACT FROM AUTHOR]

The purpose of clustering is to partition data similar with each other into a same group and partition data dissimilar with each other into different groups. However, in most existing fuzzy clustering approaches, the membership degrees of an individual belonging to different clusters are relied on the different distances between the individual and different cluster centroids, the similarity between the individual and data in different clusters are ignored, besides, the outliers cannot be distinguished effectively. For improving the clustering performance and addressing the problems in most existing fuzzy clustering approaches, based on the concept that data close to each other should be grouped together and be assigned to a same cluster, in this paper, we present a novel efficient fuzzy clustering approach, in which the adaptive local neighborhood information of each data referring to different clusters is taken into consideration; an entirely new idea that the membership degree values of an individual referring to different clusters should not only depend on the distances between the individual and different cluster centers, but also rely on the distances between the individual and several nearest neighbor data in different clusters is put forward; a new scheme to search for the outliers is presented, a method for identifying the different importance of different features is introduced. Experiments on synthetic and publicly real-world datasets were conducted, the clustering results show that the approach put forward can yield consistently satisfying clustering performance and has significant advantages. [ABSTRACT FROM AUTHOR]

Clustering algorithms play a crucial role in early warning cybersecurity systems. They allow for the detection of new attack patterns and anomalies and enhance system performance. This paper discusses the problem of clustering data collected by a distributed system of network honeypots. In the proposed approach, when a network flow matches an attack signature, an appropriate label is assigned to it. This enables the use of semi-supervised learning algorithms and improves the quality of clustering results. The article compares the results of learning algorithms conducted with and without partial supervision, particularly non-negative matrix factorization and semi-supervised non-negative matrix factorization. Our results confirm the positive impact of labeling a portion of flows on the quality of clustering. [ABSTRACT FROM AUTHOR]

Background: Using next-generation sequencing technologies, scientists can sequence complex microbial communities directly from the environment. Significant insights into the structure, diversity, and ecology of microbial communities have resulted from the study of metagenomics. The assembly of reads into longer contigs, which are then binned into groups of contigs that correspond to different species in the metagenomic sample, is a crucial step in the analysis of metagenomics. It is necessary to organize these contigs into operational taxonomic units (OTUs) for further taxonomic profiling and functional analysis. For binning, which is synonymous with the clustering of OTUs, the tetra-nucleotide frequency (TNF) is typically utilized as a compositional feature for each OTU. Results: In this paper, we present AFIT, a new l-mer statistic vector for each contig, and AFITBin, a novel method for metagenomic binning based on AFIT and a matrix factorization method. To evaluate the performance of the AFIT vector, the t-SNE algorithm is used to compare species clustering based on AFIT and TNF information. In addition, the efficacy of AFITBin is demonstrated on both simulated and real datasets in comparison to state-of-the-art binning methods such as MetaBAT 2, MaxBin 2.0, CONCOT, MetaCon, SolidBin, BusyBee Web, and MetaBinner. To further analyze the performance of the purposed AFIT vector, we compare the barcodes of the AFIT vector and the TNF vector. Conclusion: The results demonstrate that AFITBin shows superior performance in taxonomic identification compared to existing methods, leveraging the AFIT vector for improved results in metagenomic binning. This approach holds promise for advancing the analysis of metagenomic data, providing more reliable insights into microbial community composition and function. Availability: A python package is available at: https://github.com/SayehSobhani/AFITBin. [ABSTRACT FROM AUTHOR]

Nowadays, wireless sensor networks (WSNs) prove their potential in our daily day-to-day life. However, due to high congestion, energy management becomes the key challenge for WSNs. To increase the lifespan of WSNs, a unique clustered routing strategy is presented in this study. It offers an effective solution for the hot-spot effect and idle-listening issues. Outcomes help in lessening energy consumption. The developed algorithm is based on the principle of balanced energy consumption. Further, the developed WSN involves a node dormancy mechanism. It requires the energy balance technique using the clustering routing mechanism with distance variance. The design of clustering nodes is based on the master-slave principle, where the formation of clustering relies on node position and residual energy. MATLAB provides the simulation results as energy drop of each node to calculate the battery life. According to the achieved results, the developed algorithm can reduce the decay rate which can further lessen the energy consumption of the network. Moreover, it enhances the throughput and prolongs the network lifetime. The paper provides an energy-efficient clustering approach for Wireless Sensor Networks (WSNs) that can directly relate to manufacturing applications by practical solutions to the challenges faced in manufacturing settings, where effective sensor network deployment can lead to significant improvements in production processes and overall operational efficiency. [ABSTRACT FROM AUTHOR]

Digital deliberation has been steadily growing in recent years, enabling citizens from different geographical locations and diverse opinions and expertise to participate in policy-making processes. Software platforms aiming to support digital deliberation usually suffer from information overload, due to the large amount of feedback that is often provided. While Machine Learning and Natural Language Processing techniques can alleviate this drawback, their complex structure discourages users from trusting their results. This paper proposes two Explainable Artificial Intelligence models to enhance transparency and trust in the modus operandi of the above techniques, which concern the processes of clustering and summarization of citizens' feedback that has been uploaded on a digital deliberation platform. [ABSTRACT FROM AUTHOR]

This paper presents a single tree segmentation method applied to 3D point cloud data acquired with a LiDAR scanner mounted on an unmanned aerial vehicle (UAV). The method itself is based on clustering methods and graph theory and uses only the spatial properties of points. Firstly, the point cloud is reduced to clusters with DBSCAN. Those clusters are connected to a 3D graph, and then graph partitioning and further refinements are applied to obtain the final segments. Multiple datasets were acquired for two test sites in the Czech Republic which are covered by commercial forest to evaluate the influence of laser scanning parameters and forest characteristics on segmentation results. The accuracy of segmentation was compared with manual labels collected on top of the orthophoto image and reached between 82 and 93% depending on the test site and laser scanning parameters. Additionally, an area-based approach was employed for validation using field-measured data, where the distribution of tree heights in plots was analyzed. [ABSTRACT FROM AUTHOR]

Archaeometry can help archaeologists in many ways, and one of the most common archaeometric objectives is provenance analysis. Volcanic rocks are often found in archaeological sites as materials used to make grinding tools such as millstones and mortars or as building materials. Petrographic characterization is commonly applied to identify their main mineralogical components. However, the provenance study of volcanic stones is usually undertaken by comparing geochemical data from reference outcrops using common descriptive statistical tools such as biplots of chemical elements, and occasionally, unsupervised multivariate data analysis like principal component analysis (PCA) is also used. Recently, the use of supervised classification methods has shown a superior performance in assigning provenance to archaeological samples. However, these methods require the use of reference databases for all the possible provenance classes in order to train the classification models. The existence of comprehensive collections of published geochemical analyses of igneous rocks enables the use of the supervised approach for the provenance determination of volcanic stones. In this paper, the provenance of volcanic grinding tools from two archaeological sites (Iulia Libica, Spain, and Sidi Zahruni, Tunisia) is attempted using data from the GEOROC database through unsupervised and supervised approaches. The materials from Sidi Zahruni have been identified as basalts from Pantelleria (Italy), and the agreement between the different supervised classification models tested is particularly conclusive. In contrast, the provenance of the materials from Iulia Libica remained undetermined. The results illustrate the advantages and limitations of all the examined methods. [ABSTRACT FROM AUTHOR]

In this paper, a data-driven framework aimed at investigating how weather factors affect the spatio-temporal patterns of air traffic flow in the terminal maneuvering area (TMA) is presented. The framework mainly consists of three core modules, namely, trajectory structure characterization, flow pattern recognition, and association rule mining. To fully characterize trajectory structure, abnormal trajectories and typical operations are sequentially extracted based on a deep autoencoder network with two specially designed loss functions. Then, using these extracted elements as basic components to further construct and cluster per-hour-level descriptions of airspace structure, the spatio-temporal patterns of air traffic flow can be recognized. Finally, the association rule mining technique is applied to find sets of weather factors that often appear together with each flow pattern. Experimental analysis is demonstrated on two months of arrival flight trajectories at Hong Kong International Airport (HKIA). The results clearly show that the proposed framework effectively captures spatial anomalies, fine-grained trajectory structures, and representative flow patterns. More importantly, it also reveals that those flow patterns with non-conforming behaviors result from complex interactions of various weather factors. The findings provide valuable insights into the causal relationships between weather factors and changes in flow patterns, greatly enhancing the situational awareness of TMA. [ABSTRACT FROM AUTHOR]

This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution. By utilizing modern high-performance computing techniques, HPClust enhances key clustering metrics: effectiveness, computational efficiency, and scalability. In contrast to vanilla data parallelism, which only accelerates processing time through the MapReduce framework, our approach unlocks superior performance by leveraging the multi-strategy competitive–cooperative parallelism and intricate properties of the objective function landscape. Unlike other available algorithms that struggle to scale, our algorithm is inherently parallel in nature, improving solution quality through increased scalability and parallelism and outperforming even advanced algorithms designed for small- and medium-sized datasets. Our evaluation of HPClust, featuring four parallel strategies, demonstrates its superiority over traditional and cutting-edge methods by offering better performance in the key metrics. These results also show that parallel processing not only enhances the clustering efficiency, but the accuracy as well. Additionally, we explore the balance between computational efficiency and clustering quality, providing insights into optimal parallel strategies based on dataset specifics and resource availability. This research advances our understanding of parallelism in clustering algorithms, demonstrating that a judicious hybridization of advanced parallel approaches yields optimal results for MSSC-ITD. Experiments on the synthetic data further confirm HPClust's exceptional scalability and robustness to noise. [ABSTRACT FROM AUTHOR]

The main limitation of wireless sensor networks (WSNs) lies in their reliance on battery power. Therefore, the primary focus of the current research is to determine how to transmit data in a rational and efficient way while simultaneously extending the network's lifespan. In this paper, a hybrid of a fuzzy logic system and a quantum annealing algorithm-based clustering and routing protocol (FQA) is proposed to improve the stability of the network and minimize energy consumption. The protocol uses a fuzzy inference system (FIS) to select appropriate cluster heads (CHs). In the routing phase, we used the quantum annealing algorithm to select the optimal route from the CHs and the base station (BS). Furthermore, we defined an energy threshold to filter candidate CHs in order to save computation time. Unlike with periodic clustering, we adopted an on-demand re-clustering mechanism to perform global maintenance of the network, thereby effectively reducing the computation and overhead. The FQA was compared with FRNSEER, BOA-ACO, OAFS-IMFO, and FC-RBAT in different scenarios from the perspective of energy consumption, alive nodes, network lifetime, and throughput. According to the simulation results, the FQA outperformed all the other methods in all scenarios. [ABSTRACT FROM AUTHOR]

Featured Application: Non-deep-learning approach to recognize gestures from an imprecise tracking system such as passive RFID. In this paper, we present a novel non-deep-learning-based approach for real-time object tracking and activity recognition within smart homes, aiming to minimize human intervention and dataset requirements. Our method utilizes discreet, easily concealable sensors and passive RFID technology to track objects in real-time, enabling precise activity recognition without the need for extensive datasets typically associated with deep learning techniques. Central to our approach is AtomGID, an algorithm tailored to extract highly generalizable spatial features from RFID data. Notably, AtomGID's adaptability extends beyond RFID to other imprecise tracking technologies like Bluetooth beacons and radars. We validate AtomGID through simulation and real-world RFID data collection within a functioning smart home environment. To enhance recognition accuracy, we employ a clustering adaptation of the flocking algorithm, leveraging previously published Activities of Daily Living (ADLs) data. Our classifier achieves a robust classification rate ranging from 85% to 93%, underscoring the efficacy of our approach in accurately identifying activities. By prioritizing non-deep-learning techniques and harnessing the strengths of passive RFID technology, our method offers a pragmatic and scalable solution for activity recognition in smart homes, significantly reducing dataset dependencies and human intervention requirements. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive evaluation of the Agent BAsed Rough sets Clustering (ABARC) algorithm, an approach using rough sets theory for clustering in environments characterized by uncertainty. Several experiments utilizing standard datasets are performed in order to compare ABARC against a range of supervised and unsupervised learning algorithms. This comparison considers various internal and external performance measures to evaluate the quality of clustering. The results highlight the ABARC algorithm’s capability to effectively manage vague data and outliers, showcasing its advantage in handling uncertainty in data. Furthermore, they also emphasize the importance of choosing appropriate performance metrics, especially when evaluating clustering algorithms in scenarios with unclear or inconsistent data. [ABSTRACT FROM AUTHOR]

The diversity and scarcity of resources across devices in heterogeneous computing environments can impact their ability to meet users' quality-of-service (QoS) requirements, especially in open real-time environments where computational loads are unpredictable. Despite this uncertainty, timely responses to events remain essential to ensure desired performance levels. To address this challenge, this paper introduces collaborative service execution, enabling resource-constrained IoT devices to collaboratively execute services with more powerful neighbors at the edge, thus meeting non-functional requirements that might be unattainable through individual execution. Nodes dynamically form clusters, allocating resources to each service and establishing initial configurations that maximize QoS satisfaction while minimizing global QoS impact. However, the complexity of open real-time environments may hinder the computation of optimal local and global resource allocations within reasonable timeframes. Thus, we reformulate the QoS optimization problem as a heuristic-based anytime optimization problem, capable of interrupting and quickly adapting to environmental changes. Extensive simulations demonstrate that our anytime algorithms rapidly yield satisfactory initial service solutions and effectively optimize the solution quality over iterations, with negligible overhead compared to the benefits gained. [ABSTRACT FROM AUTHOR]

Despite much research being conducted within the scope of sustainable tourism, more progress has yet to be made in defining how close or far different countries are from achieving this goal. Consequently, this paper aims to evaluate and compare the commitment of citizens, as tourists, from the 27 member states of the European Union to sustainable tourism. A map of sustainability was developed through the use of machine learning algorithms. A cluster analysis was performed, followed by a sustainable rating. The main findings indicate the existence of three country segments among the European Union member states according to the involvement of its citizens as tourists with sustainable practices: highly committed, moderately committed, and uncommitted. Based on these segments, we proposed a recommendation system that suggests the top-five countries where tourists could exchange sustainable tourism habits based on the idea of contagion or imitation behaviours among individuals across an extensive set of everyday decisions. The results reveal significant variations in sustainable tourism practices across member states, highlighting both challenges and opportunities for harmonisation. By implementing this recommendation system, we facilitate the adoption of sustainable habits among tourists and stakeholders, driving a more unified approach to sustainability in the multiple tourism destinations. This study shows no convergence between the 27 European Union member states regarding sustainable tourism. Therefore, political policies are necessary so that all citizens converge on sustainable tourist habits and the European Union contributes, as a whole, to sustainable tourism. [ABSTRACT FROM AUTHOR]

Brainstorming is an important part of the design thinking process since it encourages creativity and innovation through bringing together diverse viewpoints. However, traditional brainstorming practices face challenges such as the management of large volumes of ideas. To address this issue, this paper introduces a decision support system that employs the BERTopic model to automate the brainstorming process, which enhances the categorization of ideas and the generation of coherent topics from textual data. The dataset for our study was assembled from a brainstorming session on "scholar dropouts", where ideas were captured on Post-it notes, digitized through an optical character recognition (OCR) model, and enhanced using data augmentation with a language model, GPT-3.5, to ensure robustness. To assess the performance of our system, we employed both quantitative and qualitative analyses. Quantitative evaluations were conducted independently across various parameters, while qualitative assessments focused on the relevance and alignment of keywords with human-classified topics during brainstorming sessions. Our findings demonstrate that BERTopic outperforms traditional LDA models in generating semantically coherent topics. These results demonstrate the usefulness of our system in managing the complex nature of Arabic language data and improving the efficiency of brainstorming sessions. [ABSTRACT FROM AUTHOR]

In this paper, we use two methods, an algorithm of the density-based spatial clustering of applications with noise combined with the Gaussian mixture model, and the maximum likelihood method, to study two open clusters: IC 2488 and IC 2714 with Gaia Data Release 3 data. We compare the two methods in terms of cluster star number, isochrone fitting, cluster mass, and radius. The comparison shows that the selections of cluster stars by the two methods are consistent. The parameters obtained by the two methods are very close. But there are slight differences between the two methods for faint stars in IC 2714. The maximum likelihood method selects more faint stars outside of the main-sequence stripe. We conclude that the maximum likelihood method is more likely affected by field stars. [ABSTRACT FROM AUTHOR]

Motivation: Genomic structural variation refers to chromosomal level variations such as genome rearrangement or insertion/deletion, which typically involve larger DNA fragments compared to single nucleotide variations. Deletion is a common type of structural variants in the genome, whichmay lead to mangy diseases, so the detection of deletions can help to gain insights into the pathogenesis of diseases and provide accurate information for disease diagnosis, treatment, and prevention. Many tools exist for deletion variant detection, but they are still inadequate in some aspects, and most of them ignore the presence of chimeric variants in clustering, resulting in less precise clustering results. Results: In this paper, we present LcDel, which can detect deletion variation based on clustering and long reads. LcDel first finds the candidate deletion sites and then performs the first clustering step using two clustering methods (sliding windowbased and coverage-based, respectively) based on the length of the deletion. After that, LcDel immediately uses the second clustering by hierarchical clustering to determine the location and length of the deletion. LcDel is benchmarked against some other structural variation detection tools onmultiple datasets, and the results show that LcDel has better detection performance for deletion. The source code is available in https://github.com/cyq1314woaini/LcDel. [ABSTRACT FROM AUTHOR]

Clustering is an effective statistical data analysis technique; it has several applications, including data mining, pattern recognition, image analysis, bioinformatics, and machine learning. Clustering helps to partition data into groups of objects with distinct characteristics. Most of the methods for clustering use manually selected parameters to find the clusters from the dataset. Consequently, it can be very challenging and time-consuming to extract the optimal parameters for clustering a dataset. Moreover, some clustering methods are inadequate for locating clusters in high-dimensional data. To address these concerns systematically, this paper introduces a novel selection-free clustering technique named data point positioning analysis (DPPA). The proposed method is straightforward since it calculates 1-NN and Max-NN by analyzing the data point placements without the requirement of an initial manual parameter assignment. This method is validated using two well-known publicly available datasets used in several clustering algorithms. To compare the performance of the proposed method, this study also investigated four popular clustering algorithms (DBSCAN, affinity propagation, Mean Shift, and K-means), where the proposed method provides higher performance in finding the cluster without using any manually selected parameters. The experimental finding demonstrated that the proposed DPPA algorithm is less time-consuming compared to the existing traditional methods and achieves higher performance without using any manually selected parameters. [ABSTRACT FROM AUTHOR]

ChatGPT (GPT-3.5), an intelligent Web-based tool capable of conducting text-based conversations akin to human interaction across various subjects, has recently gained significant popularity. This surge in interest has led researchers to examine its impact on numerous fields, including education. The aim of this paper is to investigate the perceptions of undergraduate students regarding ChatGPT's utility in academic environments, focusing on its strengths, weaknesses, opportunities, and threats. It responds to emerging challenges in educational technology, such as the integration of artificial intelligence in teaching and learning processes. The study involved 257 students from two university departments in Greece—namely primary and early childhood education pre-service teachers. Data were collected using a structured questionnaire. Various methods were employed for data analysis, including descriptive statistics, inferential analysis, K-means clustering, and decision trees. Additional insights were obtained from a subset of students who undertook a project in an elective course, detailing the types of inquiries made to ChatGPT and their reasons for recommending (or not recommending) it to their peers. The findings offer valuable insights for tutors, researchers, educational policymakers, and ChatGPT developers. To the best of the authors' knowledge, these issues have not been dealt with by other researchers. [ABSTRACT FROM AUTHOR]

Featured Application: The student performance data stored in the micro-learning platform Priscilla, specially developed to improve IT students' knowledge, is analyzed using learning analytics methods to identify meaningful groups of students with similar performances and uncover possible changes in the number of identified groups and their compositions in consecutive term periods and based on different types of activities. The identification of heterogeneous and homogeneous groups of students using clustering analysis in learning analytics is still rare. The paper describes a study in which the students' performance data stored in the micro-learning platform Priscilla are analyzed using learning analytics methods. This study aims to identify the groups of students with similar performances in micro-learning courses focused on learning programming and uncover possible changes in the number and composition of the identified groups of students. The CRISP-DM methodology was used to navigate through the complexity of the knowledge discovery process. Six different datasets representing different types of graded activities or term periods were prepared and analyzed for that purpose. The clustering analysis using the K-Means method found two clusters in all cases. Subsequently, performance metrics, the internal composition, and transfers of the students between clusters identified in different datasets were analyzed. As a result, this study confirms that analyzing student performance data from a micro-learning platform using learning analytics methods can reveal distinct groups of students with different academic performances, and these groups change over time. These findings align with teachers' assumptions that the micro-learning platform with automated evaluation of programming assignments highlights how the students perceive the role of learning tools during learning programming in different term periods. Simultaneously, this study acknowledges that clustering, as an exploratory method, provides a solid basis for further research and can identify distinct groups of students with similar characteristics. [ABSTRACT FROM AUTHOR]

The selection of multiple contingency scenarios is a key task to perform resilience-oriented long-term planning analyses. However, the identification of relevant multiple contingencies may easily lead to combinatorial explosion issues, even for relatively small systems. This paper proposes an effective methodology for the identification of relevant multiple contingencies and their probabilities, suitable for the long-term resilience analysis of large power systems. The methodology is composed of two main pillars: (1) the clustering of lines that are more likely to fail together, to reduce the computational complexity of the analysis exploiting historical weather data and (2) the probability-based identification of multiple contingencies within each cluster, where the contingency probability is computed applying the copula theory. Tests performed on a portion of the Italian EHV transmission system confirm the validity of the clustering results compared against historical failure events. Moreover, the copula-based algorithm for contingency probability estimation passes the tests carried out on relatively large clusters with very low error tolerance. The method successfully pinpoints critical multiple contingency scenarios and their likelihoods, making it valuable for assessing power system resilience over long-term horizons in support of resilience-oriented planning activities. [ABSTRACT FROM AUTHOR]

Wireless body area networks (WBANs) have emerged as a promising solution for addressing challenges faced by elderly individuals, limited medical facilities, and various chronic medical conditions. WBANs consist of wearable sensing and computing devices interconnected through wireless communication channels, enabling the collection and transmission of vital physiological data. However, the energy constraints of the battery-powered sensor nodes in WBANs pose a significant challenge to ensuring long-term operational efficiency. Two-hop routing protocols have been suggested to extend the stability period and maximize the network's lifetime. These protocols select appropriate parent nodes or forwarders with a maximum of two hops to relay data from sensor nodes to the sink. While numerous energy-efficient routing solutions have been proposed for WBANs, reliability has often been overlooked. Our paper introduces an energy-efficient routing protocol called a Hybrid Clustering Approach for Extending WBAN Lifetime (HCEL) to address these limitations. HCEL leverages a utility function to select parent nodes based on residual energy (RE), proximity to the sink node, and the received signal strength indicator (RSSI). The parent node selection process also incorporates an energy threshold value and a constrained number of serving nodes. The main goal is to extend the overall lifetime of all nodes within the network. Through extensive simulations, the study shows that HCEL outperforms both Stable Increased Throughput Multihop Protocol for Link Efficiency (SIMPLE) and Energy-Efficient Reliable Routing Scheme (ERRS) protocols in several key performance metrics. The specific findings of our article highlight the superior performance of HCEL in terms of increased network stability, extended network lifetime, reduced energy consumption, improved data throughput, minimized delays, and improved link reliability. [ABSTRACT FROM AUTHOR]

Non-invasive fetal electrocardiography (NI-ECG) is based on the acquisition of signals from electrodes on the mother's abdominal surface. This abdominal ECG (aECG) signal consists of the maternal ECG (mECG) along with the fetal ECG (fECG) and other noises and artifacts. These records allow the acquisition of valuable and reliable information that helps ensure fetal well-being during pregnancy. This paper proposes a procedure based on principal component analysis (PCA) to obtain a single-channel master abdominal ECG record that can be used as input to fetal heart rate extraction techniques. The new procedure requires three main processing stages: PCA-based analysis for fECG-component extraction, polarity test, and curve fitting. To show the advantages of the proposal, this PCA-based method has been used as the feeding stage to a previously developed clustering-based method for single-channel aECG fetal heart rate monitoring. The results obtained for a set of real abdominal ECG recordings from annotated public aECG databases, the Abdominal and Direct Fetal ECG Database and the Challenge 2013 Training Set A, show improved efficiency in fetal heart rate extraction and illustrate the benefits derived from the use of such a master abdominal ECG channel. This allows us to achieve proper fetal heart rate monitoring without the need for manual inspection and selection of channels to be processed, while also allowing us to analyze records that would have been discarded otherwise. [ABSTRACT FROM AUTHOR]

As the Internet and Internet of Things (IoT) continue to develop, Heterogeneous Information Networks (HIN) have formed complex interaction relationships among data objects. These relationships are represented by various types of edges (meta-paths) that contain rich semantic information. In the context of IoT data applications, the widespread adoption of Trigger-Action Patterns makes the management and analysis of heterogeneous data particularly important. This study proposes a meta-path-based clustering method for heterogeneous IoT data called I-RankClus, which aims to improve the modeling and analysis efficiency of IoT data. By combining ranking with clustering algorithms, the PageRank algorithm was used to calculate the intraclass influence of objects in the network. The HITS algorithm then transfers the influence to the core objects, thereby optimizing the classification of objects during the clustering process. The I-RankClus algorithm does not process each meta-path individually, but instead integrates multiple meta-paths to enhance the interpretability and clustering performance of the model. The experimental results show that the I-RankClus algorithm can process complex IoT datasets more effectively than traditional clustering methods and provide more accurate clustering outcomes. Furthermore, through a detailed analysis of meta-paths, this study explored the influence and importance of different meta-paths, thereby validating the effectiveness of the algorithm. Overall, the research presented in this paper not only improves the application effects of HINs in IoT data analysis but also provides valuable methods and insights for future network data processing [ABSTRACT FROM AUTHOR]

This paper introduced automated detection and analysis of lunar craters are crucial for advancing lunar research and facilitating mission planning. This study introduces a comprehensive multi-scale approach for crater detection on the lunar surface using LROC (Lunar Reconnaissance Orbiter Camera) Dataset, enabling the identification of craters across varying scales and enhancing overall detection accuracy and efficiency. The process involves preprocessing lunar imagery to enhance features and delineate potential crater regions, utilizing edge detection algorithms to extract crater boundaries. Clustering techniques are then applied to group similar edge points and isolate potential crater candidates. A thresholding mechanism based on statistical edge intensity analysis refines the detection process. To address multiple detections of the same crater at slightly different diameters, radius criteria are implemented, yielding high diameter accuracy of 84% for mare Imbrium (test site 1) and 80% for mare Nubium (test site 2). Subsequently, a depth-diameter analysis validates crater-like characteristics by combining depth measurements with crater diameter estimation, showcasing the authenticity of potential craters. we compare our diameter and depth with different reference papers and we get high accuracy of R2 =0.99 then other methods. The results highlight the potential of this multi-scale approach for automated lunar crater detection, providing deeper insights into the Moon's surface morphology and history for future lunar exploration missions. [ABSTRACT FROM AUTHOR]

This study conducts an in-depth review of the Social Internet of Things (SIoT), a significant advancement from the conventional Internet of Things (IoT) via the integration of socialization principles akin to human interactions. We explore the architecture, trust management, relationship dynamics, and other crucial aspects of SIoT, with a particular focus on the relatively neglected areas of fault tolerance, cloud–fog computing, and clustering. Our systematic literature analysis, spanning research from 2011 to April 2023, uncovers critical gaps and establishes a detailed taxonomy of emerging SIoT themes. This paper not only sheds light on the current state of SIoT research but also charts a course for future exploration and development in this burgeoning field. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) communication plays an important role in enabling autonomous driving. However, when multiple vehicles request the same content, like road conditions, delivering it individually by V2V communication can significantly increase traffic volume, potentially causing congestion in the wireless channel. To address this issue, Content-Centric Network (CCN) technology is applied to V2V communication, which improves communication efficiency by exploiting content cached at vehicles. However, previous methods faced the following challenges: (i) vehicles could not use content stored in nearby vehicles outside the communication path, and (ii) redundant caching of the same content occurred at nearby vehicles. To tackle these challenges, this paper proposes a collaborative caching method in which vehicles are grouped into clusters and each cluster has a designated head responsible for managing caches across all vehicles within the cluster. In this way, this method enables vehicles to use the content cached at adjacent vehicles that are not directly on a communication path. In addition, it eliminates redundant caches, allowing a more diverse range of content storage. Extensive simulation results demonstrate that the proposed approach effectively reduces content delivery latency by 33% compared to the method using clusters without cooperative caching and by 19% compared to the ECV+ method. [ABSTRACT FROM AUTHOR]

Research background: Digital ecosystems in Europe are heterogenous organizations involving different economies, industries, and contexts. Among them, Digital Innovation Hubs (DIHs) are considered a policy-driven organization fostered by the European Commission to push companies' digital transition through a wide portfolio of supporting services. Purpose of the article: There are DIHs existing in all European economies, but literature needs more precise indications about their status and nature. The purpose is to study a distribution of DIHs and differences in portfolios of DIHs' services across European economies. Therefore, the paper wants to deliver more precise data on effects on national and European policies. This is required to define their final role and scope in the complex dynamics of the digital transition, depending on regional context and heterogeneity of industries. Methods: Data on 38 economies was collected from the S3 platform (on both existing and in preparation DIHs) and further verified by native speaking researchers using manual web scrapping of websites of DIHs identified from S3. To find potential similarities of digital ecosystems in different economies as emanated by the existence of DIHs, clusterization (Ward's method and Euclidean distances) was applied according to the services offered. Economies were clustered according to the number of DIHs and the spread of DIHs intensity in different cities. The results were further analyzed according to the scope of the provided services. Findings & value added: The applied clustering classified European economies in four different sets, according to the types of services offered by the DIHs. These sets are expression of the different digitalization statuses and strategies of the selected economies and, as such, the services a company can benefit from in a specific economy. Potential development-related reasons behind the data-driven clustering are then conjectured and reported, to guide companies and policy makers in their digitalization strategies. [ABSTRACT FROM AUTHOR]