Abstract
Genome clustering is one of the big data applications that identify the prognosis of terrifying diseases and biological processes across enormous sets of genes. The K-Means (KM) algorithm is the most commonly used clustering algorithm for gene expression data that extracts hidden knowledge, patterns and trends from gene expression profiles for decision-making strategies. Unfortunately, the KM algorithm is extremely sensitive to initial centroid selection since the initial centroid of clusters influences computational effectiveness, efficiency, cost and local optima issues. The existing initial centroid initialization algorithm attains high computational complexity due to extensive iterations, distance computation, data and result comparison on high dimensional data. To overcome these weaknesses, this study suggested the Min–Max Kurtosis Distance (MMKD) algorithm for big data clustering in a single machine environment. The MMKD algorithm resolves the KM clustering weaknesses by the distance between data points of origin and minimum–maximum kurtosis dimension. The performance of the proposed algorithm is compared to KM, KM++ , ADV, MKM, Mean-KM, NFD, K-MAM, NRKM2, FMNN and MuKM algorithms by internal and external effectiveness validation metrics with efficiency measurement on sixteen gene expression datasets. The experimental evaluation demonstrates that the MMKDKM algorithm reduces iterations, local optima, computation costs, and improves cluster performance, effectiveness and efficiency with stable convergence than other algorithms. The statistical analysis of this study promised that the proposed MMKDKM algorithm achieves a significant difference.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
This study used a publicly available dataset for experiments and results analysis. The sources of gene expression data are listed in Table 1, where gene datasets DB1 to DB9 are available at https://portals.broadinstitute.org/cgi-bin/cancer/datasets.cgi and DB10 to DB16 are available at https://sbcb.inf.ufrgs.br/cumida.
References
Aamer Y, Benkaouz Y, Ouzzif M, Bouragba K (2020) Initial centroid selection method for an enhanced k-means clustering algorithm. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics). Springer Singapore, pp 182–190
Aggarwal CC, Reddy CK (2014) Data clustering algorithms and applications. CRC Press, Boca Raton
Aguirre JCR (2017) Clustering in high dimension for multivariate and functional data using extreme kurtosis projections. Universidad Carlos III de Madrid
Al Hasan HM, Chaoji V, Salem S, Zaki MJ (2009) Robust partitional clustering by outlier and density insensitive seeding. Pattern Recognit Lett 30:994–1002. https://doi.org/10.1016/j.patrec.2009.04.013
Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: SODA ’07: proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. ACM Digital Library, pp 1027–1035
Aune-Lundberg L, Strand G (2014) Comparison of variance estimation methods for use with two-dimensional systematic sampling of land use/land cover data. Environ Model Softw 61:87–97. https://doi.org/10.1016/j.envsoft.2014.07.001
Äyrämö S (2006) Knowledge mining using robust clustering. Jyväskylä University Printing House, Jyväskylä
Bakhthemmat A, Izadi M (2020) Decreasing the execution time of reducers by revising clustering based on the futuristic greedy approach. J Big Data 7:6. https://doi.org/10.1186/s40537-019-0279-z
Bianchi FM, Livi L, Rizzi A (2016) Two density-based k-means initialization algorithms for non-metric data clustering. Pattern Anal Appl 19:745–763. https://doi.org/10.1007/s10044-014-0440-4
Birgin EG, Martinez JM, Ronconi DP (2003) Minimization subproblems and heuristics for an applied clustering problem. Eur J Oper Res 146:19–34. https://doi.org/10.1016/S0377-2217(02)00208-4
Botía JA, Vandrovcova J, Forabosco P et al (2017) An additional k-means clustering step improves the biological features of WGCNA gene co-expression networks. BMC Syst Biol 11:47. https://doi.org/10.1186/s12918-017-0420-6
Brodinová Š, Filzmoser P, Ortner T et al (2019) Robust and sparse k-means clustering for high-dimensional data. Adv Data Anal Classif 13:905–932. https://doi.org/10.1007/s11634-019-00356-9
Cao F, Liang J, Jiang G (2009) An initialization method for the k-means algorithm using neighborhood model. Comput Math Appl 58:474–483. https://doi.org/10.1016/j.camwa.2009.04.017
Capó M, Pérez A, Lozano JA (2020) An efficient K-means clustering algorithm for tall data. Data Min Knowl Discov 34:776–811. https://doi.org/10.1007/s10618-020-00678-9
Celebi ME, Kingravi HA (2012) Deterministic initialization of the k-means algorithm using hierarchical clustering. Int J Pattern Recognit Artif Intell. https://doi.org/10.1142/S0218001412500188
Celebi ME, Kingravi HA (2015) Linear, deterministic and order-invariant initialization methods for the k-means clustering algorithm. In: Celebi ME (ed) Partitional clustering algorithms. Springer International Publishing, Cham, pp 79–98
Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst Appl 40:200–210. https://doi.org/10.1016/j.eswa.2012.07.021
Celikoglu A, Tirnakli U (2018) Skewness and kurtosis analysis for non-Gaussian distributions. Phys A Stat Mech Appl 499:325–334. https://doi.org/10.1016/j.physa.2018.02.035
Chen M, Ludwig SA, Li K (2017) Clustering in big data. In: Li K-C, Jiang H, Zomaya AY (eds) big data management and processing. Chapman and Hall/CRC, New York, pp 333–346
Chowdhury K, Chaudhuri D, Pal AK (2020) An entropy-based initialization method of k-means clustering on the optimal number of clusters. Neural Comput Appl 33:6965–6982. https://doi.org/10.1007/s00521-020-05471-9
Dafir Z, Lamari Y, Slaoui SC (2021) A survey on parallel clustering algorithms for big data. Artif Intell Rev 54:2411–2443. https://doi.org/10.1007/s10462-020-09918-2
De Souto MCP, Costa IG, De Arauje ADSA et al (2008) Clustering cancer gene expression data: a comparative study. BMC Bioinf 14:1–14. https://doi.org/10.1186/1471-2105-9-497
De Souto MCP, Coelho ALV, Faceli K et al (2012) A comparison of external clustering evaluation indices in the context of imbalanced data sets. In: 2012 Brazilian symposium on neural networks. IEEE, pp 49–54
Deeb H, Sarangi A, Mishra D, Sarangi SK (2020) Improved black hole optimization algorithm for data clustering. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2020.12.013
Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30
Dhanabal S, Chandramathi S (2017) Enhancing clustering accuracy by finding initial centroid using k-minimum-average-maximum method. Int J Inf Commun Technol. https://doi.org/10.1504/IJICT.2017.10007027
Duwairi R, Abu-Rahmeh M (2015) A novel approach for initializing the spherical k-means clustering algorithm. Simul Model Pract Theory 54:49–63. https://doi.org/10.1016/j.simpat.2015.03.007
Erisoglu M, Calis N, Sakallioglu S (2011) A new algorithm for initial cluster centers in k-means algorithm. Pattern Recognit Lett 32:1701–1705. https://doi.org/10.1016/j.patrec.2011.07.011
Fahad A, Alshatri N, Tari Z et al (2014) A survey of clustering algorithms for big data: taxonomy and empirical analysis. IEEE Trans Emerg Top Comput 2:267–279. https://doi.org/10.1109/TETC.2014.2330519
Fallah Tehrani A, Ahrens D (2017) Modified sequential k-means clustering by utilizing response: a case study for fashion products. Expert Syst. https://doi.org/10.1111/exsy.12226
Feltes BC, Chandelier EB, Grisci BI, Dorn M (2019) CuMiDa: an extensively curated microarray database for benchmarking and testing of machine learning approaches in cancer research. J Comput Biol 26:376–386. https://doi.org/10.1089/cmb.2018.0238
Fränti P, Sieranoja S (2018) K-means properties on six clustering benchmark datasets. Appl Intell 48:4743–4759. https://doi.org/10.1007/s10489-018-1238-7
Fränti P, Sieranoja S (2019) How much can k-means be improved by using better initialization and repeats? Pattern Recognit 93:95–112. https://doi.org/10.1016/j.patcog.2019.04.014
Gan G, Ma C, Wu J (2007) Data clustering theory, algorithms and applications. Society for Industrial and Applied Mathematics and American Statistical Association, Philadelphia, Pennsylvania
Gandomi A, Haider M (2015) Beyond the hype: big data concepts methods and analytics. Int J Inf Manage 35:137–144. https://doi.org/10.1016/j.ijinfomgt.2014.10.007
Gentile C (2013) Using the kurtosis measure to identify clusters in wireless channel impulse responses. IEEE Trans Antennas Propag 61:3392–3395. https://doi.org/10.1109/TAP.2013.2253299
Goyal M, Kumar S (2014) Improving the initial centroids of k-means clustering algorithm to generalize its applicability. J Inst Eng Ser B 95:345–350. https://doi.org/10.1007/s40031-014-0106-z
HajKacem MAB, N’Cir C-EB, Essoussi N (2019) Overview of scalable partitional methods for big data clustering. In: Nasraoui O, N’Cir C-EB (eds) Clustering methods for big data analytics, unsupervised and semi-supervised learning. Springer Nature, Switzerland, pp 1–23
He J, Lan M, Tan CL et al (2004) Initialization of cluster refinement algorithms: a review and comparative study. In: IEEE international conference on neural networks—conference proceedings. IEEE Xplore, pp 297–302
Hoshida Y (2010) Nearest template prediction: a single-sample-based flexible class prediction with confidence assessment. PLoS ONE. https://doi.org/10.1371/journal.pone.0015543
Hoshida Y, Brunet J-P, Tamayo P et al (2007) Subclass mapping: identifying common subtypes in independent disease data sets. PLoS ONE. https://doi.org/10.1371/journal.pone.0001195
Ismkhan H (2018) I-k-means−+: an iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recognit 79:402–413. https://doi.org/10.1016/j.patcog.2018.02.015
Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recognit Lett 31:651–666. https://doi.org/10.1016/j.patrec.2009.09.011
Ji J, Pang W, Zheng Y et al (2015) An initialization method for clustering mixed mumeric and categorical data based on the density and distance. Int J Pattern Recognit Artif Intell. https://doi.org/10.1142/S021800141550024X
Kalyanakrishnan S (2017) K -means clustering. IIT Bombay, India
Kant S, Mahara T, Kumar Jain V et al (2018) Leader rank based k-means clustering initialization method for collaborative filtering. Comput Electr Eng 69:598–609. https://doi.org/10.1016/j.compeleceng.2017.12.001
Kao F, Leu C, Ko C (2011) Remainder markov systematic sampling. J Stat Plan Inference 141:3595–3604. https://doi.org/10.1016/j.jspi.2011.05.011
Kaur P, Singh A, Chana I (2021) Computational techniques and tools for omics data analysis: state-of-the-art, challenges, and future directions. Springer, Netherlands
Kazemi A, Khodabandehlouie G (2018) A new initialisation method for k-means algorithm in the clustering problem: data analysis. Int J Data Anal Tech Strateg 10:291. https://doi.org/10.1504/IJDATS.2018.094127
Khondoker MR (2018) Big data clustering. In: Wiley StatsRef: statistics reference online. John Wiley & Sons, Ltd, Chichester, UK, pp 1–10
Kumar KM, Reddy ARM (2017) An efficient k-means clustering filtering algorithm using density based initial cluster centers. Inf Sci (NY) 418–419:286–301. https://doi.org/10.1016/j.ins.2017.07.036
Kumar Y, Gupta S, Singla R, Hu YC (2021) A systematic review of artificial intelligence techniques in cancer prediction and diagnosis. Arch Comput Methods Eng. https://doi.org/10.1007/s11831-021-09648-w
Kushwaha N, Pant M, Kant S, Jain VK (2018) Magnetic optimization algorithm for data clustering. Pattern Recognit Lett 115:59–65. https://doi.org/10.1016/j.patrec.2017.10.031
Lakshmi MA, Victor Daniel G, Srinivasa Rao D (2019) Initial centroids for k-means using nearest neighbors and feature means. In: Advances in intelligent systems and computing. Springer Singapore, pp 27–34
Lam YK, Tsang PWM (2012) eXploratory k-means: a new simple and efficient algorithm for gene clustering. Appl Soft Comput 12:1149–1157. https://doi.org/10.1016/j.asoc.2011.11.008
Lee I (2017) Big data: dimensions, evolution, impacts and challenges. Bus Horiz 60:293–303. https://doi.org/10.1016/j.bushor.2017.01.004
Liu T, Zhu J, Zhou J et al (2019) Initialization-similarity clustering algorithm. Multimed Tools Appl 78:33279–33296. https://doi.org/10.1007/s11042-019-7663-8
Lu JF, Tang JB, Tang ZM, Yang JY (2008) Hierarchical initialization approach for K-Means clustering. Pattern Recognit Lett 29:787–795. https://doi.org/10.1016/j.patrec.2007.12.009
Mabu AM, Prasad R, Yadav R (2020) Mining gene expression data using data mining techniques: a critical review. J Inf Optim Sci 41:723–742. https://doi.org/10.1080/02522667.2018.1555311
Malinen MI, Mariescu-Istodor R, Fränti P (2014) K-means⁎: clustering by gradual data transformation. Pattern Recognit 47:3376–3386. https://doi.org/10.1016/j.patcog.2014.03.034
Mostafa SA, Ahmad IA (2018) Recent developments in systematic sampling: a review. J Stat Theory Pract 12:290–310. https://doi.org/10.1080/15598608.2017.1353456
Murugesan VP, Murugesan P (2020) A new initialization and performance measure for the rough k-means clustering. Soft Comput 24:11605–11619. https://doi.org/10.1007/s00500-019-04625-9
Nidheesh N, Abdul Nazeer KA, Ameer PM (2017) An enhanced deterministic k-means clustering algorithm for cancer subtype prediction from gene expression data. Comput Biol Med 91:213–221. https://doi.org/10.1016/j.compbiomed.2017.10.014
Oyelade J, Isewon I, Oladipupo F et al (2016) Clustering algorithms: their application to gene expression data. Bioinform Biol Insights. https://doi.org/10.4137/BBI.S38316
Pandey KK, Shukla D (2021) Stratified linear systematic sampling based clustering approach for detection of financial risk group by mining of big data. Int J Syst Assur Eng Manage. https://doi.org/10.1007/s13198-021-01424-0
Pandey KK, Shukla D (2022a) Maxmin data range heuristic-based initial centroid method of partitional clustering for big data mining. Int J Inf Retr Res 12:1–22. https://doi.org/10.4018/IJIRR.289954
Pandey KK, Shukla D (2022b) Maxmin distance sort heuristic-based initial centroid method of partitional clustering for big data mining. Pattern Anal Appl 25:139–156. https://doi.org/10.1007/s10044-021-01045-0
Pandey KK, Shukla D (2020) Milan R (2020) A comprehensive study of clustering algorithms for big data mining with mapreduce capability. In: Shukla RK, Agrawal J, Sharma S et al (eds) Social networking and computational intelligence. Lecture notes in networks and systems. Springer Nature Singapore Pte Ltd., Singapore, pp 427–440
Parker JK, Hall LO (2014) Accelerating fuzzy-c means using an estimated subsample size. IEEE Trans Fuzzy Syst 22:1229–1244. https://doi.org/10.1109/TFUZZ.2013.2286993
Peña J, Lozano J, Larrañaga P (1999) An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recognit Lett 20:1027–1040. https://doi.org/10.1016/S0167-8655(99)00069-0
Poomagal S, Saranya P, Karthik S (2016) A novel method for selecting initial centroids in k-means clustering algorithm. Int J Intell Syst Technol Appl 15:230. https://doi.org/10.1504/IJISTA.2016.078347
Redmond SJ, Heneghan C (2007) A method for initialising the K-means clustering algorithm using kd-trees. Pattern Recognit Lett 28:965–973. https://doi.org/10.1016/j.patrec.2007.01.001
Rosenberg A, Hirschberg J (2007) V-Measure: a conditional entropy-based external cluster evaluation measure. In: Joint conference on empirical methods in natural language processing and computational natural language learning. Association for Computational Linguistics, pp 410–420
Saxena A, Prasad M, Gupta A et al (2017) A review of clustering techniques and developments. Neurocomputing 267:664–681. https://doi.org/10.1016/j.neucom.2017.06.053
Sharma A, Rani R (2021) A systematic review of applications of machine learning in cancer prediction and diagnosis. Arch Comput Methods Eng 28:4875–4896. https://doi.org/10.1007/s11831-021-09556-z
Sivarajah U, Kamal MM, Irani Z, Weerakkody V (2017) Critical analysis of big data challenges and analytical methods. J Bus Res 70:263–286. https://doi.org/10.1016/j.jbusres.2016.08.001
Steinley D, Brusco MJ (2007) Initializing k-means batch clustering: a critical evaluation of several techniques. J Classif 24:99–121. https://doi.org/10.1007/s00357-007-0003-0
Torrente A, Romo J (2021) Initializing k-means clustering by bootstrap and data depth. J Classif 38:232–256. https://doi.org/10.1007/s00357-020-09372-3
Xiao Y, Yu J (2012) Partitive clustering (k-means family). Wiley Interdiscip Rev Data Min Knowl Discov 2:209–225. https://doi.org/10.1002/widm.1049
Xiao J, Yan Y, Zhang J, Tang Y (2010) A quantum-inspired genetic algorithm for k-means clustering. Expert Syst Appl 37:4966–4973. https://doi.org/10.1016/j.eswa.2009.12.017
Xu J, Xu B, Zhang W et al (2009) Stable initialization scheme for K-means clustering. Wuhan Univ J Nat Sci 14:24–28. https://doi.org/10.1007/s11859-009-0106-z
Yeh W-C, Lai C-M (2015) Accelerated simplified swarm optimization with exploitation search scheme for data clustering. PLoS ONE 10:e0137246. https://doi.org/10.1371/journal.pone.0137246
Yu X, Yu G, Wang J (2017) Clustering cancer gene expression data by projective clustering ensemble. PLoS ONE. https://doi.org/10.1371/journal.pone.0171429
Zahra S, Ghazanfar MA, Khalid A et al (2015) Novel centroid selection approaches for k-means-clustering based recommender systems. Inf Sci (NY) 320:156–189. https://doi.org/10.1016/j.ins.2015.03.062
Zhu M, Wang W, Huang J (2014) Improved initial cluster center selection in k-means clustering. Eng Comput 31:1661–1667. https://doi.org/10.1108/EC-11-2012-0288
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pandey, K.K., Shukla, D. Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data. Evolving Systems 14, 207–244 (2023). https://doi.org/10.1007/s12530-022-09447-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12530-022-09447-z