Skip to Main content Skip to Navigation
Conference papers

K-partitioning with imprecise probabilistic edges

Abstract : Partitioning a set of elements into disjoint subsets is a common problem in unsupervised learning (clustering) as well as in networks (e.g., social, ecological) where one wants to find heterogeneous subgroups such that the elements within each subgroup are homogeneous. In this paper, we are concerned with the case where we imprecisely know the probability that two elements should belong to the same partition, and where we want to search the set of most probable partitions. We study the corresponding algorithmic problem on graphs, showing that it is difficult, and propose heuristic procedures that we test on data sets.
Document type :
Conference papers
Complete list of metadata
Contributor : Tom Davot Connect in order to contact the contributor
Submitted on : Thursday, May 12, 2022 - 10:52:45 AM
Last modification on : Friday, May 20, 2022 - 9:57:35 AM


Files produced by the author(s)


  • HAL Id : hal-03665950, version 1



Tom Davot, Sébastien Destercke, David Savourey. K-partitioning with imprecise probabilistic edges. 10th International Conference on Soft Methods in Probability and Statistics (SMPS 2022), May 2022, Valladolid, Spain. ⟨hal-03665950⟩



Record views


Files downloads