Clustered Partitioning
Clustered Partitioning is a data partitioning method that organizes data into disjoint subsets based on proximity or similarity metrics, such that entities within each subset exhibit higher internal cohesion compared to entities in other subsets.
35
Publications
2.2K
Citations
90
Authors
53
Institutions
Publications per year
2017–2026
9
Parents
35
Optimal algorithms for approximate clustering
Tomás Feder, Daniel Greene · 1988 · 419 citations · Full text
1–5 of 35
90
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 90
53
University of South Florida
Tampa, United States
2 h-index
6 publications
298 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
6 publications
296 citations
Florida State University
Tallahassee, United States
2 h-index
3 publications
224 citations
University of Missouri
Columbia, United States
2 h-index
2 publications
138 citations

Aarhus University
Aarhus, Denmark
1 h-index
1 publications
295 citations

Marquette University
Milwaukee, United States
1 h-index
1 publications
340 citations
The University of Texas at Austin
Austin, United States
1 h-index
1 publications
58 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
3 publications
120 citations
1–8 of 53
2 publications · 144 citations
2
h-index
2 publications · 127 citations
2
h-index
1 publications · 16 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 57 citations
1
h-index
1–5