Morphological Accuracy Data Clustering: : A Novel Algorithm for Enhanced Cluster Analysis
Authors: 
Abdel Fattah Azzam, Ahmed Maghrabi, Eman El-Naqeeb, Mohammed Aldawood, Hewayda ElGhawalby Academic Editor: Yiming TangAuthors Info & Claims
Abdel Fattah Azzam, Ahmed Maghrabi, Eman El-Naqeeb, Mohammed Aldawood, Hewayda ElGhawalby Academic Editor: Yiming TangAuthors Info & ClaimsAbstract
In today’s data-driven world, we are constantly exposed to a vast amount of information. This information is stored in various information systems and is used for analysis and management purposes. One important approach to handle these data is through the process of clustering or categorization. Clustering algorithms are powerful tools used in data analysis and machine learning to group similar data points together based on their inherent characteristics. These algorithms aim to identify patterns and structures within a dataset, allowing for the discovery of hidden relationships and insights. By partitioning data into distinct clusters, clustering algorithms enable efficient data exploration, classification, and anomaly detection. In this study, we propose a novel centroid-based clustering algorithm, namely, the morphological accuracy clustering algorithm (MAC algorithm). The proposed algorithm uses a morphological accuracy measure to define the centroid of the cluster. The empirical results demonstrate that the proposed algorithm achieves a stable clustering outcome in fewer iterations compared to several existing centroid-based clustering algorithms. Additionally, the clusters generated by these existing algorithms are highly susceptible to the initial centroid selection made by the user.
References
[1]
A. Gionis, H. Mannila, and P. Tsaparas, “Clustering aggregation,” ACM Transactions on Knowledge Discovery from Data, vol. 1, pp. 4–30, 2007.
[2]
A. Gautam and H. S. Bhadauria, “White blood nucleus extraction using K-mean clustering and mathematical morphing,” in 5th International Conference- Confluence the Next Generation Information Technology Summit (Confluence), pp. 549–554, Noida, India, September 2014.
[3]
A. Bansal, M. Sharma, and S. Goel, “Improved K-mean clustering algorithm for prediction analysis using classification technique in data mining,” International Journal of Computer Application, vol. 157, no. 6, pp. 35–40, 2017.
[4]
C. Nikhil and R. Anand, “An improvement in K-mean clustering algorithm better time and accuracy,” International Journal of Programming Languages and Application, (IJPLA), vol. 3, no. 4, pp. 13–19, 2013.
[5]
G. Gan, C. Ma, and J. Wu, “Data clustering: theory, algorithms, and applications,” Applied Mathematics, vol. 20, pp. 1–617, 2007.
[6]
J. A. Hartigan and M. A. Wong, “Algorithm as136: a k-means clustering algorithm,” Applied Statistics, vol. 28, no. 1, pp. 100–108, 1979.
[7]
J. MacQueen, “Some methods for classification and analysis of multivariate observations,” The Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297, 1967.
[8]
R. Azimi, M. Ghofrani, and M. Ghayekhloo, “A hybrid wind power forecasting modelbased on data mining and wavelets analysis,” Energy Conversion and Management, vol. 127, pp. 208–225, 2016.
[9]
P. Wu, M. Bedoya, J. White, and C. L. Brace, “Feature-based automated segmentation of ablation zones by fuzzy c-mean clustering during low-dose computed tomography,” Medical Physics, vol. 48, no. 2, pp. 703–714, 2021.
[10]
J. Han, M. Kamber, and A. K. H. Tung, “Spatial clustering methods in data mining: a survey,” in Geographic Data Mining and Knowledge Discovery, H. J. Miller and J. Han, Eds., Taylor and Francis, New York, NY, USA, 2001.
[11]
L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley, New York, NY, USA, 1990.
[12]
H. Heijmans, “Morphological image operators,” Advances in Electronics and Electron Physics, Academic Press, Boston, MA, USA, 1994.
[13]
J. Serra, “Introduction to mathematical morphology,” Computer Vision, Graphics, and Image Processing, vol. 35, no. 3, pp. 283–305, 1986.
[14]
J. Serra, “Image analysis and mathematical morphology,” Theoretical Advances, vol. 152, no. 2, pp. 597–606, 1988.
[15]
I. M. Hanafy, A. I. Maghrabi, H. Ghawalby, and E. M. El-Naqeeb, “Notes of morphological reduction accuracy,” Alfarama Journal of Basic and Applied Sciences, Faculty of Science Port Said University, vol. 5, no. 2, pp. 221–229, 2024.
[16]
N. A. Erilli, U. Yolcu, E. E. Grio_glu, and Ç. H. Alada, “Determining the most proper number of clusters in fuzzy clustering by using artificial neural networks,” Expert Systems with Applications, vol. 38, no. 3, pp. 2248–2252, 2011.
[17]
S. Yu, Y. M. Wei, J. Fan, X. Zhang, and K. Wang, “Exploring the regional characteristics of inter-provincial CO2 emissions in China: an improved fuzzy clustering analysis based on particle swarm optimization,” Applied Energy, vol. 92, pp. 552–562, 2012.
[18]
H. Yao, Q. Duan, D. Li, and J. Wang, “An improved K-means clustering algorithm for fish image segmentation,” Mathematical and Computer Modelling, vol. 58, no. 3-4, pp. 790–798, 2013.
[19]
S. M. Tagaram, Comparison between K-Means and K-Medoids Clustering Algorithm, Springer-Verlag Berlin Heidelberg, Berlin, Germany, 2011.
[20]
K. K. Pandey and D. Shukla, “Cancer tissue detection using improved K-means initialization method for multi-dimensional microarray big data clustering,” Journal of Ambient Intelligence and Humanized Computing, vol. 14, no. 7, pp. 9277–9303, 2023.
[21]
K. K. Pandey and D. Shukla, “NDPD: an improved initial centroid method of partitional clustering for big data mining,” Journal of Advances in Management Research, vol. 20, no. 1, pp. 1–34, 2023.
[22]
K. K. Pandey and D. Shukla, “Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data,” Evolving Systems, vol. 14, no. 2, pp. 207–244, 2023.
[23]
K. K. Pandey and D. Shukla, “Min-max kurtosis stratum mean: an improved K-means cluster initialization approach for microarray gene clustering on multi-dimensional big data,” Concurrency and Computation: Practice and Experience, vol. 34, no. 23, pp. 1–33, 2022.
[24]
K. K. Pandey and D. Shukla, “Maxmin distance sort heuristic-based initial centroid method of partitional clustering for big data mining,” Pattern Analysis and Applications, vol. 25, no. 1, pp. 139–156, 2022.
Recommendations
On cluster tree for nested and multi-density data clustering
Clustering is one of the important data mining tasks. Nested clusters or clusters of multi-density are very prevalent in data sets. In this paper, we develop a hierarchical clustering approach-a cluster tree to determine such cluster structure and ...
Improved k- means clustering algorithm for two dimensional data
CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information TechnologyClustering is a procedure of organizing the objects in groups whose member exhibits some kind of similarity. So a cluster is a collection of objects which are alike and are different from the objects belonging to other clusters. K-Means is one of ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Abdel Fattah Azzam et al.
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Publisher
Hindawi Limited
London, United Kingdom
Publication History
Published: 01 January 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Feb 2025