mlsanityData to 7 Oct 2026

Modeling Users' Behavior Sequences with Hierarchical Explainable Network for Cross-domain Fraud Detection

arXiv 2201.01004 ↗First posted 4 Jan 2022cs.LG cs.AI cs.IRcited by 13

Not on the map. Why?

Abstract (arXiv)

With the explosive growth of the e-commerce industry, detecting online transaction fraud in real-world applications has become increasingly important to the development of e-commerce platforms. The sequential behavior history of users provides useful information in differentiating fraudulent payments from regular ones. Recently, some approaches have been proposed to solve this sequence-based fraud detection problem. However, these methods usually suffer from two problems: the prediction results are difficult to explain and the exploitation of the internal information of behaviors is insufficient. To tackle the above two problems, we propose a Hierarchical Explainable Network (HEN) to model users' behavior sequences, which could not only improve the performance of fraud detection but also make the inference process interpretable. Meanwhile, as e-commerce business expands to new domains, e.g., new countries or new markets, one major problem for modeling user behavior in fraud detection systems is the limitation of data collection, e.g., very few data/labels available. Thus, in this paper, we further propose a transfer framework to tackle the cross-domain fraud detection problem, which aims to transfer knowledge from existing domains (source domains) with enough and mature data to improve the performance in the new domain (target domain). Our proposed method is a general transfer framework that could not only be applied upon HEN but also various existing models in the Embedding & MLP paradigm. Based on 90 transfer task experiments, we also demonstrate that our transfer framework could not only contribute to the cross-domain fraud detection task with HEN, but also be universal and expandable for various existing models.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 20 of its 46 references that are in the map. First posted on arXiv 4 Jan 2022.

Builds on

20 of 46 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  3. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
  4. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
  5. 2019A Comprehensive Survey on Transfer Learningcited by 1,154
  6. 2016Wide & Deep Learning for Recommender Systemscited by 745
  7. 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
  8. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  9. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  10. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  11. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  12. 2015Simultaneous Deep Transfer Across Domains and Taskscited by 205
8 more
  1. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  2. 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
  3. 2019EKT: Exercise-aware Knowledge Tracing for Student Performance Predictioncited by 109
  4. 2018Balanced Distribution Adaptation for Transfer Learningcited by 32
  5. 2018Learning from History and Present: Next-item Recommendation via Discriminatively Exploiting User Behaviorscited by 27
  6. 2019Towards Neural Mixture Recommender for Long Range Dependent User Sequencescited by 15
  7. 2019Transfer Meets Hybrid: A Synthetic Approach for Cross-Domain Collaborative Filtering with Textcited by 8
  8. 2018Sequential Behavioral Data Processing Using Deep Learning and the Markov Transition Field in Online Fraud Detectioncited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 2; 2024: 5; 2025: 1; 2026: 1.

13 papers.

Sort: