IDEAS home Printed from https://ideas.repec.org/a/ids/injdan/v13y2021i1-2p3-14.html
   My bibliography  Save this article

Efficient data clustering algorithm designed using a heuristic approach

Author

Listed:
  • Poonam Nandal
  • Deepa Bura
  • Meeta Singh

Abstract

Information retrieval from a large amount of information available in a database is a major issue these days. The relevant information extraction from the voluminous information available on the web is being done using various techniques like natural language processing, lexical analysis, clustering, categorisation, etc. In this paper, we have discussed the clustering methods used for clustering of large amount of data using different features to classify the data. In today's era, various problem solving techniques makes the use of a heuristic approach for designing and developing various efficient algorithms. In this paper, we have proposed a clustering technique using a heuristic function to select the centroid so that the clusters formed are as per the need of the user. The heuristic function designed in this paper is based on the conceptually similar data points so that they are grouped into accurate clusters. k-means clustering algorithm is majorly used to cluster the data which is also focussed in this paper. It has been empirically found that the clusters formed and the data points which belong to a cluster are close to human analysis as compared to existing clustering algorithms.

Suggested Citation

  • Poonam Nandal & Deepa Bura & Meeta Singh, 2021. "Efficient data clustering algorithm designed using a heuristic approach," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 13(1/2), pages 3-14.
  • Handle: RePEc:ids:injdan:v:13:y:2021:i:1/2:p:3-14
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=114666
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:injdan:v:13:y:2021:i:1/2:p:3-14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=282 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.