Partial distortion entropy maximization for online data clustering

DOI10.1016/J.NEUNET.2007.04.029MaRDI QIDQ2383044zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

competitive learningnon-stationary probability distributionspartial distortion entropy maximizationpartial distortion theorem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

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

Cites work

• scientific article; zbMATH DE number 467196 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Asymptotically optimal block quantization
• Self-organization and associative memory

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)