no code implementations • 3 Mar 2024 • Rohan Kumar, Youngmin Kim, Sunitha Ravi, Haitian Sun, Christos Faloutsos, Ruslan Salakhutdinov, Minji Yoon
Pretrained Large Language Models (LLMs) have gained significant attention for addressing open-domain Question Answering (QA).
1 code implementation • 11 Oct 2023 • Minji Yoon, Jing Yu Koh, Bryan Hooi, Ruslan Salakhutdinov
We study three research questions raised by MMGL: (1) how can we infuse multiple neighbor information into the pretrained LMs, while avoiding scalability issues?
1 code implementation • 10 Jul 2022 • Minji Yoon, Yue Wu, John Palowitch, Bryan Perozzi, Ruslan Salakhutdinov
As the field of Graph Neural Networks (GNN) continues to grow, it experiences a corresponding increase in the need for large, real-world datasets to train and test new GNN models on challenging, realistic problems.
1 code implementation • 24 Jun 2022 • Steven Jecmen, Minji Yoon, Vincent Conitzer, Nihar B. Shah, Fei Fang
The performance of these detection algorithms can be taken as a baseline for future research on detecting malicious bidding.
1 code implementation • 3 Mar 2022 • Minji Yoon, John Palowitch, Dustin Zelle, Ziniu Hu, Ruslan Salakhutdinov, Bryan Perozzi
We propose a zero-shot transfer learning module for HGNNs called a Knowledge Transfer Network (KTN) that transfers knowledge from label-abundant node types to zero-labeled node types through rich relational information given in the HG.
1 code implementation • 26 Nov 2020 • Minji Yoon, Bryan Hooi, Kijung Shin, Christos Faloutsos
This allows us to detect sudden changes in the importance of any node.
1 code implementation • 26 Nov 2020 • Minji Yoon, Théophile Gervet, Bryan Hooi, Christos Faloutsos
We first define a unified framework UNIFIEDGM that integrates various message-passing based graph algorithms, ranging from conventional algorithms like PageRank to graph neural networks.
3 code implementations • 17 Sep 2020 • Siddharth Bhatia, Rui Liu, Bryan Hooi, Minji Yoon, Kijung Shin, Christos Faloutsos
Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges in an online manner, for the purpose of detecting unusual behavior, using constant time and memory?
9 code implementations • 11 Nov 2019 • Siddharth Bhatia, Bryan Hooi, Minji Yoon, Kijung Shin, Christos Faloutsos
Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges in an online manner, for the purpose of detecting unusual behavior, using constant time and memory?
Ranked #1 on Anomaly Detection in Edge Streams on Darpa