A novel fast heuristic to handle large-scale shape clustering. Issue 1 (2nd January 2016)

• Record Type: Journal Article
• Authors: Ismkhan, Hassan
• Is Part Of: Journal of statistical computation and simulation. Volume 86:Issue 1(2016)
• Page Start: 160
• Page End: 169
• Publication Date: 2016-01-02
• Subjects: clustering -- large-scale shape clustering -- automatic cluster number -- heuristics; Mathematical statistics -- Data processing -- Periodicals; Digital computer simulation -- Periodicals; 519.5028505
• DOI: 10.1080/00949655.2014.1000900
• Languages: English
• ISSNs: 0094-9655

Abstract

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.