Approximate kernel competitive learning

DOI10.1016/J.NEUNET.2014.11.003zbMATH Open1325.68203OpenAlexW2082778978WikidataQ41664321 ScholiaQ41664321MaRDI QIDQ889389FDOQ889389

Authors: J. S. Wu, Wei-Shi Zheng, James Lai 

Publication date: 6 November 2015

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2014.11.003

Recommendations

• Approximate kernel partial least squares
• Cooperative and penalized competitive learning with application to kernel-based clustering
• Optimal learning rates for kernel partial least squares
• KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
• Knowledge-based kernel approximation
• Approximate minimization of the regularized expected error over kernel models
• Learning the kernel matrix with semidefinite programming

zbMATH Keywords

kernel clusteringkernel competitive learninglarge scale computation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Cure: An efficient clustering algorithm for large databases
• Core vector machines: fast SVM training on very large data sets
• Batch and median neural gas
• KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS

Cited In (1)

• Cooperative and penalized competitive learning with application to kernel-based clustering

Uses Software

• ImageNet
• clusfind
• Caltech-256
• Graclus

This page was built for publication: Approximate kernel competitive learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889389)