An R Code for Implementing Non-hierarchical Algorithm for Clustering of Probability Density Functions
Abstract
This paper aims to present a code for implementation of non-hierarchical algorithm to cluster probability density functions in one dimension for the first time in R environment. The structure of code consists of 2 primary steps: executing the main clustering algorithm and evaluating the clustering quality. The code is validated on one simulated data set and two applications. The numerical results obtained are highly compatible with that on MATLAB software regarding computational time. Notably, the code mainly serves for educational purpose and desires to extend the availability of algorithm in several environments so as having multiple choices for whom interested in clustering.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords
Crisp Clustering, Non-Hierarchical Algorithm, Probability Density Problem, R Code
Full Text:
PDFTime cited: 0
DOI: http://dx.doi.org/10.25073/jaec.201823.194
Refbacks
- There are currently no refbacks.
Copyright (c) 2018 Journal of Advanced Engineering and Computation