2020
DOI: 10.1016/j.neunet.2019.08.033
|View full text |Cite
|
Sign up to set email alerts
|

Distributed dual vigilance fuzzy adaptive resonance theory learns online, retrieves arbitrarily-shaped clusters, and mitigates order dependence

Abstract: This paper presents a novel adaptive resonance theory (ART)-based modular architecture for unsupervised learning, namely the distributed dual vigilance fuzzy ART (DDVFA). DDVFA consists of a global ART system whose nodes are local fuzzy ART modules. It is equipped with the distinctive features of distributed higher-order activation and match functions, using dual vigilance parameters responsible for cluster similarity and data quantization. Together, these allow DDVFA to perform unsupervised modularization, cr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(28 citation statements)
references
References 109 publications
0
28
0
Order By: Relevance
“…In general, ART-based clustering algorithms show superior clustering performance than GNG-based and SOINN-based algorithms [11], [12]. Moreover, because ART-based clustering algorithms can theoretically realize sequential and class-incremental learning without catastrophic forgetting, a number of ART-based clustering algorithms and their improvements have been proposed in both supervised learning [22]- [24] and unsupervised learning [7], [8], [25], [26]. One common drawback of ART-based clustering algorithms that they need to specify a similarity threshold (i.e., a vigilance parameter).…”
Section: Literature Review a Clustering Algorithms Capable Of Continu...mentioning
confidence: 99%
See 2 more Smart Citations
“…In general, ART-based clustering algorithms show superior clustering performance than GNG-based and SOINN-based algorithms [11], [12]. Moreover, because ART-based clustering algorithms can theoretically realize sequential and class-incremental learning without catastrophic forgetting, a number of ART-based clustering algorithms and their improvements have been proposed in both supervised learning [22]- [24] and unsupervised learning [7], [8], [25], [26]. One common drawback of ART-based clustering algorithms that they need to specify a similarity threshold (i.e., a vigilance parameter).…”
Section: Literature Review a Clustering Algorithms Capable Of Continu...mentioning
confidence: 99%
“…One promising approach for avoiding the plasticitystability dilemma is an ART-based algorithm that uses a pre-defined similarity threshold (i.e., a vigilance parameter) for controlling a learning process. Thanks to this property, many ART-based clustering algorithms and their improvements have been proposed [9], [14], [15], [23]. In particular, algorithms that use CIM as a similarity measure have shown superior clustering performance to other clustering algorithms [11], [24], [25], [26].…”
Section: Growing Self-organizing Clustering Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…Here I summarize key stages of the fuzzy ART algorithm [32,40] implemented within each module. The input to each module was complement coded…”
Section: Fuzzy Art Modulesmentioning
confidence: 99%
“…ARTree [52,53] is a hierarchical network that differs most substantially from ARTFLOW in its coarse-to-fine structure: a single fuzzy ART network processes each data sample in the first layer, and the number of modules increases with each successive layer. Distributed dual-vigilance fuzzy ART (DDVFA) contains sets of modules that process information globally and locally at the same hierarchical level [40]. Other approaches [54,55] successively pass the entire output of a fuzzy ART network as features to another fuzzy ART network.…”
Section: Comparison To Other Modelsmentioning
confidence: 99%