Finite Set Partitioning
Finite Set Partitioning is a mathematical construct that belongs to the class of set-theoretic operations, specifically denoting the division of a finite set into a collection of non-overlapping (disjoint) non-empty subsets such that every element of the original set is included in exactly one subset, thereby forming a complete and exclusive decomposition of the set.
46
Publications
2.3K
Citations
85
Authors
55
Institutions
Publications per year
2017–2026
2
Parents
46
Comparing Fuzzy, Probabilistic, and Possibilistic Partitions
Derek T. Anderson, James C. Bezdek, Mihail Popescu et al. · IEEE Transactions on Fuzzy Systems · 2010 · 127 citations
1–5 of 46
85
HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung, Germany
3 publications · 55 citations
3
h-index
3
h-index
2
h-index
Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
2 publications · 25 citations
2
h-index
2
h-index
1–5 of 85
55
University of California San Diego
San Diego, United States
2 h-index
2 publications
205 citations
University of Washington
Seattle, United States
2 h-index
2 publications
222 citations

University of Toronto
Toronto, Canada
2 h-index
4 publications
58 citations
University of Massachusetts Boston
Boston, United States
2 h-index
3 publications
55 citations
University of Lisbon
Lisbon, Portugal
2 h-index
3 publications
80 citations

Georgian Technical University
Tbilisi, Georgia
2 h-index
2 publications
44 citations
University of Pittsburgh
Pittsburgh, United States
2 h-index
3 publications
387 citations

University of St Andrews
St Andrews, United Kingdom
2 h-index
2 publications
54 citations
1–8 of 55
4 publications · 869 citations
4
h-index
2 publications · 30 citations
2
h-index
2 publications · 63 citations
2
h-index
2 publications · 74 citations
2
h-index
2 publications · 105 citations
2
h-index
1–5