Graph Aggregation: Application to Social Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Revue des Nouvelles Technologies de l'Information Year : 2013

Graph Aggregation: Application to Social Networks

Abstract

In the enterprise context, people need to exploit and mainly visualize different types of interactions between heterogeneous objects. Graph model seems to be the most appropriate way to represent those interactions. However, the extracted graphs have in general a huge size which makes it difficult to analyze and visualize. An aggregation step is needed to have more understandable graphs in order to allow users discovering underlying information and hidden relationships between entities. In this work, we propose new measures to evaluate the quality of summaries based on an existing algorithm named k-SNAP that produces a summarized graph according to user-selected node attributes and relationships.
Not file

Dates and versions

hal-00838649 , version 1 (26-06-2013)

Identifiers

  • HAL Id : hal-00838649 , version 1

Cite

Amine Louati, Marie-Aude Aufaure, Yves Lechevallier. Graph Aggregation: Application to Social Networks. Rong Guan and Yves Lechevallier and Gilbert Saporta and Huiwen Wang. Advances in Theory and Applications of High Dimensional and Symbolic Data Analysis, RNTI-E-25, Hermann, pp.157-177, 2013, Revue des Nouvelles Technologies de l'Information, 9782705687335. ⟨hal-00838649⟩
300 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More