default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFanchen Bu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i16]Hyeonsoo Jo, Hyunjin Hwang, Fanchen Bu, Soo Yong Lee, Chanyoung Park, Kijung Shin:
On Measuring Unnoticeability of Graph Adversarial Attacks: Observations, New Measure, and Applications. CoRR abs/2501.05015 (2025)- 2024
- [c10]Sunwoo Kim, Shinhwan Kang, Fanchen Bu, Soo Yong Lee, Jaemin Yoo, Kijung Shin:
HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs. ICLR 2024 - [c9]Fanchen Bu, Hyeonsoo Jo, Soo Yong Lee, Sungsoo Ahn, Kijung Shin:
Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More. ICML 2024 - [c8]Soo Yong Lee, Sunwoo Kim, Fanchen Bu, Jaemin Yoo, Jiliang Tang, Kijung Shin:
Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective. ICML 2024 - [c7]Sunwoo Kim, Soo Yong Lee, Fanchen Bu, Shinhwan Kang, Kyungho Kim, Jaemin Yoo, Kijung Shin:
Rethinking Reconstruction-based Graph-Level Anomaly Detection: Limitations and a Simple Remedy. NeurIPS 2024 - [i15]Geon Lee, Fanchen Bu, Tina Eliassi-Rad, Kijung Shin:
A Survey on Hypergraph Mining: Patterns, Tools, and Generators. CoRR abs/2401.08878 (2024) - [i14]Soo Yong Lee, Sunwoo Kim, Fanchen Bu, Jaemin Yoo, Jiliang Tang, Kijung Shin:
Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective. CoRR abs/2402.04621 (2024) - [i13]Sunwoo Kim, Shinhwan Kang, Fanchen Bu, Soo Yong Lee, Jaemin Yoo, Kijung Shin:
HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs. CoRR abs/2404.00638 (2024) - [i12]Fanchen Bu, Hyeonsoo Jo, Soo Yong Lee, Sungsoo Ahn, Kijung Shin:
Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More. CoRR abs/2405.08424 (2024) - [i11]Fanchen Bu, Ruochen Yang, Paul Bogdan, Kijung Shin:
Exploring Edge Probability Graph Models Beyond Edge Independency: Concepts, Analyses, and Algorithms. CoRR abs/2405.16726 (2024) - [i10]Sunwoo Kim, Soo Yong Lee, Fanchen Bu, Shinhwan Kang, Kyungho Kim, Jaemin Yoo, Kijung Shin:
Rethinking Reconstruction-based Graph-Level Anomaly Detection: Limitations and a Simple Remedy. CoRR abs/2410.20366 (2024) - 2023
- [j2]Fanchen Bu
, Shinhwan Kang, Kijung Shin:
Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm. Data Min. Knowl. Discov. 37(6): 2139-2191 (2023) - [j1]Fanchen Bu, Geon Lee, Kijung Shin:
Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications. Data Min. Knowl. Discov. 37(6): 2389-2437 (2023) - [c6]Hyeonsoo Jo, Fanchen Bu, Kijung Shin:
Robust Graph Clustering via Meta Weighting for Noisy Graphs. CIKM 2023: 1035-1044 - [c5]Soo Yong Lee, Fanchen Bu, Jaemin Yoo, Kijung Shin:
Towards Deep Attention in Graph Neural Networks: Problems and Remedies. ICML 2023: 18774-18795 - [c4]Fanchen Bu, Kijung Shin:
On Improving the Cohesiveness of Graphs by Merging Nodes: Formulation, Analysis, and Algorithms. KDD 2023: 117-129 - [c3]Sunwoo Kim, Fanchen Bu, Minyoung Choe, Jaemin Yoo, Kijung Shin:
How Transitive Are Real-World Group Interactions? - Measurement and Reproduction. KDD 2023: 1132-1143 - [c2]Hyunju Kim, Jihoon Ko, Fanchen Bu, Kijung Shin:
Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes. WWW 2023: 317-327 - [i9]Fanchen Bu, Geon Lee, Kijung Shin:
Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications. CoRR abs/2301.08440 (2023) - [i8]Hyunju Kim, Jihoon Ko, Fanchen Bu, Kijung Shin:
Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes. CoRR abs/2302.05505 (2023) - [i7]Fanchen Bu, Shinhwan Kang, Kijung Shin:
Interplay between Topology and Edge Weights in Real-World Graphs: Concepts, Patterns, and an Algorithm. CoRR abs/2305.09083 (2023) - [i6]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) - [i5]Soo Yong Lee, Fanchen Bu, Jaemin Yoo, Kijung Shin:
Towards Deep Attention in Graph Neural Networks: Problems and Remedies. CoRR abs/2306.02376 (2023) - [i4]Fanchen Bu, Kijung Shin:
On Improving the Cohesiveness of Graphs by Merging Nodes: Formulation, Analysis, and Algorithms. CoRR abs/2306.06368 (2023) - [i3]Hyeonsoo Jo, Fanchen Bu, Kijung Shin:
Robust Graph Clustering via Meta Weighting for Noisy Graphs. CoRR abs/2311.00322 (2023) - 2022
- [c1]Fanchen Bu, Dong Eui Chang:
Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs. AAAI 2022: 6106-6114 - [i2]Fanchen Bu, Dong Eui Chang:
Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs. CoRR abs/2205.08385 (2022) - 2020
- [i1]Fanchen Bu, Dong Eui Chang:
Double Prioritized State Recycled Experience Replay. CoRR abs/2007.03961 (2020)
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 2025-02-20 20:40 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:
