bordeaux20132014:bordeaux_edition

Instructors: Guy Melançon (email: `Guy dot Melancon at labri dot fr`

), Bruno Pinaud (email: `Bruno dot Pinaud at labri dot fr`

)

Have a look at the page describing the course organization: assignments, term projects and evaluation, *deadlines*, etc.

You are requested to work on a term project. You are expected to form a team with another colleague and select a project topic from a list.

Instructor: Bruno Pinaud

This first portion of the course is meant to introduce the topic of the course, motivate this still new research field although examples are there to indicate ideas go back to ancient times.

Have a look at the slides showed in the class.

It does include a comprehensive course on Tulip so students are able to work by themselves using the framework.

- InfoVis by examples
- Florence Nightingale, an example showing how visualization may be misleading …
- White house budget directly from the White House website
- Obama's 2012 Budget from the New-York Times website
- Visualization in action (using Tulip / directory import (tree layout, 2 1/2 D); poker players, cars dataset)

Instructor: Guy Melançon

The course looked closely at conditions that turn a map or an interface into an efficient communication channel. Three different dimensions come at play when designing an interface. We looked at examples, one really bad, another that left room for improvement.

**Assignment**: select a map, ideally interactive, and criticize it on the basis of the criterion we've discussed. Your comments should also suggest ways to repairs the deficiencies you have identified. Upload your comment on your personal space on the course wiki.

**Comments due by the end of week 40, that is Friday October 4, 6pm.**

—

We also went over a range of graph drawing algorithms:

- trees: why they are so useful, widely used, simple and efficient
- we went over a long comment on the use of hyperbolic geometry

- dags (directed acyclic graphs): the next step right after trees where nodes may have multiple parents (inheritance relations)
- planar graphs: this is a whole chapter that could be studied by itself over a 40 hour course; we only went over a simple planarity test involving a decomposition of graphs into
- connected components
- then biconnected components
- then grouping edges into classes
- then computing a graph to see whether it is bipartite (if so, the original graph is indeed planar)

- other graphs: we discussed the use, and potential complexity, of so-called spring embedder algorithms

Coming courses will go over some of these algorithms.

Instructor: Guy Melançon

High-dimensional data / Clustering

Instructor: Bruno Pinaud

Getting down on business with Tulip

Implementation of the CURE algorithm in Python under Tulip with the 2004 cars dataset. After importing the data in Tulip with the CSV import module, take 2 to 3 variables to build clusters (for instance, cars dimensions and weight). Then, try to explain the content of each cluster (powerful cars for large size cars? cars with a high autonomy for low size cars?). You should also use Tulip powerful graphical features to animate the building phase of the clusters. We should see the data-points moving when merging two clusters together.

Instructor: Bruno Pinaud

Graph Drawing: Sugiyama heuristics and introduction to drawing graphs with physical analogy. Slides showed during the lecture

See **Di-Battista, G.; Eades, P.; Tamassia, R. & Tollis, I.-G. Graph drawing – Algorithms for the visualization of graphs Prentice-Hall, 1999**
for a nice introduction to graph drawing.

Hierarchical graph drawing (also called Layered drawing)

See this paper for a complete overview.

Work continue on CURE

Course cancelled

Instructor: Bruno Pinaud

Multilevel graph navigation

Divide and conquer - drawing and manipulating graph hierarchies with Tulip We will use the following file to play with graph hierarchies infovis_clean.tlpx. The work to do is described in this document hierarchies.pdf.

Instructor: Guy Melançon

Graph clustering

Instructor: Bruno Pinaud

Let's continue to work on Multilevel graph navigation

Instructor: Guy Melançon

Text mining & Document visualization

Instructor: Bruno Pinaud

Project coaching

Instructor: Guy Melançon

Project coaching

Instructor: Guy Melançon and Bruno Pinaud

Project evaluation

/net/html/perso/melancon/Visual_Analytics_Course/data/pages/bordeaux20132014/bordeaux_edition.txt · Last modified: 2013/12/06 15:18 by bpinaud