Analysis of the cryptocurrency market using different prototype-based clustering techniques

Since the emergence of Bitcoin, cryptocurrencies have grown significantly, not only in terms of capitalization but also in number. Consequently, the cryptocurrency market can be a conducive arena for investors, as it offers many opportunities. However, it is difficult to understand. This study aims to describe, summarize, and segment the main trends of the entire cryptocurrency market in 2018, using data analysis tools. Accordingly, we propose a new clustering-based methodology that provides complementary views of the financial behavior of cryptocurrencies, and one that looks for associations between the clustering results, and other factors that are not involved in clustering. Particularly, the methodology involves applying three different partitional clustering algorithms, where each of them use a different representation for cryptocurrencies, namely, yearly mean, and standard deviation of the returns, distribution of returns that have not been applied to financial markets previously, and the time series of returns. Because each representation provides a different outlook of the market, we also examine the integration of the three clustering results, to obtain a fine-grained analysis of the main trends of the market. In conclusion, we analyze the association of the clustering results with other descriptive features of cryptocurrencies, including the age, technological attributes, and financial ratios derived from them. This will help to enhance the profiling of the clusters with additional descriptive insights, and to find associations with other variables. Consequently, this study describes the whole market based on graphical information, and a scalable methodology that can be reproduced by investors who want to understand the main trends in the market quickly, and those that look for cryptocurrencies with different financial performance.In our analysis of the 2018 and 2019 for extended period, we found that the market can be typically segmented in few clusters (five or less), and even considering the intersections, the 6 more populations account for 75% of the market. Regarding the associations between the clusters and descriptive features, we find associations between some clusters with volume, market capitalization, and some financial ratios, which could be explored in future research.

An Enhanced Version of Cat Swarm Optimization Algorithm for Cluster Analysis

Clustering is an unsupervised machine learning technique that optimally organizes the data objects in a group of clusters. In present work, a meta-heuristic algorithm based on cat intelligence is adopted for optimizing clustering problems. Further, to make the cat swarm algorithm (CSO) more robust for partitional clustering, some modifications are incorporated in it. These modifications include an improved solution search equation for balancing global and local searches, accelerated velocity equation for addressing diversity, especially in tracing mode. Furthermore, a neighborhood-based search strategy is introduced to handle the local optima and premature convergence problems. The performance of enhanced cat swarm optimization (ECSO) algorithm is tested on eight real-life datasets and compared with the well-known clustering algorithms. The simulation results confirm that the proposed algorithm attains the optimal results than other clustering algorithms.

Maxmin Data Range Heuristic-based Initial Centroid Method of Partitional Clustering for Big Data Mining

The centroid-based clustering algorithm depends on the number of clusters, initial centroid, distance measures, and statistical approach of central tendencies. The initial centroid initialization algorithm defines convergence speed, computing efficiency, execution time, scalability, memory utilization, and performance issues for big data clustering. Nowadays various researchers have proposed the cluster initialization techniques, where some initialization techniques reduce the number of iterations with the lowest cluster quality, and some initialization techniques increase the cluster quality with high iterations. For these reasons, this study proposed the initial centroid initialization based Maxmin Data Range Heuristic (MDRH) method for K-Means (KM) clustering that reduces the execution times, iterations, and improves quality for big data clustering. The proposed MDRH method has compared against the classical KM and KM++ algorithms with four real datasets. The MDRH method has achieved better effectiveness and efficiency over RS, DB, CH, SC, IS, and CT quantitative measurements.

Performance Comparison with Hierarchical and Partitional Clustering Methods

In data mining, one of the commonly-used techniques is the clustering. Clustering can be done by the different algorithms such as hierarchical, partitioning, grid, density and graph based algorithms. In this study first of all the concept of data mining explained, then giving information the aims of using data mining and the areas of using and then clustering and clustering algorithms that used in data mining are explained theoretically. Ultimately within the scope of this study, "Mall Customers" data set that taken from Kaggle database, based partitioned clustering and hierarchical clustering algorithms aimed at the separation of clusters according to their costumers features. In the clusters obtained by the partitional clustering algorithms, the similarity within the cluster is maximum and the similarity between the clusters is minimum. The hierarchical clustering algorithms is based on the gathering of similar features or vice versa. The partitional clustering algorithms used; k-means and PAM, hierarchical clustering algorithms used; AGNES and DIANA are algorithms. In this study, R statistical programming language was used in the application of algorithms. At the end of the study, the data set was run with clustering algorithms and the obtained analysis results were interpreted.

K-Means-Based Nature-Inspired Metaheuristic Algorithms for Automatic Data Clustering Problems: Recent Advances and Future Directions

