Oana Balalau

About Me

I am a starting researcher at Inria Saclay in the CEDAR team and part-time assistant professor at École polytechnique. Previously, I was a postdoctoral researcher at Max Planck Institute for Informatics in the team of Gerhard Weikum. I received my Ph.D. from Télécom Paris University and my advisor was Mauro Sozio.

My research interests lie in the area of data mining, with a focus on graph mining and computational social science.

Originally I am from Romania and more exactly Rucăr, a village in the Carpathian Mountains.

Publications

From the Stage to the Audience: Propaganda on Reddit
EACL 2021 (to appear), O. Balalau and R. Horincar

Graph integration of structured, semistructured and unstructured data for data journalism
BDA 2020 (informal publication), O. Balalau, C. Conceição, H. Galhardas, I. Manolescu, T. Merabti, J. You, and Y. Youssef
[pdf]

SubRank: Subgraph Embeddings via a Subgraph Proximity Measure
PAKDD 2020, O. Balalau and S. Goyal
[pdf] [code]

PRINCE: Provider-side Interpretability with Counterfactual Explanations in Recommender Systems
WSDM 2020, A. Ghazimatin, O. Balalau, R. Saha Roy, and G. Weikum
[pdf] [code]

Discovering the Functions of Language in Online Forums
EMNLP W-NUT 2019, Y. Ismaeil, O. Balalau, and P. Mirza
[pdf] [dataset]

Analyzing the Traits and Anomalies of Political Discussions on Reddit
ICWSM 2019, A. Guimareas, O. Balalau, E. Terolli, and G. Weikum
[pdf]

EviDense: a Graph-based Method for Finding Unique High-impact Events with Succinct Keyword-based Descriptions
ICWSM 2018, O. Balalau, C. Castillo and M. Sozio
[short] [long] [code]

Listing k-cliques in Sparse Real-World Graphs
WWW 2018, M. Danisch, O. Balalau and M. Sozio.
[pdf] [code]

Finding Heaviest k-Subgraphs and Events in Social Media
ICDM DaMNet 2016, M. Letsios, O. Balalau, M. Danisch, E. Orsini and M. Sozio
[pdf] [code]

Finding Subgraphs with Maximum Total Density and Limited Overlap
WSDM 2015, O. Balalau, F. Bonchi, T-H. Hubert Chan, F. Gullo and M. Sozio
[pdf] [code]