• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/sadh/045/0066

    • Keywords

       

      Single-Linkage clustering; merging threshold; Leader algorithm; triangle inequality; large datasets.

    • Abstract

       

      Single-Linkage algorithm is a distance-based Hierarchical clustering method that can find arbitrary shaped clusters but is most unsuitable for large datasets because of its high time complexity. The paper proposes an efficient accelerated technique for the algorithm with a merging threshold. It is a two-stage algorithm with the first one as an incremental pre-clustering step that uses the triangle inequality method to eliminate the unnecessary distance computations. The incremental approach makes it suitable for partial clustering of streaming dataalong with the collection. The second step using the property of the Single-Linkage algorithm itself takes a clustering decision without comparing all the patterns. This method shows how the neighbourhood between the input patterns can be used as a tool to accelerate the algorithm without hampering the cluster quality. Experiments are conducted with various standard and large real datasets and the result confirms its effectiveness for large datasets.

    • Author Affiliations

       

      PAYEL BANERJEE1 AMLAN CHAKRABARTI2 TAPAS KUMAR BALLABH1

      1. Department of Physics, Jadavpur University, Kolkata, India
      2. Calcutta University, Kolkata, India
    • Dates

       
  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.