default search action
Shengyuan Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Shengyuan Chen, Qinggang Zhang, Junnan Dong, Wen Hua, Qing Li, Xiao Huang
:
Entity Alignment with Noisy Annotations from Large Language Models. CoRR abs/2405.16806 (2024) - [i5]Shengyuan Chen, Qinggang Zhang, Junnan Dong, Wen Hua, Jiannong Cao, Xiao Huang:
Neuro-Symbolic Entity Alignment via Variational Inference. CoRR abs/2410.04153 (2024) - [i4]Hao Chen, Yuanchen Bei, Wenbing Huang, Shengyuan Chen, Feiran Huang, Xiao Huang:
Graph Cross-Correlated Network for Recommendation. CoRR abs/2411.01182 (2024) - 2023
- [j5]Zecheng Li
Abnormal Traffic Detection: Traffic Feature Extraction and DAE-GAN With Efficient Data Augmentation. IEEE Trans. Reliab. 72(2): 498-510 (2023) - [c5]Yuanchen Bei
Non-Recursive Cluster-Scale Graph Interacted Model for Click-Through Rate Prediction. CIKM 2023: 3748-3752 - [c4]Zirui Liu, Shengyuan Chen, Kaixiong Zhou, Daochen Zha, Xiao Huang, Xia Hu:
RSC: Accelerate Graph Neural Networks Training via Randomized Sparse Computations. ICML 2023: 21951-21968 - [c3]Shengyuan Chen, Yunfeng Cai, Huang Fang, Xiao Huang, Mingming Sun:
Differentiable Neuro-Symbolic Reasoning on Large-Scale Knowledge Graphs. NeurIPS 2023 - 2022
- [j4]Zhihao Guo
Fair Benchmark for Unsupervised Node Representation Learning. Algorithms 15(10): 379 (2022) - [j3]Rui Liang, Hongmei Zhu, Grant Lawson, Zhao Lian, Yuqi Huang, Shengyuan Chen:
Early childhood learning analytics: A case study of Learning Jungle. Frontiers Appl. Math. Stat. 8 (2022) - [i3]Zirui Liu, Shengyuan Chen, Kaixiong Zhou, Daochen Zha, Xiao Huang, Xia Hu:
RSC: Accelerating Graph Neural Networks Training via Randomized Sparse Computations. CoRR abs/2210.10737 (2022) - [i2]Kaixiong Zhou, Zhenyu Zhang, Shengyuan Chen, Tianlong Chen, Xiao Huang
QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks. CoRR abs/2211.07379 (2022) - 2020
- [j2]Masoud Ataei
Time-homogeneous top-K ranking using tensor decompositions. Optim. Methods Softw. 35(6): 1119-1143 (2020)
2010 – 2019
- 2018
- [j1]Sajad Fathi Hafshejani
Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term. J. Optim. Theory Appl. 178(3): 935-949 (2018) - [c2]M. Reza Peyghami
Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization. Canadian AI 2018: 231-238 - [i1]Masoud Ataei
Lehmer Transform and its Theoretical Properties. CoRR abs/1805.04927 (2018)
2000 – 2009
- 2009
- [c1]Bing Zhao, Shengyuan Chen:
A Simplex Armijo Downhill Algorithm for Optimizing Statistical Machine Translation Decoding Parameters. HLT-NAACL (Short Papers) 2009: 21-24
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-12 20:58 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: