A direct data-cluster analysis method based on neutrosophic set implication

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University of California, Irvine, Machine Learning Repository) along with k-means and threshold-based clustering algorithms. The proposed method results in more segregated datasets with compacted clusters, thus achieving higher validity indices. The method also eliminates the limitations of threshold-based clustering algorithm and validates measures and respective indices along with k-means and threshold-based clustering algorithms.

Cite

CITATION STYLE

APA

Jha, S., Joshi, G. P., Nkenyereya, L., Kim, D. W., & Smarandache, F. (2020). A direct data-cluster analysis method based on neutrosophic set implication. Computers, Materials and Continua, 65(2), 1203–1220. https://doi.org/10.32604/cmc.2020.011618

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free