I am a Ph.D. Candidate in the Computer Science Department at Carnegie Mellon University and my advisor is Professor Christos Faloutsos.
I received my diploma in Electrical and Computer Engineering at the National Technical University of Athens in 2010. During my senior year, I was advised by Professor Timos Sellis and co-advised by Thanasis Vergoulis and Dr. Theodore Dalamagas.
Research Interests: large-scale graph mining, graph similarity, graph matching, graph summarization, graph anomaly and event detection, machine learning
- Graph Summarization:
VoG:Summarizing and Understanding Large Graphs
Danai Koutra, U Kang, Jilles Vreeken, Christos Faloutsos.
SDM 2014, Philadelphia, PA, April 2014.
- Graph Alignment:
BIG-ALIGN: Fast Bipartite Graph Alignment
Danai Koutra, Hanghang Tong, David Lubensky.
IEEE ICDM 2013, Dallas, TX, December 2013.
- Graph Similarity:
DeltaCon: A Principled Massive-Graph Similarity Function.
Danai Koutra, Joshua Vogelstein, Christos Faloutsos.
SDM 2013, Austin, Texas, May 2013.
- Node Classification:
Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms.
Danai Koutra, Tai-You Ke, U Kang, Duen Horng (Polo) Chau, Hsing-Kuo Kenneth Pao, and Christos Faloutsos.
ECML PKDD, Athens, Greece, Sep. 2011