1
University of the Witwatersrand Johannesburg, South Africa
(anipise@deloitte.co.za)
2
Assistant Professor in Pune Institute of Computer Technology Pune, India
(ganeshpise143@gmail.com)
3
Assistant Professor, Department of AI and Big data, Woosong University, Daejeon, South Korea
(singh.saurabh@wsu.ac.kr)
4
Associate Engineer, TSYS Global Payments, Pune, India
(hemachandran.k@woxsen.edu.in)
5
University of Prince Edward Island, Canada
(jimuede@upei.ca)
6
Department of Computer Engineering, Vishwakarma Institute of Technology, Pune, India
(sandeep.shinde@vit.edu)
Abstract :
The exponential rise in accidents and the introduction of new, supposedly trendy ways of living have contributed to the dire need for the needy to have an organ or blood transfusion. Circumstances refer to a circumstance where proper care should be taken when collecting the necessary blood or original parts for transfusion, typically in dire circumstances. To determine the distance at which the interested and qualified donors are located, a thorough investigation must be conducted. People are often first categorized according to their blood type, eligibility, and region. Following that, people group together according to locality. A healthy person can safely donate blood twice within 56 days, as this is the minimal time between successful donations that has been established as a norm. The decision to donate an organ is often made after careful consideration of the severity of the situation, the donor's health, and the health of the recipient. Knowledge data finding tasks can be made easier with the help of KEEL, an open-source programme. The graphs that are produced show clearly how the proposed algorithm varies from the standard K-means method. Therefore, it will be quite useful in the present day and could end up saving lots of lives. The necessity to decide ahead of time on the total number of groups is just one of the issues with the K-means clustering method. In practise, it is difficult to anticipate the precise number of clusters. When the number of clusters is small, incongruous clustering is more common, but when the number of clusters is large, like clustering is more common. Thanks to a method called Active Cluster with Modified k-means clustering, which finds the right number of clusters on the fly, the issue is now resolved
Keywords :
Blood Donors; K-means method; Blood transfusion; ACK-means method.
References :
[1] Uma Boregowda, Venugopal R Chakravarthy, “A Hybrid Task Scheduler for DAG Applications on A Cluster of Processors”, 978-1-4799-4363-0/14 2014 IEEE
[2]. TuLinLi, Deng YanNi, Chu SiYong, “A K-means Clustering Algorithm Based on Double Attributes of Objects”, 978-1-4673-7143-8/15 2015 IEEE
[3]. David P. Pancho, Jose M. Alonso, Jes´usAlcal´a- Fdez “A new fingram-based software tool for visual representation and analysis of fuzzy association rules”, ,10.1109/FUZZ-IEEE.2013.6622478 July 2013 IEEE
[4]. Fuyuan Cao, Jiye Liang and Liang Bai “A new initialization method for categorical data clustering”, 2009 Elsevier Ltd.
[5]. Muamer N. Mohammada, NorrozilaSulaimana, Osama AbdulkarimMuhsinb “A Novel Intrusion Detection System by using Intelligent Data Mining in WEKA Environment”, , 1877-0509 2010 Published by Elsevier Ltd. doi:10.1016/j.procs.2010.12.198
[6]. Aris- Kyriakos Koliopoulos, ParaskevasYiapanis, FiratTekiner, Goran Nenadic, John Keane “A Parallel Distributed Weka Framework for Big Data Mining using Spark”, 2015 IEEE International Congress on Big Data
[7]. Alshimaa H. Ismail, Germien G. Sedhom, Zainab H. Ali, Enhanced Active Queue Management‑Based Green Cloud Model for 5G system using K-Means, Journal of International Journal of Wireless and Ad Hoc Communication, Vol. 6 , No. 2 , (2023) : 65-72 (Doi : https://doi.org/10.54216/IJWAC.060206)
[8] B. Venkateswarlu and G.S.V.Prasad Raju “Mine Blood Donors Information through Improved K-Means Clustering”, International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.3, 2320-8457, August 2013
[9] B. Venkateswarlu and G.S.V.Prasad Raju “Organ Donor Identification through Improved K- Medoids Clustering”, International journal of computer science and technology, volume 5, issue 3, 2229-4333, July – Sept 2014.
[10] Sarker IH (2022) Ai-based modeling: Techniques, applications and research issues towards automation, intelligent and smart systems. SN Computer Science 3(2):1–20
[11] Roy V. "An Improved Image Encryption Consuming Fusion Transmutation and Edge Operator." Journal of Cybersecurity and Information Management, Vol. 8, No. 1, 2021 ,PP. 42-52.Bonaccorso G (2017) Machine learning algorithms
[12] Sarker IH (2021) Data science and analytics: an overview from data-driven smart computing, decision-making and applications perspective. SN Computer Science 2(5):1–22
[13] Sarker IH, Colman A, Han J, Watters PA (2021) Context-aware machine learning and mobile data analytics: automated rule-based services with intelligent decision-making. Springer Nature, Switzerland
[14] V. Roy and S. Shukla, "A NLMS Based Approach for Artifacts Removal in Multichannel EEG Signals with ICA and Double Density Wavelet Transform," 2015 Fifth International Conference on Communication Systems and Network Technologies, 2015, pp. 461-466, doi: 10.1109/CSNT.2015.61.
[15] Rahim MdS, Ahmed T (2017) An initial centroid selection method based on radial and angular coordinates for k-means algorithm. In 2017 20th International Conference of Computer and Information Technology (ICCIT), 1–6. IEEE
[16] Kumar A, Gupta SC (2015) A new initial centroid finding method based on dissimilarity tree for k-means algorithm. arXiv preprint arXiv:1509.03200
[17] Mahmud MdS, Rahman MdM, Akhtar MdN (2012) Improvement of k-means clustering algorithm with better initial centroids based on weighted average. In 2012 7th International Conference on Electrical and Computer Engineering, 647–650. IEEE
[18] Abdelrahim Koura , Hany S. Elnashar, Data Mining Algorithms for Kidney Disease Stages Prediction, Journal of Cybersecurity and Information Management, Vol. 1 , No. 1 , (2020) : 21-29 (Doi : https://doi.org/10.54216/JCIM.010104)
[19] Lakshmi MA, Daniel GV, Rao DS (2019) Initial centroids for k-means using nearest neighbors and feature means. In Wang J, Reddy GRM, Prasad VK, Reddy VS (eds), Soft Computing and Signal Processing, 27–34, Singapore. Springer Singapore
[20] Sawant KB (2015) Efficient determination of clusters in k-mean algorithm using neighborhood distance. The International Journal of Emerging Engineering Research and Technology 3(1):22–27
[21] Motwani M, Arora N, Gupta A (2019) A study on initial centroids selection for partitional clustering algorithms. In Hoda MN, Chauhan N, Quadri SMK, Srivastava PR (eds), Software Engineering, pages 211–220, Singapore. Springer Singapore.
| Style | # |
|---|---|
| MLA | Anil Audumbar Pise , Ganesh Shivaji Pise, Saurabh Singh , Hemachandran K. , Jude Imuede, Sandip Shinde. "An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information." Journal of Cybersecurity and Information Management, Vol. 13, No. 1, 2024 ,PP. 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |
| APA | Anil Audumbar Pise , Ganesh Shivaji Pise, Saurabh Singh , Hemachandran K. , Jude Imuede, Sandip Shinde. (2024). An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information. Journal of Journal of Cybersecurity and Information Management, 13 ( 1 ), 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |
| Chicago | Anil Audumbar Pise , Ganesh Shivaji Pise, Saurabh Singh , Hemachandran K. , Jude Imuede, Sandip Shinde. "An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information." Journal of Journal of Cybersecurity and Information Management, 13 no. 1 (2024): 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |
| Harvard | Anil Audumbar Pise , Ganesh Shivaji Pise, Saurabh Singh , Hemachandran K. , Jude Imuede, Sandip Shinde. (2024). An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information. Journal of Journal of Cybersecurity and Information Management, 13 ( 1 ), 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |
| Vancouver | Anil Audumbar Pise , Ganesh Shivaji Pise, Saurabh Singh , Hemachandran K. , Jude Imuede, Sandip Shinde. An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information. Journal of Journal of Cybersecurity and Information Management, (2024); 13 ( 1 ): 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |
| IEEE | Anil Audumbar Pise, Ganesh Shivaji Pise, Saurabh Singh, Hemachandran K., Jude Imuede, Sandip Shinde, An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information, Journal of Journal of Cybersecurity and Information Management, Vol. 13 , No. 1 , (2024) : 08-16 (Doi : https://doi.org/10.54216/JCIM.130101) |