Partial distortion entropy maximization for online data clustering

DOI10.1016/J.NEUNET.2007.04.029zbMATH Open1124.68098OpenAlexW2044230108WikidataQ31121029 ScholiaQ31121029MaRDI QIDQ2383044FDOQ2383044

Authors: Hiroyuki Takizawa, Hiroaki Kobayashi 

Publication date: 5 October 2007

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

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

Recommendations

• An incremental network for on-line unsupervised classification and topology learning
• scientific article; zbMATH DE number 503287
• A competitive and dynamic cooperative learning algorithm
• scientific article; zbMATH DE number 2033165
• scientific article; zbMATH DE number 1569111

zbMATH Keywords

competitive learningnon-stationary probability distributionspartial distortion entropy maximizationpartial distortion theorem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Self-organization and associative memory
• Asymptotically optimal block quantization
• Title not available (Why is that?)

Cited In (1)

• Research on splitting-merging competitive learning

This page was built for publication: Partial distortion entropy maximization for online data clustering

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