default search action
Yoonhyuk Choi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Ahmet Kapkiç
, Pratanu Mandal
Introducing CausalBench: A Flexible Benchmark Framework for Causal Analysis and Machine Learning. CIKM 2024: 5220-5224 - [c5]Soobin Park, Yoonhyuk Choi, Chong-Kwon Kim:
Precipitation Nowcasting with Graph Neural Network and Gated Recurrent Units. ICOIN 2024: 102-107 - [i10]Yoonhyuk Choi:
Review-Based Cross-Domain Recommendation via Hyperbolic Embedding and Hierarchy-Aware Domain Disentanglement. CoRR abs/2403.20298 (2024) - [i9]Yoonhyuk Choi, Reepal Shah, John Sabo, K. Selcuk Candan, Huan Liu:
Prioritizing Potential Wetland Areas via Region-to-Region Knowledge Transfer and Adaptive Propagation. CoRR abs/2406.05578 (2024) - [i8]Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chong-Kwon Kim:
Better Not to Propagate: Understanding Edge Uncertainty and Over-smoothing in Signed Graph Neural Networks. CoRR abs/2408.04895 (2024) - [i7]Ahmet Kapkiç, Pratanu Mandal, Shu Wan
Introducing CausalBench: A Flexible Benchmark Framework for Causal Analysis and Machine Learning. CoRR abs/2409.08419 (2024) - 2023
- [j1]Taewook Ko
A spectral graph convolution for signed directed graphs via magnetic Laplacian. Neural Networks 164: 562-574 (2023) - [c4]Taewook Ko, Yoonhyuk Choi, Chong-Kwon Kim:
Universal Graph Contrastive Learning with a Novel Laplacian Perturbation. UAI 2023: 1098-1108 - [i6]Taewook Ko, Yoonhyuk Choi, Chong-Kwon Kim:
Signed Directed Graph Contrastive Learning with Laplacian Augmentation. CoRR abs/2301.05163 (2023) - [i5]Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chong-Kwon Kim:
Is Signed Message Essential for Graph Neural Networks? CoRR abs/2301.08918 (2023) - [i4]Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chong-Kwon Kim:
Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification. CoRR abs/2302.09755 (2023) - 2022
- [c3]Yoonhyuk Choi
Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification. CIKM 2022: 283-292 - [c2]Yoonhyuk Choi
Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendation. CIKM 2022: 293-303 - [c1]Beomsik Park, Ranggi Hwang, Dongho Yoon, Yoonhyuk Choi, Minsoo Rhu:
DiVa: An Accelerator for Differentially Private Machine Learning. MICRO 2022: 1200-1217 - [i3]Beomsik Park, Ranggi Hwang, Dongho Yoon, Yoonhyuk Choi, Minsoo Rhu:
DiVa: An Accelerator for Differentially Private Machine Learning. CoRR abs/2208.12392 (2022) - [i2]Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chong-Kwon Kim:
Flip Initial Features: Generalization of Neural Networks for Semi-supervised Node Classification. CoRR abs/2211.15081 (2022) - 2021
- [i1]Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chongkwon Kim:
DaRE: A Cross-Domain Recommender System with Domain-aware Feature Extraction and Review Encoder. CoRR abs/2110.12648 (2021)
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-12-02 21:30 CET 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: