Skip to content
RDL
Network
Ekosistem
Uygulama değiştir
EN
Hakkımızda
SSS
Giriş yap
Başla
Characterization of fuzzy clustering algorithms in terms of entropy of probabilistic sets — Kaoru Hirota (1984) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Characterization of fuzzy clustering algorithms in terms of entropy of probabilistic sets
Shared by
Witold Pedrycz
University of Alberta
Characterization of fuzzy clustering algorithms in terms of entropy of probabilistic sets
Article
1984
en
Authors
KH
Kaoru Hirota
Witold Pedrycz
University of Alberta
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Article
1986
Subjective Entropy of Probabilistic Sets and Fuzzy Cluster Analysis
Kaoru Hirota
,
Witold Pedrycz
Article
2011
Shadowed sets in the characterization of rough-fuzzy clustering
Jie Zhou
,
Witold Pedrycz
,
Duoqian Miao
Article
1981
Fuzzy-Probabilistic Algorithms in Identification of Fuzzy Systems
Witold Pedrycz
,
Kaoru Hirota
Article
1982
Fuzzy system identification via probabilistic sets
Kaoru Hirota
,
Witold Pedrycz
Article
1985
Algorithms of fuzzy clustering with partial supervision
Witold Pedrycz
Discussion(0)
No comments yet. Be the first to comment.