Skip to Main content Skip to Navigation
Conference papers

The Best-partitions Problem: How to Build Meaningful Aggregations

Robin Lamarche-Perrin 1 Yves Demazeau 2 Jean-Marc Vincent 3
LIG - Laboratoire d'Informatique de Grenoble [2007-2015]
3 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble [2007-2015]
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 agent-based model of international relations. The algorithm succeeds in providing meaningful high-level abstractions for the system analysis.
Complete list of metadatas
Contributor : Arnaud Legrand <>
Submitted on : Friday, December 13, 2013 - 3:27:44 PM
Last modification on : Wednesday, July 1, 2020 - 9:36:09 AM

Links full text




Robin Lamarche-Perrin, Yves Demazeau, Jean-Marc Vincent. The Best-partitions Problem: How to Build Meaningful Aggregations. IAT 2013 - IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Nov 2013, Atlanta, GA, United States. pp.399-404, ⟨10.1109/WI-IAT.2013.138⟩. ⟨hal-00918433⟩



Record views