Jinhong Jung

Orcid: 0000-0002-5533-1507

According to our database1, Jinhong Jung authored at least 24 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning Disentangled Representations in Signed Directed Graphs without Social Assumptions.
CoRR, 2023

NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors.
Proceedings of the ACM Web Conference 2023, 2023

TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions.
Proceedings of the IEEE International Conference on Data Mining, 2023

Time-Aware Random Walk Diffusion to Improve Dynamic Graph Learning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021
Accurate relational reasoning in edge-labeled graphs by multi-labeled random walk with restart.
World Wide Web, 2021

Correction to: Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach.
Mach. Learn., 2021

Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach.
Mach. Learn., 2020

Random walk-based ranking in signed social networks: model and algorithms.
Knowl. Inf. Syst., 2020

Signed Graph Diffusion Network.
CoRR, 2020

T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion.
CoRR, 2020

BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks.
Proceedings of the 23rd International Conference on Extending Database Technology, 2020

2018
TR-SVD: Fast and Memory Efficient Method for Time Ranged Singular Value Decomposition.
CoRR, 2018

TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Supervised and Extended Restart in Random Walks for Ranking and Link Prediction in Networks.
CoRR, 2017

TPA: Two Phase Approximation for Random Walk with Restart.
CoRR, 2017

BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

A New Question Answering Approach with Conceptual Graphs.
Proceedings of the COnférence en Recherche d'Informations et Applications, 2017

A comparative study of matrix factorization and random walk with restart in recommender systems.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016
Random Walk with Restart on Large Graphs Using Block Elimination.
ACM Trans. Database Syst., 2016

Personalized Ranking in Signed Networks Using Signed Random Walk with Restart.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015


  Loading...