Visualizing a large collection of Open datasets: an experiment with proximity graphs

T. Liu (1) , D. Bangash Ahmed (1) , Fatma Bouali , Gilles Venturini (1)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours

We deal in this paper with the problem of creating an interactive and visual map for a large collection of Open datasets. We first describe how to define a representation space for such data, using text mining techniques to create features. Then, with a similarity measure between Open datasets, we use the K-nearest neighbors method for building a proximity graph between datasets. We use a force-directed layout method to visualize the graph (Tulip Software). We present the results with a collection of 300,000 datasets from the French Open data web site, in which the display of the graph is limited to 150,000 datasets. We study the discovered clusters and we show how they can be used to browse this large collection.

Domaines: Traitement des images [eess.IV]; Traitement du texte et du document; Vision par ordinateur et reconnaissance de formes [cs.CV]

T. Liu, D. Bangash Ahmed, Fatma Bouali, Gilles Venturini. Visualizing a large collection of Open datasets: an experiment with proximity graphs. Second International Workshop on Open Data, 2013, Paris, France. ⟨hal-01027485⟩