Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms
| dc.contributor.author | Ajiboye, A.R. | |
| dc.contributor.author | Isah-Kebbe, H. | |
| dc.contributor.author | Oladele, T.O. | |
| dc.date.accessioned | 2018-12-03T13:21:14Z | |
| dc.date.available | 2018-12-03T13:21:14Z | |
| dc.date.issued | 2014-08 | |
| dc.description | Article | en_US |
| dc.description.abstract | Exploring the dataset features through the application of clustering algorithms is a viable means by which the conceptual description of such data can be revealed for better understanding, grouping and decision making. Some clustering algorithms, especially those that are partitioned-based, clusters any data presented to them even if similar features do not present. This study explores the performance accuracies of partitioning-based algorithms and probabilistic model-based algorithm. Experiments were conducted using k-means, k-medoids and EM-algorithm. The study implements each algorithm using RapidMiner Software and the results generated was validated for correctness in accordance to the concept of external criteria method. The clusters formed revealed the capability and drawbacks of each algorithm on the data points. | en_US |
| dc.identifier.citation | International Journal of Applied Information Systems | en_US |
| dc.identifier.issn | 2249-0868 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/1329 | |
| dc.language.iso | en | en_US |
| dc.publisher | Foundation of Computer Science | en_US |
| dc.relation.ispartofseries | ;Volume 7, No.7, | |
| dc.subject | Clustering | en_US |
| dc.subject | Algorithm | en_US |
| dc.subject | K-means | en_US |
| dc.subject | EM-clustering, | en_US |
| dc.subject | K-medoids | en_US |
| dc.title | Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms | en_US |
| dc.type | Article | en_US |