Search Results for author: Joyce Jiyoung Whang

Found 7 papers, 5 papers with code

Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection

1 code implementation6 Oct 2023 Heehyeon Kim, Jinhyeok Choi, Joyce Jiyoung Whang

We address this problem using Graph Neural Networks (GNNs) by proposing a dynamic relation-attentive aggregation mechanism.

Fraud Detection Graph Attention +1

InGram: Inductive Knowledge Graph Embedding via Relation Graphs

1 code implementation31 May 2023 Jaejun Lee, Chanyoung Chung, Joyce Jiyoung Whang

In this paper, we propose an INductive knowledge GRAph eMbedding method, InGram, that can generate embeddings of new relations as well as new entities at inference time.

Entity Embeddings Inductive knowledge graph completion +3

Representation Learning on Hyper-Relational and Numeric Knowledge Graphs with Transformers

1 code implementation29 May 2023 Chanyoung Chung, Jaejun Lee, Joyce Jiyoung Whang

By learning compact representations of triplets and qualifiers and feeding them into the transformers, we reduce the computation cost of using transformers.

Knowledge Graph Embedding Knowledge Graphs +1

Why So Gullible? Enhancing the Robustness of Retrieval-Augmented Models against Counterfactual Noise

1 code implementation2 May 2023 Giwon Hong, Jeonghwan Kim, Junmo Kang, Sung-Hyon Myaeng, Joyce Jiyoung Whang

Most existing retrieval-augmented language models (LMs) assume a naive dichotomy within a retrieved document set: query-relevance and irrelevance.

counterfactual Few-Shot Learning +4

Non-Exhaustive, Overlapping Co-Clustering: An Extended Analysis

no code implementations24 Apr 2020 Joyce Jiyoung Whang, Inderjit S. Dhillon

To solve this problem, we propose intuitive objective functions, and develop an an efficient iterative algorithm which we call the NEO-CC algorithm.

Clustering

Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering

no code implementations5 Feb 2016 Yangyang Hou, Joyce Jiyoung Whang, David F. Gleich, Inderjit S. Dhillon

In this paper, we consider two fast multiplier methods to accelerate the convergence of an augmented Lagrangian scheme: a proximal method of multipliers and an alternating direction method of multipliers (ADMM).

Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.