Comparative Study Between Primitive Operation Complexity Against Running Time Application On Clustering Algorithm
Main Article Content
Abstract
Time complexity of an algorithm is a standard test to obtain the execution time-efficient when implemented in a programming language. Asymptotic analysis approach uses the concept of the Big-O is one of the techniques commonly used to test the time complexity of an algorithm. This study will conduct a comparison test between the three clustering algorithms using time complexity analysis of primitive operations with the running time of applications when the algorithm is used in a programming language or an application. K-means clustering algorithm, Fuzzy C-Means (FCM) and the Hierarchy Agglomerative Clustering (HAC) will be compared based on the analysis of primitive operations and their implementation using MATLAB applications. The results showed that, HAC algorithm has running time that is much more stable than the K-means, although based on the analysis of Big-O, both have the same time complexity. So also between HAC and FCM, HAC is much more stable than the FCM algorithm for all testing using different data sets.
Keywords: time complexity, clustering algorithm, K-means, Fuzzy C-means, Hierarchy Agglomerative Clustering
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.