The Best-partitions Problem: How to Build Meaningful Aggregations ? - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2013

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

(1) , (2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
RR-LIG-044_orig.pdf (305.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00947934 , version 1 (18-02-2014)

Identifiers

  • HAL Id : hal-00947934 , version 1

Cite

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⟩
143 View
242 Download

Share

Gmail Facebook Twitter LinkedIn More