Characterization of fuzzy clustering algorithms in terms of entropy of probabilistic sets

DOI10.1016/0167-8655(84)90027-8MaRDI QIDQ3680091zbMATH OpenOpenAlexFDO

Authors Kaoru Hirota, Witold Pedrycz

Publication date 1984

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(84)90027-8

zbMATH Keywords

entropyfuzzy clustering algorithmsMembership functionsprobabilistic sets

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• scientific article; zbMATH DE number 3903994
• Subjective Entropy of Probabilistic Sets and Fuzzy Cluster Analysis
• scientific article; zbMATH DE number 4080654
• scientific article; zbMATH DE number 4064533
• scientific article; zbMATH DE number 4043079

Cited in

(7)

• Rough set-based clustering with refinement using Shannon's entropy theory
• Fuzzy sets of higher type and higher order in fuzzy modeling
• scientific article; zbMATH DE number 3903994 (Why is no real title available?)
• Subjective Entropy of Probabilistic Sets and Fuzzy Cluster Analysis
• scientific article; zbMATH DE number 4080654 (Why is no real title available?)
• scientific article; zbMATH DE number 5034475 (Why is no real title available?)
• Deterministic annealing approach to fuzzy \(c\)-means clustering based on entropy maximization

This page was built for publication: Characterization of fuzzy clustering algorithms in terms of entropy of probabilistic sets

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