K-means clustering algorithm is a partitional clustering algorithm that has been used widely in many applications for traditional clustering due to its simplicity and low computational complexity. This clustering technique depends on the user specification of the number of clusters generated from the dataset, which affects the clustering results. Moreover, random initialization of cluster centers results in its local minimal convergence. Automatic clustering is a recent approach to clustering where the specification of cluster number is not required. In automatic clustering, natural clusters existing in datasets are identified without any background information of the data objects. Nature-inspired metaheuristic optimization algorithms have been deployed in recent times to overcome the challenges of the traditional clustering algorithm in handling automatic data clustering. Some nature-inspired metaheuristics algorithms have been hybridized with the traditional K-means algorithm to boost its performance and capability to handle automatic data clustering problems. This study aims to identify, retrieve, summarize, and analyze recently proposed studies related to the improvements of the K-means clustering algorithm with nature-inspired optimization techniques. A quest approach for article selection was adopted, which led to the identification and selection of 147 related studies from different reputable academic avenues and databases. More so, the analysis revealed that although the K-means algorithm has been well researched in the literature, its superiority over several well-established state-of-the-art clustering algorithms in terms of speed, accessibility, simplicity of use, and applicability to solve clustering problems with unlabeled and nonlinearly separable datasets has been clearly observed in the study. The current study also evaluated and discussed some of the well-known weaknesses of the K-means clustering algorithm, for which the existing improvement methods were conceptualized. It is noteworthy to mention that the current systematic review and analysis of existing literature on K-means enhancement approaches presents possible perspectives in the clustering analysis research domain and serves as a comprehensive source of information regarding the K-means algorithm and its variants for the research community.

Leaf Segmentation of Rosette Plants using Rough K-Means in CIELab Color Space

Segmentation of Plant Images plays an important role in modern agriculture where it can provide accurate analysis of a plant’s growth and possi-ble anomalies. In this paper, rough set based partitional clustering technique called Rough K-Means has been utilized in CIELab color space for the proper leaf segmentation of rosette plants. The eÿcacy of the proposed technique have been analysed by comparing it with the results of tra-ditional K-Means and Fuzzy C-Means clustering algorithms. The visual and numerical results re-veal that the RKM in CIELab provides the near-est result to the ideal ground truth, hence the most eÿcient one.

1492Ordering the chaos: The global clustering of COVID-19 incidence and mortality

Background The propagation of COVID-19 has been dynamic across countries and time. We utilised a temporal clustering approach in exploring trends of incidence and mortality across 202 countries. Methods COVID-19 case and death data between 1 January 2020 and 30 April 2021 were extracted from open-source data repositories. A partitional clustering algorithm, using Euclidean distances and partition around medoids, was utilised in exploring 14-day incidence and mortality rates across 202 countries. Inter-cluster comparisons were carried out using the 14-day incidence and mortality rates across clusters. Results Country-specific trends of incidence and mortality across the study period were agglomerated into one of six clusters. The overall trend of incidence and mortality during this period peaked between November 2020 and January 2021. However, four of the six clusters have an upward trajectory. Countries in cluster four, mostly situated in Europe, reported the highest overall incidence of 192 cases per 100,000 population (95% CI: 166, 220). Countries in cluster three, a mix of countries from South America, Eastern Europe, and Africa, were observed to have the highest overall mortality rate of 32 deaths per 1,000,000 population (95% CI: 23, 45). Conclusions The high global burden of disease and inequity in vaccine access highlights the need for a consolidated global effort in mitigating the pandemic. Key messages Increasing trajectories of incidence and mortality in Asia, South America, and Africa suggest that the worst of the pandemic may be ahead of us.

Partitional Clustering-Hybridized Neuro-Fuzzy Classification Evolved through Parallel Evolutionary Computing and Applied to Energy Decomposition for Demand-Side Management in a Smart Home

The key advantage of smart meters over rotating-disc meters is their ability to transmit electric energy consumption data to power utilities’ remote data centers. Besides enabling the automated collection of consumers’ electric energy consumption data for billing purposes, data gathered by smart meters and analyzed through Artificial Intelligence (AI) make the realization of consumer-centric use cases possible. A smart meter installed in a domestic sector of an electrical grid and used for the realization of consumer-centric use cases is located at the entry point of a household/building’s electrical grid connection and can gather composite/circuit-level electric energy consumption data. However, it is not able to decompose its measured circuit-level electric energy consumption into appliance-level electric energy consumption. In this research, we present an AI model, a neuro-fuzzy classifier integrated with partitional clustering and metaheuristically optimized through parallel-computing-accelerated evolutionary computing, that performs energy decomposition on smart meter data in residential demand-side management, where a publicly available UK-DALE (UK Domestic Appliance-Level Electricity) dataset is used to experimentally test the presented model to classify the On/Off status of monitored electrical appliances. As shown in this research, the presented AI model is effective at providing energy decomposition for domestic consumers. Further, energy decomposition can be provided for industrial as well as commercial consumers.