Home
International Journal of Science and Research Archive
International, Peer reviewed, Open access Journal ISSN Approved Journal No. 2582-8185

Main navigation

  • Home
    • Journal Information
    • Abstracting and Indexing
    • Editorial Board Members
    • Reviewer Panel
    • Journal Policies
    • IJSRA CrossMark Policy
    • Publication Ethics
    • Issue in Progress
    • Current Issue
    • Past Issues
    • Instructions for Authors
    • Article processing fee
    • Track Manuscript Status
    • Get Publication Certificate
    • Become a Reviewer panel member
    • Join as Editorial Board Member
  • Contact us
  • Downloads

ISSN Approved Journal || eISSN: 2582-8185 || CODEN: IJSRO2 || Impact Factor 8.2 || Google Scholar and CrossRef Indexed

Peer Reviewed and Referred Journal || Free Certificate of Publication

Research and review articles are invited for publication in March 2026 (Volume 18, Issue 3) Submit manuscript

Initial centroid selection for K- means clustering algorithm using the statistical method

Breadcrumb

  • Home
  • Initial centroid selection for K- means clustering algorithm using the statistical method

N Sujatha 1, *, Latha Narayanan Valli 2, A Prema 1, SK Rathiha 3 and V Raja 3

1 Department of Computer Science, Sri Meenakshi Government Arts College for Women, Madurai, Tamil Nadu, India.
2 Standard Chartered Global Business Services Sdn Bhd, Kuala Lumpur, Malaysia.
3 Department of Physics, Government Arts College, Melur, Tamil Nadu, India.

Research Article
 
International Journal of Science and Research Archive, 2022, 07(02), 474-478
Article DOI: 10.30574/ijsra.2022.7.2.0309
DOI url: https://doi.org/10.30574/ijsra.2022.7.2.0309

Received on 07 November 2022; revised on 20 December 2022; accepted on 22 December 2022

An iterative process that converges to one of the many local minima is used in practical clustering methods. K-means clustering is one of the most well-liked clustering methods. It is well known that these iterative methods are very susceptible to the initial beginning circumstances. In order to improve K-means clustering's performance, this research suggests a novel method for choosing initial centroids. The suggested approach is evaluated with online access records, and the results demonstrate that better initial starting points and post-processing cluster refinement result in better solutions. 

Web data clustering; Web Usage Mining; K-means; Initial Centroids; Web access logs; Genetic Algorithm

https://ijsra.net/sites/default/files/fulltext_pdf/IJSRA-2022-0309.pdf

Preview Article PDF

N Sujatha, Latha Narayanan Valli, A Prema, SK Rathiha and V Raja. Initial centroid selection for K- means clustering algorithm using the statistical method. International Journal of Science and Research Archive, 2022, 07(02), 474-478. Article DOI: https://doi.org/10.30574/ijsra.2022.7.2.0309

Copyright © Author(s). All rights reserved. This article is published under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, sharing, adaptation, distribution, and reproduction in any medium or format, as long as appropriate credit is given to the original author(s) and source, a link to the license is provided, and any changes made are indicated.


All statements, opinions, and data contained in this publication are solely those of the individual author(s) and contributor(s). The journal, editors, reviewers, and publisher disclaim any responsibility or liability for the content, including accuracy, completeness, or any consequences arising from its use.

Get Certificates

Get Publication Certificate

Download LoA

Check Corssref DOI details

Issue details

Issue Cover Page

Editorial Board

Table of content

          

   

Copyright © 2026 International Journal of Science and Research Archive - All rights reserved

Developed & Designed by VS Infosolution