Skip to main content

Improvement of Incremental Hierarchical Clustering Algorithm by Re-insertion

  • Chapter
  • First Online:
Book cover Computational Science/Intelligence and Applied Informatics (CSII 2019)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 848))

Abstract

Clustering is employed in various fields for analysis and classification. However, the conventional clustering method does not consider changing data. Therefore, in case of change in data, the entire dataset must be re-clustered. A clustering method has been proposed to update the clustering result obtained by a hierarchical clustering method without re-clustering when a point is inserted by using the center and the radius of a cluster. This paper improves this incremental clustering method. By examining the cluster multimodality which is the property of a cluster having several modes, we can select some points of a different distribution inferred from a dendrogram, and transfer the points in the cluster to a different cluster. In addition, when the number of clusters increases, data points previously inserted are updated by re-insertion. Compared with the conventional method, the experimental results demonstrate that the execution time of the proposed method is significantly less and clustering accuracy is comparable for some data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal, D., Das, S., El Abbadi, A.: Big data and cloud computing: current state and future opportunities (2011).https://doi.org/10.1145/1951365.1951432

  2. Can, F.: Incremental clustering for dynamic information processing. ACM Trans. Inf. Syst. 11(2), 143–164 (1993). https://doi.org/10.1145/130226.134466

    Article  Google Scholar 

  3. Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM J. Comput. 33(6), 1417–1440 (2004). https://doi.org/10.1137/S0097539702418498

    Article  MathSciNet  Google Scholar 

  4. Ester, M., Kriegel, H.P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proceedings of the 24th International Conference on Very Large Data Bases, VLDB ’98, pp. 323–333. San Francisco, CA, USA (1998). http://dl.acm.org/citation.cfm?id=645924.671201

  5. Gubbi, J., Buyya, R., Marusic, S., Palaniswami, M.: Internet of things (IoT): a vision, architectural elements, and future directions. Future Gener. Comput. Syst. 29(7), 1645–1660 (2013). https://doi.org/10.1016/j.future.2013.01.010, http://www.sciencedirect.com/science/article/pii/S0167739X13000241

    Article  Google Scholar 

  6. Gupta, N., Ujjwal, R.L.: An efficient incremental clustering algorithm. World Comput. Sci. Inf. Technol. J. 3(5), 97–99 (2013)

    Google Scholar 

  7. Gurrutxaga, I., Arbelaitz, O., Ignacio Martín, J., Muguerza, J., Pérez, J., Perona, I.: Sihc: a stable incremental hierarchical clustering algorithm, pp. 300–304 (2009)

    Google Scholar 

  8. Hartigan, J.A., Hartigan, P.M.: The dip test of unimodality. Ann. Statist. 13(1), 70–84 (1985).https://doi.org/10.1214/aos/1176346577

    Article  MathSciNet  Google Scholar 

  9. He, W., Xu, L.: A state-of-the-art survey of cloud manufacturing. Int. J. Comput. Integr. Manuf. 28(3), 239–250 (2015). https://doi.org/10.1080/0951192X.2013.874595

    Article  Google Scholar 

  10. Ward Jr., J.H.: Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc. 58(301), 236–244 (1963). https://doi.org/10.1080/01621459.1963.10500845

    Article  MathSciNet  Google Scholar 

  11. Lee, I., Lee, K.: The internet of things (IoT): applications, investments, and challenges for enterprises. Bus. Horiz. 58(4), 431–440 (2015). https://doi.org/10.1016/j.bushor.2015.03.008, http://www.sciencedirect.com/science/article/pii/S0007681315000373

    Article  Google Scholar 

  12. Marsland, S.: Machine Learning: An Algorithmic Perspective, 1st edn. Chapman & Hall/CRC (2009)

    Google Scholar 

  13. Narita, K., Hochin, T., Nomiya, H.: Incremental clustering for hierarchical clustering. In: Proceedings of 5th International Conference on Computational Science/Intelligence and Applied Informatics (CSII 2018), pp. 102–107 (2018). https://doi.org/10.1109/CSII.2018.00025

  14. Ribert, A., Ennaji, A., Lecourtier, Y.: An incremental hierarchical clustering. In: Proceedings of 1999 Vision Interface Conference, pp. 586–591 (1999)

    Google Scholar 

  15. Zumel, N., Mount, J.: Practical data science with R. Manning (2014)

    Google Scholar 

Download references

Acknowledgements

We are deeply grateful to Mr. Masakazu Ishihara from NITTO SEIKO CO., LTD., who provided us valuable data and discussed them eagerly.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kakeru Narita .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Narita, K., Hochin, T., Hayashi, Y., Nomiya, H. (2020). Improvement of Incremental Hierarchical Clustering Algorithm by Re-insertion. In: Lee, R. (eds) Computational Science/Intelligence and Applied Informatics. CSII 2019. Studies in Computational Intelligence, vol 848. Springer, Cham. https://doi.org/10.1007/978-3-030-25225-0_8

Download citation

Publish with us

Policies and ethics