A genetic algorithm clustering ensemble approach to learning relational database

Rayner Alfred and Gabriel Jong Chiye and Mohd Hanafi Ahmad Hijazi and Joe Henry Obit and Kim, On Chin and Lau, Hui Keng (2015) A genetic algorithm clustering ensemble approach to learning relational database. Advanced Science Letters, 21 (10). pp. 3314-3318.


Download (43kB) | Preview


Clustering is an unsupervised learning algorithm. k-Means algorithm is one of the well-known and promising clustering algorithms that can converge to a local optimum in few iterative. In our work, we will be hybridizing k-Means algorithm with Genetic Algorithms to look for the solution in the global search space in order to converge to a global optima. The problem for clustering is that when the number of clusters increases up to the same number of total records in the dataset, it leads to a scenario in which a cluster only contains a single record, and thus the cluster purity is maximized to the maximum value, 1. However, it will be useless since the common regularities among records will not be seen. Therefore, choosing the best number of clusters is trivial. Instead of choosing an inappropriate number of clusters and risking the main purpose of the clustering process, a Genetic Algorithm based k-Means ensemble is proposed in order to find the consensus result of several runs of clustering task using different number of clusters, k.

Item Type: Article
Uncontrolled Keywords: K-Means algorithm ,
Subjects: Q Science > QA Mathematics
Depositing User: ADMIN ADMIN
Date Deposited: 08 Dec 2016 15:40
Last Modified: 23 Oct 2017 16:01
URI: http://eprints.ums.edu.my/id/eprint/15135

Actions (login required)

View Item View Item