Incremental estimation of low-density separating hyperplanes for clustering large data sets

Hofmeyr, David P. (2023) Incremental estimation of low-density separating hyperplanes for clustering large data sets. Pattern Recognition, 139: 109471. ISSN 0031-3203

Full text not available from this repository.

Abstract

An efficient unsupervised method for obtaining low-density hyperplane separators is proposed. The method is based on a modified stochastic gradient descent applied on a convolution of the empirical distribution function with a smoothing kernel. Low-density hyperplanes are motivated by the fact that they avoid intersecting high density regions, and so tend to pass between high density clusters, thus separating them from one another, while keeping the individual clusters intact. Multiple hyperplanes can be combined in a hierarchical model to obtain a complete clustering solution. A simple post-processing of solutions induced by large collections of hyperplanes yields an efficient and accurate clustering method, capable of automatically selecting the number of clusters. Experiments show that the proposed method is highly competitive in terms of both speed and accuracy when compared with relevant benchmarks. Code is available in the form of an R package at https://github.com/DavidHofmeyr/iMDH

Item Type:
Journal Article
Journal or Publication Title:
Pattern Recognition
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1702
Subjects:
?? artificial intelligencesignal processingsoftwarecomputer vision and pattern recognition ??
ID Code:
223832
Deposited By:
Deposited On:
09 Sep 2024 10:05
Refereed?:
Yes
Published?:
Published
Last Modified:
10 Sep 2024 02:35