  <?xml version="1.0"?>
<journal>
 <journal_metadata>
  <full_title>Journal of Cybersecurity and Information Management</full_title>
  <abbrev_title>JCIM</abbrev_title>
  <issn media_type="print">2690-6775</issn>
  <issn media_type="electronic">2769-7851</issn>
  <doi_data>
   <doi>10.54216/JCIM</doi>
   <resource>https://www.americaspg.com/journals/show/2324</resource>
  </doi_data>
 </journal_metadata>
 <journal_issue>
  <publication_date media_type="print">
   <year>2019</year>
  </publication_date>
  <publication_date media_type="online">
   <year>2019</year>
  </publication_date>
 </journal_issue>
 <journal_article publication_type="full_text">
  <titles>
   <title>An Improved K-Means Clustering Process Solicitation for Mine Blood Donors Information</title>
  </titles>
  <contributors>
   <organization sequence="first" contributor_role="author">University of the Witwatersrand Johannesburg, South Africa</organization>
   <person_name sequence="first" contributor_role="author">
    <given_name>Anil</given_name>
    <surname>Anil</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Assistant Professor in Pune Institute of Computer Technology Pune, India</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Ganesh Shivaji</given_name>
    <surname>Pise</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Assistant Professor, Department of AI and Big data, Woosong University, Daejeon, South Korea</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Saurabh</given_name>
    <surname>..</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Associate Engineer, TSYS Global Payments, Pune, India</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Hemachandran. </given_name>
    <surname>..</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">University of Prince Edward Island, Canada</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Jude</given_name>
    <surname>Imuede</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Department of Computer Engineering, Vishwakarma Institute of Technology, Pune, India</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Sandip</given_name>
    <surname>Shinde</surname>
   </person_name>
  </contributors>
  <jats:abstract xml:lang="en">
   <jats:p>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.</jats:p>
  </jats:abstract>
  <publication_date media_type="print">
   <year>2024</year>
  </publication_date>
  <publication_date media_type="online">
   <year>2024</year>
  </publication_date>
  <pages>
   <first_page>08</first_page>
   <last_page>16</last_page>
  </pages>
  <doi_data>
   <doi>10.54216/JCIM.130101</doi>
   <resource>https://www.americaspg.com/articleinfo/2/show/2324</resource>
  </doi_data>
 </journal_article>
</journal>
