s-DRN: Stabilized Developmental Resonance Network

12/18/2019
by   In-Ug Yoon, et al.
0

Online incremental clustering of sequentially incoming data without prior knowledge suffers from changing cluster numbers and tends to fall into local extrema according to given data order. To overcome these limitations, we propose a stabilized developmental resonance network (s-DRN). First, we analyze the instability of the conventional choice function during the node activation process and design a scalable activation function to make clustering performance stable over all input data scales. Next, we devise three criteria for the node grouping algorithm: distance, intersection over union (IoU) and size criteria. The proposed node grouping algorithm effectively excludes unnecessary clusters from incrementally created clusters, diminishes the performance dependency on vigilance parameters and makes the clustering process robust. To verify the performance of the proposed s-DRN model, comparative studies are conducted on six real-world datasets whose statistical characteristics are distinctive. The comparative studies demonstrate the proposed s-DRN outperforms baselines in terms of stability and accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2020

Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes

A key issue in cluster analysis is the choice of an appropriate clusteri...
research
05/23/2023

DIVA: A Dirichlet Process Based Incremental Deep Clustering Algorithm via Variational Auto-Encoder

Generative model-based deep clustering frameworks excel in classifying c...
research
09/20/2021

A Novel Cluster Detection of COVID-19 Patients and Medical Disease Conditions Using Improved Evolutionary Clustering Algorithm Star

With the increasing number of samples, the manual clustering of COVID-19...
research
10/18/2019

Clustering by Optimizing the Average Silhouette Width

In this paper, we propose a unified clustering approach that can estimat...
research
10/09/2021

K-Splits: Improved K-Means Clustering Algorithm to Automatically Detect the Number of Clusters

This paper introduces k-splits, an improved hierarchical algorithm based...
research
09/07/2022

Grouping-matrix based Graph Pooling with Adaptive Number of Clusters

Graph pooling is a crucial operation for encoding hierarchical structure...
research
08/30/2019

Optimal Legislative County Clustering in North Carolina

North Carolina's constitution requires that state legislative districts ...

Please sign up or login with your details

Forgot password? Click here to reset