Skip to Main content Skip to Navigation

The Best-partitions Problem: How to Build Meaningful Aggregations ?

Robin Lamarche-Perrin 1 Yves Demazeau 2 Jean-Marc Vincent 3, *
* Corresponding author
LIG - Laboratoire d'Informatique de Grenoble
3 MESCAL - Middleware efficiently scalable
LIG - Laboratoire d'Informatique de Grenoble, Inria Grenoble - Rhône-Alpes
Abstract : The design and the debugging of large distributed AI systems require abstraction tools to build tractable macroscopic descriptions. Data aggregation can provide such abstractions by partitioning the systems dimensions into aggregated pieces of information. This process leads to information losses, so the partitions should be chosen with the greatest caution, but in an acceptable computational time. While the number of possible partitions grows exponentially with the size of the system, we propose an algorithm that exploits exogenous constraints regarding the system semantics to find best partitions in a linear or polynomial time. We detail two constrained sets of partitions that are respectively applied to temporal and spatial aggregation of an agentbased model of international relations. The algorithm succeeds in providing meaningful high-level abstractions for the system analysis.
Document type :
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Sylvie Pesty Connect in order to contact the contributor
Submitted on : Tuesday, February 18, 2014 - 4:46:55 PM
Last modification on : Thursday, December 9, 2021 - 3:08:05 PM
Long-term archiving on: : Sunday, May 18, 2014 - 11:01:59 AM


Files produced by the author(s)


  • HAL Id : hal-00947934, version 1



Robin Lamarche-Perrin, Yves Demazeau, Jean-Marc Vincent. The Best-partitions Problem: How to Build Meaningful Aggregations ?. [Research Report] RR-LIG-044, 2013, pp.18. ⟨hal-00947934⟩



Les métriques sont temporairement indisponibles