A genetic algorithm based clustering ensemble approach to learning relational databases

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

Preview	Text A_genetic_algorithm_based_clustering_ensemble_approach_to_learning_relational_databases.pdf Download (42kB) | Preview
	Text A genetic algorithm based clustering ensemble approach to learning relational databases.pdf Restricted to Registered users only Download (366kB)

Abstract

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
Keyword:	K-Means ensemble , dataset
Subjects:	Q Science > QA Mathematics
Department:	FACULTY > Faculty of Engineering
Depositing User:	ADMIN ADMIN
Date Deposited:	09 Jan 2017 08:52
Last Modified:	09 Dec 2020 10:24
URI:	https://eprints.ums.edu.my/id/eprint/15347

Actions (login required)

View Item