452 469
Full Length Article
Fusion: Practice and Applications
Volume 11 , Issue 1, PP: 70-76 , 2023 | Cite this article as | XML | Html |PDF

Title

Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm

  Sarah G. M. Al- Kababchee 1 * ,   Zakariya Y. Algamal 2 ,   Omar S. Qasim 3

1  Department of Mathematics, Education College, University of AL-Hamdaniya
    (sarahghanim@uohamdaniya.edu.iq)

2  Department of Statistics and Informatics, University of Mosul, 41002 Mosul, Iraq; College of Engineering, University of Warith Al-Anbiyaa, 56001 Karbala, Iraq
    (zakariya.algamal@uomosul.edu.iq)

3  Department of Mathematics, University of Mosul, Mosul, Iraq
    (omar.saber@uomosul.edu.iq)


Doi   :   https://doi.org/10.54216/FPA.110105

Received: December 14, 2022 Accepted: March 19, 2023

Abstract :

This paper presents an improved penalized regression-based clustering algorithm using a nature-inspired approach. Clustering is an unsupervised learning method widely used in data fusion mining, including gene analysis, to group unclassified fusion data based on their features. The proposed algorithm is an extension of the "Sum of Norms" model and aims to better estimate the data by fusing information from various sources. The performance of the proposed algorithm is evaluated on gene expression data. Results show that our approach outperforms other methods, indicating its potential impact on clustering research with data fusion.

Keywords :

Black hole algorithm; Data fusion mining; Clustering fusion data , Bat algorithm; K-means.

References :

[1]          A. A. Esmin, R. A. Coelho, and S. Matwin, "A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data," Artificial Intelligence Review, vol. 44, pp. 23-45, 2015.

[2]          Ziaul Hasan, Hassan r. Mohammad, & Maka Jishkariani. (2022). Machine Learning and Data Mining Methods for Cyber Security: A Survey . Mesopotamian Journal of CyberSecurity, 2022, 47–56. https://doi.org/10.58496/MJCS/2022/006

[3]          C. K. Reddy and B. Vinzamuri, "A survey of partitional and hierarchical clustering algorithms," in Data clustering, ed: Chapman and Hall/CRC, 2018, pp. 87-110.

[4]          X. Yan, Y. Zhu, W. Zou, and L. Wang, "A new approach for data clustering using hybrid artificial bee colony algorithm," Neurocomputing, vol. 97, pp. 241-250, 2012.

[5]          P. A, D. D, J. FD, and B. C, "Clustering by sum of norms: stochastic incremental algorithm, convergence and cluster recovery," International conference on machine learning, p. 8, 2017.

[6]          L. F, O. H, and L. L, " Clustering using sum-ofnorms regularization: with application to particle filter output computation," Statistical signal processing workshop (SSP) 2011 IEEE, pp. 201–204., 2011.

[7]          H. TD, J. A, B. F, and V. J-P, "Clusterpath an algorithm for clustering using convex fusion penalties.," international conference on machine learning, p. 1, 2011.

[8]          C. GK, C. EC, R. JMO, and L. K, "Convex clustering: an attractive alternative to hierarchical clustering," PLoS Comput Biol 2015.

[9]          M. J, "Some methods for classification and analysis of multivariate observations," roceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, p. 16, 1967.

[10]        C. EC and L. K, "Splitting methods for convex clustering," J Comput Graph Stat, vol. 24, 2015.

[11]        O. M. Ismael, O. S. Qasim, and Z. Y. Algamal, "A new adaptive algorithm for v-support vector regression with feature selection using Harris hawks optimization algorithm," in Journal of Physics: Conference Series, 2021, p. 012057.

[12]        S. Ghosh and S. K. Dubey, "Comparative analysis of k-means and fuzzy c-means algorithms," International Journal of Advanced Computer Science and Applications, vol. 4, 2013.

[13]        P. W, S. X, and L. B, "Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty," J Mach Learn Res, vol. 14, p. 24, 2013.

[14]        S. G. M. Al-kababchee, Z. Y. Algamal, and O. S. Qasim, "Enhancement of K-means clustering in big data based on equilibrium optimizer algorithm," Journal of Intelligent Systems, vol. 32, p. 20220230, 2023.

[15]        S. Rana, S. Jasola, and R. Kumar, "A hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm," International Journal of Engineering, Science and Technology, vol. 2, 2010.

[16]        J. Sun, W. Chen, W. Fang, X. Wun, and W. Xu, "Gene expression data analysis with the clustering method based on an improved quantum-behaved Particle Swarm Optimization," Engineering Applications of Artificial Intelligence, vol. 25, pp. 376-391, 2012.

[17]        V. N. Wijayaningrum and N. N. Putriwijaya, "An improved crow search algorithm for data clustering," EMITTER International Journal of Engineering Technology, vol. 8, pp. 86-101, 2020.

[18]        M. Basha, S. Nidamanuri, A. Pureti, and V. krishna, " Clustering Based Energy Coding for Wireless Adhoc Network," International Journal of Wireless and Ad Hoc Communication (IJWAC), vol. 1, pp. 34-52, 2020.

[19]        Z. Y. Algamal, M. H. Lee, A. Al-Fakih, and M. Aziz, "High-dimensional QSAR modelling using penalized linear regression model with L 1/2-norm," SAR and QSAR in Environmental Research, vol. 27, pp. 703-719, 2016.

[20]        A. Abdelaziz and A. N. Mahmoud, "A Novel Metaheuristic Optimization based Clustering with Routing Scheme for IoT Mobile Edge Computing Platform," International Journal of Wireless and Ad Hoc Communication (IJWAC), vol. 4, pp. 61-71, 2022.

[21]        S. Tasoulis, N. G. Pavlidis, and T. Roos, "Nonlinear dimensionality reduction for clustering," Pattern Recognition, vol. 107, 2020.

[22]        R. Xu and D. Wunsch, "Survey of clustering algorithms," IEEE Trans Cybern, vol. 16, p. 33, 2005.

[23]        P. J. Groenen and K. Jajuga, "Fuzzy clustering with squared Minkowski distances," Fuzzy Sets and Systems, vol. 120, pp. 227-237, 2001.

[24]        J. Mao and A. K. Jain, "A self-organizing network for hyperellipsoidal clustering (HEC)," IEEE Transactions on Neural Networks, vol. 7, p. 13, 1996.

[25]        S. Ray and R. H. Turi, "Determination of number of clusters in k-means clustering and application in colour image segmentation," in Proceedings of the 4th international conference on advances in pattern recognition and digital techniques, 1999, p. 143.


Cite this Article as :
Style #
MLA Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim. "Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm." Fusion: Practice and Applications, Vol. 11, No. 1, 2023 ,PP. 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)
APA Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim. (2023). Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm. Journal of Fusion: Practice and Applications, 11 ( 1 ), 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)
Chicago Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim. "Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm." Journal of Fusion: Practice and Applications, 11 no. 1 (2023): 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)
Harvard Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim. (2023). Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm. Journal of Fusion: Practice and Applications, 11 ( 1 ), 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)
Vancouver Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim. Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm. Journal of Fusion: Practice and Applications, (2023); 11 ( 1 ): 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)
IEEE Sarah G. M. Al- Kababchee, Zakariya Y. Algamal, Omar S. Qasim, Improving Penalized-Based Clustering Model in Big Fusion Data by Hybrid Black Hole Algorithm, Journal of Fusion: Practice and Applications, Vol. 11 , No. 1 , (2023) : 70-76 (Doi   :  https://doi.org/10.54216/FPA.110105)