Perbandingan Hybrid Genetic K-Means++ dan Hybrid Genetic K-Medoid untuk Klasterisasi Dataset EEG Eyestate

K-Means++ and K-Medoids are data clustering methods. The data cluster speed is determined by the iteration value, the lower the iteration value, the faster the data clustering is done. Data clustering performance can be optimized to get more optimal clustering results. One algorithm that can optimize cluster speed is Genetic Algorithm (GA). The dataset used in the study is a dataset of EEG Eyestate. The optimization results before hybrid GA on K-Means++ are the iteration average values is 11.6 to 5,15, and in K-Medoid are the iteration average values decreased from 5.9 to 5.2. Based on the comparison of GA K-Means++ and GA K-Medoids iterations, it can be concluded that GA - K-Means++ bette

High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm

We implement a master-slave parallel genetic algorithm (PGA) with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs) to implement a PGA and visualise the results using disjoint minimal spanning trees (MSTs). We demonstrate that our GPU PGA, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, based on a subset of stocks in the South African market. This represents a pragmatic choice for low-cost, scalable parallel computing and is significantly faster than a prototype serial implementation in an optimised C-based fourth-generation programming language, although the results are not directly comparable due to compiler differences. Combined with fast online intraday correlation matrix estimation from high frequency data for cluster identification, the proposed implementation offers cost-effective, near-real-time risk assessment for financial practitioners.Comment: 10 pages, 5 figures, 4 tables, More thorough discussion of implementatio

Self-adaptive GA, quantitative semantic similarity measures and ontology-based text clustering

As the common clustering algorithms use vector space model (VSM) to represent document, the conceptual relationships between related terms which do not co-occur literally are ignored. A genetic algorithm-based clustering technique, named GA clustering, in conjunction with ontology is proposed in this article to overcome this problem. In general, the ontology measures can be partitioned into two categories: thesaurus-based methods and corpus-based methods. We take advantage of the hierarchical structure and the broad coverage taxonomy of Wordnet as the thesaurus-based ontology. However, the corpus-based method is rather complicated to handle in practical application. We propose a transformed latent semantic analysis (LSA) model as the corpus-based method in this paper. Moreover, two hybrid strategies, the combinations of the various similarity measures, are implemented in the clustering experiments. The results show that our GA clustering algorithm, in conjunction with the thesaurus-based and the LSA-based method, apparently outperforms that with other similarity measures. Moreover, the superiority of the GA clustering algorithm proposed over the commonly used k-means algorithm and the standard GA is demonstrated by the improvements of the clustering performance