%0 Conference Paper %F Oral %T A New Methodology for Collecting and Exploiting Vast Amounts of Dynamic Data %+ Centre d'études et de recherches de science administrative (CERSA) %+ TECHnologies pour la Coopération, l’Interaction et les COnnaissances dans les collectifs (Tech-CICO) %+ Nekoé %+ Centre de Recherche en Sciences et Technologies de l'Information et de la Communication - EA 3804 (CRESTIC) %+ Sciences, Normes, Démocratie (SND) %+ Université Paris-Sud - Paris 11 (UP11) %A Legrand, Jacky %A Soulier, Eddie %A Bugeaud, Florie %A Rousseaux, Francis %A Saurel, Pierre %A Neffati, Houda %< avec comité de lecture %B 2012 Third International Conference on Emerging Intelligent Data and Web Technologies (EIDWT 2012) %C Bucharest, Romania %I IEEE %P 81-88 %8 2012-09-19 %D 2012 %R 10.1109/EIDWT.2012.37 %K Ontologies %K Topology %K Abstracts %K Humans %K Mathematical model %K Social network services %K Finite element methods %Z Computer Science [cs]/Web %Z Computer Science [cs]/Data Structures and Algorithms [cs.DS] %Z Computer Science [cs]/Modeling and SimulationConference papers %X The current approaches aiming at collective intelligence modelling often rely on traditional methods (ontologies, graphs). Even if those traditional methods may have reached their limitations in front of demanding emerging practices, the major conceptual tools enrolled for current and future Web are deeply rooted in the information storage and retrieval practices. The focus is on developing more original technologies for capturing, analyzing, exploiting and visualizing data. The age cements/arrangements provide the appropriate epistemological context of our contribution. The simplicial complexes are the mathematical support of the methodology. The result is a shift from networks studied towards graph theory to higher dimensional networks structures. The representation is more than graphs, or even hyper graphs. A geometric perspective shows the arrangement as assembling polyhedra of all sizes. Their contacts can form chains of adjacencies. It does not only generalize the notion of path graphs but it also makes available a range of quantitative and qualitative tools on the structure. Thus, separate parts, which can be more or less strongly linked, length of paths to traverse, and even loops or "missing parts", are meaningful metadata representations. %G English %L hal-02537237 %U https://utt.hal.science/hal-02537237 %~ CNRS %~ UNIV-PSUD %~ URCA %~ UNIV-TROYES %~ TDS-MACS %~ UNIV-PARIS-SACLAY %~ UNIV-PSUD-SACLAY %~ CRESTIC %~ SORBONNE-UNIVERSITE %~ SU-INF-2018 %~ SU-LETTRES %~ UMR-8011 %~ UTT %~ UTT-LIST3N %~ ALLIANCE-SU %~ TECH-CICO %~ PANTHEON-ASSAS-UNIVERSITE %~ UNIV-PARIS2