A novel fast heuristic to handle large-scale shape clustering

Abstract

Clustering algorithms like types of k-means are fast, but they are inefficient for shape clustering. There are some algorithms, which are effective, but their time complexities are too high. This paper proposes a novel heuristic to solve large-scale shape clustering. The proposed method is effective and it solves large-scale clustering problems in fraction of a second.

Keywords:

• clustering
• large-scale shape clustering
• automatic cluster number
• heuristics

Acknowledgements

The author gratefully acknowledge the helpful comments and suggestions of the associated editor and reviewers, which have improved the presentation.

Disclosure statement

No potential conflict of interest was reported by the author.

ORCID

Hassan Ismkhan http://orcid.org/0000-0002-8351-3770