User Tools

Site Tools


bordeaux:bordeaux_edition

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
bordeaux:bordeaux_edition [2012/10/04 11:11]
melancon [Friday, September 28 (week 39) CREMI]
bordeaux:bordeaux_edition [2012/11/26 10:51] (current)
melancon
Line 86: Line 86:
 Graph drawing basics Graph drawing basics
  
-Hierarchical graph drawing+Have a look at {{:​GD1.pdf|the slides I showed}} in the class. 
 + 
 +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 [[http://​citeseerx.ist.psu.edu/​viewdoc/​summary?​doi=10.1.1.17.8724| this paper]] for a complete overview.
  
 Getting serious with [[:​visual_analytics_with_tulip|Tulip]] Getting serious with [[:​visual_analytics_with_tulip|Tulip]]
Line 101: Line 108:
 Instructor: Bruno Pinaud Instructor: Bruno Pinaud
  
-Drawing more complicated graphs+Working session on the homework #2.
  
 === Friday, October 19 (week 42) === === Friday, October 19 (week 42) ===
 Instructor: Guy Melançon Instructor: Guy Melançon
  
-"​Drawing multi-dimensional datasets"​+"​Drawing multi-dimensional datasets"​. The course covered all material of the [[:​high-dimensional_data|High-dimensional datasets]]. Parts of the course were left as exercises, mainly to implement the PCA and MDS algorithms we discussed. The Cars dataset was used to illustrate the ideas and algorithms. 
 + 
 +Code is now available from the [[:​pca|PCA]] and [[:​mds|MDS]] sections (see the exercises subsections).
  
 === Friday, October 26 (week 43) === === Friday, October 26 (week 43) ===
Line 112: Line 121:
  
 Downsizing data, cutting networks into pieces - part I Downsizing data, cutting networks into pieces - part I
 +
 +The course will cover the [[:​clustering_aggregation|Huygens Ward theorem, the K-means and CURE algorithms]]. Most of your time shall be devoted to implementing the CURE algorithm and track for the best clustering of the Cars dataset.
 +
 +Code is now available from the [[:​k-means|k-Means algorithm]].
  
 === Friday, November 9 (week 45) === === Friday, November 9 (week 45) ===
Line 117: Line 130:
  
 Divide and conquer - drawing and manipulating graph hierarchies with Tulip Divide and conquer - drawing and manipulating graph hierarchies with Tulip
 +We will use the following file to play with graph hierarchies {{:​bordeaux:​infovis_clean.tlpx|}}. The work to do is described in this document {{:​bordeaux:​hierarchies.pdf|}}.
  
 === Friday, November 16 (week 46) === === Friday, November 16 (week 46) ===
Line 130: Line 144:
 === Friday, November 30 (week 48) === === Friday, November 30 (week 48) ===
 Instructors:​ Bruno Pinaud Instructors:​ Bruno Pinaud
 +
 +Take a dataset from [[http://​snap.stanford.edu/​data/​index.html|http://​snap.stanford.edu/​data/​index.html]]
 +or [[http://​www.kaggle.com/​|Kaggle]] ($$$ :-) ) or the [[http://​hcil.cs.umd.edu/​localphp/​hcil/​vast/​archive/​index.php|Visual Analytics Benchmark Repository]].
  
 Term project - I Term project - I
  
 === Friday, December 7 (week 49) === === Friday, December 7 (week 49) ===
-Instructor: ​Bruno Pinaud+Instructor: ​Guy Melançon
  
 Term project - II Term project - II
  
 === Friday, December 14 (week 50) === === Friday, December 14 (week 50) ===
-Instructor: ​Guy Melançon+Instructor: ​Bruno Pinaud
  
 Term project - III Term project - III
/net/html/perso/melancon/Visual_Analytics_Course/data/attic/bordeaux/bordeaux_edition.1349341868.txt.gz · Last modified: 2012/10/04 11:11 by melancon