Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yihui Wu

dblp:46/120 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0007-1894-8499ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
0.812024
SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning · KDD 2024
Data mining › anomaly detection
fraud detection
0.812024
SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning · KDD 2024
Data mining › anomaly detection › fraud detection
graph-based fraud detection
0.812024
SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning · KDD 2024
Machine learning › Trustworthy machine learning
interpretability
0.212024
SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning · KDD 2024

Methods — techniques the papers use, named apart from their topics

triplet loss · 1.5mask learning · 1.5heterogeneous graph transformer · 1.5
YearPublicationVenuePosition
2024 SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning
abstract
Graph-based fraud detection has widespread application in modern industry scenarios, such as spam review and malicious account detection. While considerable efforts have been devoted to designing adequate fraud detectors, the interpretability of their results has often been overlooked. Previous works have attempted to generate explanations for specific instances using post-hoc explaining methods such as a GNNExplainer. However, post-hoc explanations can not facilitate the model predictions and the computational cost of these methods cannot meet practical requirements, thus limiting their application in real-world scenarios. To address these issues, we propose SEFraud, a novel graph-based self-explainable fraud detection framework that simultaneously tackles fraud detection and result in interpretability. Concretely, SEFraud first leverages customized heterogeneous graph transformer networks with learnable feature masks and edge masks to learn expressive representations from the informative heterogeneously typed transactions. A new triplet loss is further designed to enhance the performance of mask learning. Empirical results on various datasets demonstrate the effectiveness of SEFraud as it shows considerable advantages in both the fraud detection performance and interpretability of prediction results. Specifically, SEFraud achieves the most significant improvement with 8.6% on AUC and 8.5% on Recall over the second best on fraud detection, as well as an average of 10x speed-up regarding the inference time. Last but not least, SEFraud has been deployed and offers explainable fraud detection service for the largest bank in China, Industrial and Commercial Bank of China Limited (ICBC). Results collected from the production environment of ICBC show that SEFraud can provide accurate detection results and comprehensive explanations that align with the expert business understanding, confirming its efficiency and applicability in large-scale online services.
Kaidi Li, Tianmeng Yang, Min Zhou 0006, Jiahao Meng, Shendi Wang, Yihui Wu, Boshuai Tan, Lujia Pan, Fan Yu 0004, Zhenli Sheng, Yunhai Tong
KDD6
2013 Traffic sign detection based on convolutional neural networks
abstract
We propose an approach for traffic sign detection based on Convolutional Neural Networks (CNN). We first transform the original image into the gray scale image by using support vector machines, then use convolutional neural networks with fixed and learnable layers for detection and recognition. The fixed layer can reduce the amount of interest areas to detect, and crop the boundaries very close to the borders of traffic signs. The learnable layers can increase the accuracy of detection significantly. Besides, we use bootstrap methods to improve the accuracy and avoid overfitting problem. In the German Traffic Sign Detection Benchmark, we obtained competitive results, with an area under the precision-recall curve(AUC) of 99.73% in the category “Danger”, and an AUC of 97.62% in the category “Mandatory”.
Yihui Wu, Jianmin Li 0001, Huaping Liu 0001, Xiaolin Hu 0001
IJCNN1