default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenjing Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Wenjing Chang, Mengyu Guo, Junwei Luo:
Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework. PeerJ Comput. Sci. 10: e2169 (2024)- [c6]Yue Wang, Yujie Hu, Wenjing Chang, Jianjun Yu:
A Multi-Feature Semantic Fusion and Bipartite Graph-Based Risk Identification Approach for Project Participation. ICEIS (1) 2024: 907-914 - [i2]Wenjing Chang, Kay Liu
, Kaize Ding, Philip S. Yu, Jianjun Yu:
Multitask Active Learning for Graph Anomaly Detection. CoRR abs/2401.13210 (2024) - [i1]Wenjing Chang, Kay Liu, Philip S. Yu, Jianjun Yu:
Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement. CoRR abs/2406.00987 (2024) - 2023
- [j4]Junwei Luo, Yading Feng, Xuyang Wu, Ruimin Li, Jiawei Shi, Wenjing Chang, Junfeng Wang:
ForestSubtype: a cancer subtype identifying approach based on high-dimensional genomic data and a parallel random forest. BMC Bioinform. 24(1): 289 (2023) - [c5]Wenjing Chang, Jianjun Yu, Xiaojun Zhou:
PERTAD: Towards Pseudo Verification for Anomaly Detection in Partially Labeled Graphs. APWeb/WAIM (4) 2023: 201-216 - [c4]Wenjing Chang, Jianjun Yu, Xiaojun Zhou:
ConsE: Consistency Exploitation for Semi-Supervised Anomaly Detection in Graphs. IJCNN 2023: 1-8 - 2022
- [j3]Wenjing Chang, Hengkai Zhang, Junwei Luo:
Predicting Propositional Satisfiability Based on Graph Attention Networks. Int. J. Comput. Intell. Syst. 15(1): 84 (2022) - [c3]Wenjing Chang, Jianjun Yu, Xiaojun Zhou:
GADAL: An Active Learning Framework for Graph Anomaly Detection. APWeb/WAIM (1) 2022: 435-442
2010 – 2019
- 2019
- [j2]Wenjing Chang, Yang Xu, Shuwei Chen:
An Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers. Symmetry 11(2): 197 (2019) - 2018
- [j1]Wenjing Chang, Yang Xu, Shuwei Chen:
A New Rewarding Mechanism for Branching Heuristic in SAT Solvers. Int. J. Comput. Intell. Syst. 12(1): 334-341 (2018) - 2017
- [c2]Wenjing Chang, Guanfeng Wu, Yang Xu:
Adding a LBD-based rewarding mechanism in branching heuristic for SAT solvers. ISKE 2017: 1-6 - 2015
- [c1]Hua Zhu, Jianbin Zhao, Wenjing Chang, Yang Xu:
2-Dimension Linguistic Lattice Implication Algebra. ISKE 2015: 128-132
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-21 02:37 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:
