Preprints

International Publications

Learning Disentangled Representations in Signed Directed Graphs without Social Assumptions
Geonwoo Ko, and Jinhong Jung
Journal 2024 (to appear) Paper Code
Random Walk with Restart on Hypergraphs: Fast Computation and an Application to Anomaly Detection
Jaewan Chun, Geon Lee, Kijung Shin, and Jinhong Jung
Journal 2024 (to appear) Paper Code
TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions
Taehyung Kwon, Jihoon Ko, Jinhong Jung, and Kijung Shin
NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors
Taehyung Kwon, Jihoon Ko, Jinhong Jung, and Kijung Shin
ACM The Web Conference 2023
Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning
Jong-Whi Lee, and Jinhong Jung
AAAI Conference on Artificial Intelligence (AAAI) 2023
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder
Jaemin Yoo, Hyunsik Jeon, Jinhong Jung, and U Kang
ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD) 2022
Signed Random Walk Diffusion for Effective Representation Learning in Signed Graphs
Jinhong Jung, Jaemin Yoo, and U Kang
PLoS ONE 16(8): e0256187
Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion
Jaehun Jung, Jinhong Jung, and U Kang
Compressing Deep Graph Convolution Network With Multi-staged Knowledge Distillation
Junghun Kim, Jinhong Jung, and U Kang
PLoS ONE 16(8): e0256187
Fast and Accurate Pseudoinverse with Sparse Matrix Reordering and Incremental Approach
Jinhong Jung, and Lee Sael
Machine Learning 109: 2333–2347
Accurate Relational Reasoning in Edge-labeled Graphs by Multi-Labeled Random Walk with Restart
Jinhong Jung, Woojeong Jin, Ha-Myung Park, and U Kang
World Wide Web Journal 2020
Journal May 2020 Paper BibTex
BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks
Jinhong Jung, Ha-Myung Park, and U Kang
Random Walk Based Ranking in Signed Social Networks: Model and Algorithms
Jinhong Jung, Woojeong Jin, and U Kang
Supervised and Extended Restart in Random Walks for Ranking and Link Prediction in Networks
Woojeong Jin, Jinhong Jung, and U Kang
PLoS ONE 14(3): e0213857, 2019
Journal Mar 2019 Paper Code
Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Pattern an Arbitrary Time Range
Jun-gi Jang, Dongjin Choi, Jinhong Jung, and U Kang
TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs
Minji Yoon, Jinhong Jung, and U Kang
A Comparative Study of Matrix Factorization and Random Walk with Restart in Recommender Systems
Haekyu Park, Jinhong Jung, and U Kang
A New Question Answering Approach with Conceptual Graphs
Kyung-Min Kim, Jinhong Jung, Jihee Ryu, Ha-Myung Park, Joseph P.Joohee, Seokwoo Jeong, U Kang, and Sung-Hyon Myaeng
BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart
Jinhong Jung, Namyong Park, Lee Sael, and U Kang
Personalized Ranking in Signed Networks using Signed Random Walk with Restart
Woojeong Jin, Jinhong Jung, Lee Sael, and U Kang
Random Walk with Restart on Large Graphs Using Block Elimination
Jinhong Jung, Kijung Shin, Lee Sael, and U Kang
Journal June 2016 Paper BibTex Code
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs
Kijung Shin, Jinhong Jung, Lee Sael, and U Kang