default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJinhong Jung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Jaewan Chun, Geon Lee, Kijung Shin
, Jinhong Jung:
Random walk with restart on hypergraphs: fast computation and an application to anomaly detection. Data Min. Knowl. Discov. 38(3): 1222-1257 (2024)- [j7]Geonwoo Ko, Jinhong Jung:
Learning disentangled representations in signed directed graphs without social assumptions. Inf. Sci. 665: 120373 (2024) - 2021
- [j6]Jinhong Jung, Lee Sael:
Correction to: Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach. Mach. Learn. 110(2): 449 (2021) - [j5]Jinhong Jung, Lee Sael:
Correction to: Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach. Mach. Learn. 110(3): 619-620 (2021) - [j4]Jinhong Jung, Woojeong Jin, Ha-Myung Park, U Kang:
Accurate relational reasoning in edge-labeled graphs by multi-labeled random walk with restart. World Wide Web 24(4): 1369-1393 (2021) - 2020
- [j3]Jinhong Jung, Woojeong Jin, U Kang:
Random walk-based ranking in signed social networks: model and algorithms. Knowl. Inf. Syst. 62(2): 571-610 (2020) - [j2]Jinhong Jung, Lee Sael:
Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach. Mach. Learn. 109(12): 2333-2347 (2020) - 2016
- [j1]Jinhong Jung, Kijung Shin, Lee Sael, U Kang:
Random Walk with Restart on Large Graphs Using Block Elimination. ACM Trans. Database Syst. 41(2): 12:1-12:43 (2016)
Conference and Workshop Papers
- 2024
- [c14]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Jun-Gi Jang, Kijung Shin:
Compact Decomposition of Irregular Tensors for Data Compression: From Sparse to Dense to High-Order Tensors. KDD 2024: 1451-1462 - 2023
- [c13]Jong-whi Lee, Jinhong Jung:
Time-Aware Random Walk Diffusion to Improve Dynamic Graph Learning. AAAI 2023: 8473-8481 - [c12]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Kijung Shin:
TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions. ICDM 2023: 229-238 - [c11]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Kijung Shin:
NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors. WWW 2023: 71-81 - 2022
- [c10]Jaemin Yoo, Hyunsik Jeon, Jinhong Jung, U Kang:
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder. KDD 2022: 2336-2346 - 2021
- [c9]Jaehun Jung, Jinhong Jung, U Kang:
Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion. KDD 2021: 786-795 - 2020
- [c8]Jinhong Jung, Ha-Myung Park, U Kang:
BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks. EDBT 2020: 193-204 - 2018
- [c7]Jun-Gi Jang, Dongjin Choi, Jinhong Jung, U Kang:
Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range. CIKM 2018: 1083-1092 - [c6]Minji Yoon, Jinhong Jung, U Kang:
TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs. ICDE 2018: 1132-1143 - 2017
- [c5]Haekyu Park, Jinhong Jung, U Kang:
A comparative study of matrix factorization and random walk with restart in recommender systems. IEEE BigData 2017: 756-765 - [c4]Kyung-Min Kim, Jinhong Jung, Jihee Ryu, Ha-Myung Park, Joseph P. Joohee, Seokwoo Jeong, U Kang, Sung-Hyon Myaeng:
A New Question Answering Approach with Conceptual Graphs. CORIA 2017: 218-234 - [c3]Jinhong Jung, Namyong Park, Lee Sael, U Kang:
BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart. SIGMOD Conference 2017: 789-804 - 2016
- [c2]Jinhong Jung, Woojeong Jin, Lee Sael, U Kang:
Personalized Ranking in Signed Networks Using Signed Random Walk with Restart. ICDM 2016: 973-978 - 2015
- [c1]Kijung Shin, Jinhong Jung, Lee Sael, U Kang:
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs. SIGMOD Conference 2015: 1571-1585
Informal and Other Publications
- 2023
- [i12]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Kijung Shin:
NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors. CoRR abs/2302.04570 (2023) - [i11]Geonwoo Ko, Jinhong Jung:
Learning Disentangled Representations in Signed Directed Graphs without Social Assumptions. CoRR abs/2307.03077 (2023) - [i10]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Kijung Shin:
TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions. CoRR abs/2309.10310 (2023) - 2022
- [i9]Jaemin Yoo, Hyunsik Jeon, Jinhong Jung, U Kang:
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder. CoRR abs/2206.04516 (2022) - [i8]Jong-whi Lee, Jinhong Jung:
Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning. CoRR abs/2211.01214 (2022) - 2020
- [i7]Jinhong Jung, Lee Sael:
Fast and Accurate Pseudoinverse with Sparse Matrix Reordering and Incremental Approach. CoRR abs/2011.04235 (2020) - [i6]Jaehun Jung, Jinhong Jung, U Kang:
T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion. CoRR abs/2012.10595 (2020) - [i5]Jinhong Jung, Jaemin Yoo, U Kang:
Signed Graph Diffusion Network. CoRR abs/2012.14191 (2020) - 2018
- [i4]Jun-Gi Jang, Dongjin Choi, Jinhong Jung, U Kang:
TR-SVD: Fast and Memory Efficient Method for Time Ranged Singular Value Decomposition. CoRR abs/1805.00754 (2018) - 2017
- [i3]Minji Yoon, Jinhong Jung, U Kang:
TPA: Two Phase Approximation for Random Walk with Restart. CoRR abs/1708.02574 (2017) - [i2]Haekyu Park, Jinhong Jung, U Kang:
A Comparative Study of Matrix Factorization and Random Walk with Restart in Recommender Systems. CoRR abs/1708.09088 (2017) - [i1]Woojeong Jin, Jinhong Jung, U Kang:
Supervised and Extended Restart in Random Walks for Ranking and Link Prediction in Networks. CoRR abs/1710.06609 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
