Solving the Traffic and Flitter Challenges with Tulip

Paolo Simonetto (1, 2) , Pierre-Yves Koenig (1, 2) , Faraz Zaidi (1, 2) , Daniel Archambault (2) , Frédéric Gilbert (1, 2) , Trung Tien Phan Quang (1, 2) , Morgan Mathiaut (1, 2) , Antoine Lambert (1, 2) , Jonathan Dubois (1) , Ronan Sicre (1) , Mathieu Brulin (1) , Remi Vieux (1) , Guy Melançon (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 GRAVITE - Graph Visualization and Interactive Exploration

We present our visualization systems and findings for the Badge and Network Traffic as well as the Social Network and Geospatial challenges of the 2009 VAST contest. The summary starts by presenting an overview of our time series encoding of badge information and network traffic. Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints. Subsequently, we present our most likely candidate network which is similar to scenario B.

Domains: Information Retrieval [cs.IR]

Paolo Simonetto, Pierre-Yves Koenig, Faraz Zaidi, Daniel Archambault, Frédéric Gilbert, et al.. Solving the Traffic and Flitter Challenges with Tulip. IEEE Symposium on Visual Analytics Science and Technology 2009, Oct 2009, Atlantic City, New Jersey, USA, United States. pp.247-248. ⟨hal-00413602⟩