default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinyoung Choe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Minyoung Choe
, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, Kijung Shin:
Representative and Back-In-Time Sampling from Real-world Hypergraphs. ACM Trans. Knowl. Discov. Data 18(6): 156:1-156:48 (2024)- [i9]Yejin Kim, Youngbin Lee, Minyoung Choe, Sungju Oh, Yongjae Lee:
Temporal Graph Networks for Graph Anomaly Detection in Financial Networks. CoRR abs/2404.00060 (2024) - 2023
- [j1]Sunwoo Kim, Minyoung Choe, Jaemin Yoo, Kijung Shin:
Reciprocity in directed hypergraphs: measures, findings, and generators. Data Min. Knowl. Discov. 37(6): 2330-2388 (2023) - [c6]Minyoung Choe, Sunwoo Kim, Jaemin Yoo, Kijung Shin:
Classification of Edge-dependent Labels of Nodes in Hypergraphs. KDD 2023: 298-309 - [c5]Sunwoo Kim, Fanchen Bu, Minyoung Choe, Jaemin Yoo, Kijung Shin:
How Transitive Are Real-World Group Interactions? - Measurement and Reproduction. KDD 2023: 1132-1143 - [i8]Deukryeol Yoon, Dongjin Lee, Minyoung Choe, Kijung Shin:
Graphlets over Time: A New Lens for Temporal Network Analysis. CoRR abs/2301.00310 (2023) - [i7]Sunwoo Kim, Fanchen Bu, Minyoung Choe, Jaemin Yoo, Kijung Shin:
How Transitive Are Real-World Group Interactions? - Measurement and Reproduction. CoRR abs/2306.02358 (2023) - [i6]Minyoung Choe, Sunwoo Kim, Jaemin Yoo, Kijung Shin:
Classification of Edge-dependent Labels of Nodes in Hypergraphs. CoRR abs/2306.03032 (2023) - 2022
- [c4]Sunwoo Kim, Minyoung Choe, Jaemin Yoo, Kijung Shin:
Reciprocity in Directed Hypergraphs: Measures, Findings, and Generators. ICDM 2022: 1005-1010 - [c3]Geon Lee, Minyoung Choe, Kijung Shin:
HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams. IJCAI 2022: 2129-2137 - [c2]Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, Kijung Shin:
MiDaS: Representative Sampling from Real-world Hypergraphs. WWW 2022: 1080-1092 - [i5]Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, Kijung Shin:
MiDaS: Representative Sampling from Real-world Hypergraphs. CoRR abs/2202.01587 (2022) - [i4]Geon Lee, Minyoung Choe, Kijung Shin:
HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams. CoRR abs/2204.13822 (2022) - [i3]Sunwoo Kim, Minyoung Choe, Jaemin Yoo, Kijung Shin:
Reciprocity in Directed Hypergraphs: Measures, Findings, and Generators. CoRR abs/2210.05328 (2022) - 2021
- [c1]Geon Lee, Minyoung Choe, Kijung Shin:
How Do Hyperedges Overlap in Real-World Hypergraphs? - Patterns, Measures, and Generators. WWW 2021: 3396-3407 - [i2]Geon Lee, Minyoung Choe, Kijung Shin:
How Do Hyperedges Overlap in Real-World Hypergraphs? - Patterns, Measures, and Generators. CoRR abs/2101.07480 (2021) - [i1]Kwanghee Choi, Minyoung Choe, Hyelee Lee:
Pretraining Neural Architecture Search Controllers with Locality-based Self-Supervised Learning. CoRR abs/2103.08157 (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-05-31 02:31 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:
