Trace:

bordeaux20142015:bordeaux_edition

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

Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||

bordeaux20142015:bordeaux_edition [2014/10/09 14:46] melancon [Friday, October 3 (week 40, Guy Melançon)] |
bordeaux20142015:bordeaux_edition [2014/12/09 11:13] bpinaud [Friday, December 12 (week 50, Guy Melançon)] |
||
---|---|---|---|

Line 3: | Line 3: | ||

Instructors: [[http://www.labri.fr/perso/melancon|Guy Melançon]] (email: ''Guy dot Melancon at labri dot fr''), [[http://www.labri.fr/perso/bpinaud|Bruno Pinaud]] (email: ''Bruno dot Pinaud at labri dot fr'') | Instructors: [[http://www.labri.fr/perso/melancon|Guy Melançon]] (email: ''Guy dot Melancon at labri dot fr''), [[http://www.labri.fr/perso/bpinaud|Bruno Pinaud]] (email: ''Bruno dot Pinaud at labri dot fr'') | ||

- | ==== Bordeaux roadmap 2014-2015 / Session by session cutdown ==== | + | ==== Term project ==== |

- | [[bordeaux20142015:info_cours|Have a look at the page describing the course organization]]: assignments, term projects and evaluation, //deadlines//, etc. | + | * You need to form teams (2 persons). |

+ | * Please email us to let us know who you work with. | ||

+ | * You need to select domain questions (one will certainly not be enough ...) you will answer by foraging data. | ||

+ | * Your answer must be backed up by evidence relying on data supported by relevant visualization. | ||

+ | * You need to document your conclusions, provide a written report covering all methodology used. | ||

+ | * Tell us who's wiki pages we can find the report. Do not upload a flat and dull pdf file, create wiki pages. Use images to illustrate your report. | ||

+ | * You need to upload any specific algorithms and/or scripts you have used. | ||

- | <html><font color="red">You are requested to work on a term project.</font></html> You are expected to form a team with another colleague and select a project topic from a list. | + | * You will be evaluated on |

+ | * the astute aspect of your work; | ||

+ | * the difficulty of the task; | ||

+ | * the technicality and innovativeness of the solution/s; | ||

+ | * the quality of your oral and written report; | ||

+ | * If the question is to simple to answer, think of refinements that make it more challenging; | ||

+ | * 15 minutes oral presentations will take place as a face-to-face interviews in January (date to be confirmed) -- no powerpoint or anything, bring a laptop to show short demos and live data/scripts. | ||

+ | | ||

+ | [[termproject|Access this page to know more about the available datasets and potential questions.]] | ||

+ | ==== Bordeaux roadmap 2014-2015 / Session by session cutdown ==== | ||

Remember that Tulip in installed in the CREMI in ''/net/ens/tulip4''. It should always be the latest svn version compiled by hand. It can be launched with ''/net/ens/tulip4/bin/tulip'' or to directly launch the graph manipulation perspective ''/net/ens/tulip4/bin/tulip_perspective -p Tulip''. If you find a bug, do not hesitate to show it to us!! | Remember that Tulip in installed in the CREMI in ''/net/ens/tulip4''. It should always be the latest svn version compiled by hand. It can be launched with ''/net/ens/tulip4/bin/tulip'' or to directly launch the graph manipulation perspective ''/net/ens/tulip4/bin/tulip_perspective -p Tulip''. If you find a bug, do not hesitate to show it to us!! | ||

Line 53: | Line 68: | ||

=== Friday, October 3 (week 40, Guy Melançon) === | === Friday, October 3 (week 40, Guy Melançon) === | ||

- | **Network metrics** This lecture was partly based on [[:network_data|the chapter concerning network metrics]]. Half of the course was devoted to defining a few metrics on graphs: node degree (obvious while easily interpretable and extremely useful); clustering coefficient (also quite informative although more tedious to compute on some graphs); | + | **Network metrics** This lecture was partly based on [[:network_data|the chapter concerning network metrics]]. Half of the course was devoted to defining a few metrics on graphs: node degree (obvious while easily interpretable and extremely useful); clustering coefficient (also quite informative although more tedious to compute on some graphs); node betweenness centrality. We then looked into random walk version of node degree and (second order) centrality to scale the se metrics to large graphs. |

=== Friday, October 10 (week 41, Bruno Pinaud) === | === Friday, October 10 (week 41, Bruno Pinaud) === | ||

+ | Graph Drawing: Walker algorithm, sugiyama heuristics and introduction to graph drawing based on physical analogy. {{:bordeaux20142015:dessin_graphes.pdf|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 [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8724| this paper]] for a complete overview. | ||

+ | |||

+ | * You are asked to implement either | ||

+ | * {{:sindre_1993.pdf|Sindre's nested boxes}} (onion trees) algorithm for trees, | ||

+ | * __//or//__ the {{:eades_1992.pdf|H-tree layout by Eades}} | ||

+ | * __//or//__ the {{:chicoutimi:kruskal_1983.pdf|icicle plot by Kruskal and Landwehr}} | ||

+ | * Your algorithm should start from an existing tree (use Tulip general tree random generator to test) and __//animate the change//__ from the previous layout to the next. The idea here is to force you to play with layout animation. | ||

+ | * You need to submit your work on //October 20 (Monday), before 9am, at the latest//. | ||

=== Friday, October 17 (week 42, Guy Melançon) === | === Friday, October 17 (week 42, Guy Melançon) === | ||

- | TBA | + | |

+ | Plotting (non graph) high-dimensional data ([[:high-dimensional_data_and_ward_hyugen_s_principle|links with the MDS part of the course]]). | ||

=== Friday, October 24 (week 43, Guy Melançon) === | === Friday, October 24 (week 43, Guy Melançon) === | ||

- | TBA | + | |

+ | Clustering of multi-dimensional data (K-Means, CURE, ...), hierarchical agglomerative clustering. | ||

=== Friday, November 7 (week 45, Bruno Pinaud) === | === Friday, November 7 (week 45, Bruno Pinaud) === | ||

Line 69: | Line 99: | ||

We will use the following file to play with graph hierarchies {{:bordeaux:infovis_clean.tlpx|}}. The work to do is described in this document {{:bordeaux20132014:hierarchies.pdf|}}. | We will use the following file to play with graph hierarchies {{:bordeaux:infovis_clean.tlpx|}}. The work to do is described in this document {{:bordeaux20132014:hierarchies.pdf|}}. | ||

- | === Friday, November 14 (week 46, Guy Melançon) === | + | === Friday, November 14 (week 46, Bruno Pinaud) === |

- | Graph clustering | + | |

- | | + | |

- | === Friday, November 21 (week 47, Bruno Pinaud) === | + | |

Let's continue to work on Multilevel graph navigation | Let's continue to work on Multilevel graph navigation | ||

- | === Friday, November 28 (week 48, Guy Melançon) === | + | === Friday, November 21 (week 47, Guy Melançon) === |

- | Text mining & Document visualization | + | |

- | === Friday, December 5 (week 49, Bruno Pinaud) === | + | Graph clustering. |

- | Project coaching | + | |

- | === Friday, December 12 (week 50, Guy Melançon) === | + | * Parallel to hierarchical agglomerative clustering for high-dimensional data. Need to define what a "good" clustering is for a graph -- no Huygens criteria this time. |

+ | * Newman modularity is such a criteria. | ||

+ | * Implementation of a hierarchical agglomerative clustering using Newman's criteria, computing incremental improvements of cluster merge. | ||

+ | | ||

+ | === Friday, November 28 (week 48, Bruno Pinaud) === | ||

+ | Project coaching. See [[#Term project|term project]] for more information. | ||

+ | | ||

+ | === Friday, December 5 (week 49, Guy Melançon) === | ||

Project coaching | Project coaching | ||

+ | |||

+ | === Friday, December 12 (week 50) === | ||

+ | Course cancelled. | ||

=== January XX (week X, Guy Melançon and Bruno Pinaud) === | === January XX (week X, Guy Melançon and Bruno Pinaud) === | ||

Project evaluation | Project evaluation |

/net/html/perso/melancon/Visual_Analytics_Course/data/pages/bordeaux20142015/bordeaux_edition.txt · Last modified: 2014/12/09 11:13 by bpinaud