Bridging HCI with Data Mining

This work focuses on automatically determining important structures in a graph. The idea is to use the so-called Minimum Description Language (MDL) to describe ‘important’ subgraphs, i.e., subgraph that can be compressed easily: cliques, chains, stars, bipartite cores etc. We aim at developing scalable heuristics to solve the combinatorial problem of subgraph selection. Then, once such subgraphs are chosen, we plan to show them to the user, in a compressed form, for example, using a ‘box’ glyph, to represent a clique, or a ‘star’ glyph to represent a star.



  • U. Kang, J. Lee, D. Koutra, and C. Faloutsos, "Net-Ray: Visualizing and Mining Billion-Scale Graphs," in PAKDD, 2014. [PDF] [BIBTEX]
      author = {U. Kang and Jay-Yoon Lee and Danai Koutra and Christos Faloutsos},
      title = {Net-Ray: Visualizing and Mining Billion-Scale Graphs},
      booktitle = {PAKDD},
      year = {2014},
  • D. Koutra, U. Kang, J. Vreeken, and C. Faloutsos, "VOG: Summarizing and Understanding Large Graphs," in SDM, 2014. [PDF] [BIBTEX]
    @inproceedings{koutra2014vog, title={VOG: Summarizing and Understanding Large Graphs},
      author={Koutra, Danai and Kang, U and Vreeken, Jilles and Faloutsos, Christos},
  • D. Koutra, Y. Gong, S. Ryman, R. Jung, J. Vogelstein, and C. Faloutsos, "Are all brains wired equally?," in Proceedings of the 19th Annual Meeting of the Organization for Human Brain Mapping (OHBM), 2013. [PDF] [BIBTEX]
      author = {Danai Koutra and Yu Gong and Sephira Ryman and Rex Jung and Joshua Vogelstein and Christos Faloutsos},
      title = {Are all brains wired equally?},
      booktitle = {Proceedings of the 19th Annual Meeting of the Organization for Human Brain Mapping (OHBM)},
      year = {2013},