Approximate kernel competitive learning
type: Item
instance of: scholarly article
title: Approximate kernel competitive learning
zbMATH Open document ID: 1325.68203
author: J. S. Wu
author: Wei-Shi Zheng
author: James Lai
published in: Neural Networks
publication date: 2015-11-06T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6505513
zbMATH Keywords: kernel clustering
zbMATH Keywords: kernel competitive learning
zbMATH Keywords: large scale computation
describes a project that uses: Graclus
describes a project that uses: ImageNet
describes a project that uses: clusfind
describes a project that uses: Caltech-256
MaRDI profile type: Publication
Wikidata QID: Q41664321
full work available at URL: j.neunet.2014.11.003
OpenAlex ID: W2082778978
cites work: Batch and median neural gas
cites work: Cure: An efficient clustering algorithm for large databases
cites work: KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
cites work: Q5617409
cites work: Q3093255
DOI: 10.1016/J.NEUNET.2014.11.003
Recommended article: Approximate kernel partial least squares
Recommended article: Cooperative and penalized competitive learning with application to kernel-based clustering
Recommended article: Optimal learning rates for kernel partial least squares
Recommended article: KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
Recommended article: Q3093219
Recommended article: Approximate Minimization of the Regularized Expected Error over Kernel Models
Recommended article: Q3093181
description: scientific article; zbMATH DE number 6505513