20226th International Workshop on Advanced Algorithms and Control Engineering (IWAACE 2022)Requires access

A hybrid clustering method based on k-means algorithm

Hongwei Chen

Open publisher page 2 citations

Abstract

We propose a novel hybrid algorithm that effectively combines K-means clustering and hierarchical and uses triangle inequality to accelerate the clustering speed. The HTK clustering algorithm can produce the same results as the standard K-means clustering algorithm. The proposed algorithm is superior to the standard K-means clustering algorithm in terms of running time and memory usage, thus improving the clustering speed and time complexity of the algorithm. The proposed clustering methods are tested on sci-kit learn datasets, and they are more favorable than the random restart K-means algorithm.

About this research paper

What this paper is about

We propose a novel hybrid algorithm that effectively combines K-means clustering and hierarchical and uses triangle inequality to accelerate the clustering speed. The HTK clustering algorithm can produce the same results as the standard K-means clustering algorithm. The proposed algorithm is superior to the standard K-means clustering algorithm in terms of running time and memory usage, thus improving the clustering speed and time complexity of the algorithm. The proposed clustering methods are tested on sci-kit learn datasets, and they are more favorable than the random restart K-means algorithm.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We propose a novel hybrid algorithm that effectively combines K-means clustering and hierarchical and uses triangle inequality to accelerate the clustering speed. The HTK clustering algorithm can produce the same results as the standard K-means clustering algorithm. The proposed algorithm is superior to the standard K-means clustering algorithm in terms of running time and memory usage, thus improving the clustering speed and time complexity of the algorithm. The proposed clustering methods are tested on sci-kit learn datasets, and they are more favorable than the random restart K-means algorithm.

Key concepts: Cluster analysis, Canopy clustering algorithm, CURE data clustering algorithm, Correlation clustering, Computer science, Data stream clustering, Algorithm, Single-linkage clustering

Related papers

Back to paper searchBrowse research topicsOriginal source
A hybrid clustering method based on k-means algorithm — Research Paper | ScholarLens