IDEAS home Printed from https://ideas.repec.org/a/igg/jismd0/v10y2019i1p42-59.html
   My bibliography  Save this article

Adaptive Threshold Based Clustering: A Deterministic Partitioning Approach

Author

Listed:
  • Mamta Mittal

    (Department of Computer Science and Engineering, G. B. Pant Govt. Engineering College, New Delhi, India)

  • Rajendra Kumar Sharma

    (Thapar University, Patiala, India)

  • Varinder Pal Singh

    (Thapar University, Patiala, India)

  • Raghvendra Kumar

    (Department of Computer Science and Engineering, LNCT College, Indore, India)

Abstract

Partitioning-based clustering methods have various challenges especially user-defined parameters and sensitivity to initial seed selections. K-means is most popular partitioning based method while it is sensitive to outlier, generate non-overlap cluster and non-deterministic in nature due to its sensitivity to initial seed selection. These limitations are regarded as promising research directions. In this study, a deterministic approach which do not requires user defined parameters during clustering; can generate overlapped and non-overlapped clusters and detect outliers has been proposed. Here, a minimum support value has been adopted from association rule mining to improve the clustering results. Further, the improved approach has been analysed on artificial and real datasets. The results demonstrated that datasets are well clustered with this approach too and it achieved success to generate almost same number of clusters as present in real datasets.

Suggested Citation

  • Mamta Mittal & Rajendra Kumar Sharma & Varinder Pal Singh & Raghvendra Kumar, 2019. "Adaptive Threshold Based Clustering: A Deterministic Partitioning Approach," International Journal of Information System Modeling and Design (IJISMD), IGI Global, vol. 10(1), pages 42-59, January.
    • Handle: RePEc:igg:jismd0:v:10:y:2019:i:1:p:42-59
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISMD.2019010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jismd0:v:10:y:2019:i:1:p:42-59. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.