11 citations · 11 across the 4 of their papers we have counts for
4 papers
Transition Matrix Representation of Trees with Transposed Convolutions
Jaemin Yoo, Lee Sael
How can we effectively find the best structures in tree models? Tree models have been favored over complex black box models in domains where interpretability is crucial for making…
Model-Agnostic Augmentation for Accurate Graph Classification
Jaemin Yoo, Sooyeon Shim, U Kang
Given a graph dataset, how can we augment it for accurate graph classification? Graph augmentation is an essential strategy to improve the performance of graph-based tasks, and has…
Signed Graph Diffusion Network
Jinhong Jung, Jaemin Yoo, U Kang
Given a signed social graph, how can we learn appropriate node representations to infer the signs of missing edges? Signed social graphs have received considerable attention to mod…
Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets
Mauro Scanagatta, Giorgio Corani, Marco Zaffalon +2
Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, w…