HZHangyu Zhu

Hangyu Zhu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hangyu Zhu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Behavior Tomographer: Identifying Hidden Cybercrimes by Behavior Interior Structure Modeling

    by Cheng Wang, Hangyu Zhu

    Identifying hidden cybercrimes is a challenging task, as these behaviors are often carefully planned by criminals with counter-surveillance awareness. Existing solutions for cybercrime detection struggle to uncover enough clues to identify hidden criminal behaviors. Malicious behaviors are concealed beneath benign behaviors, and the boundaries between malicious and benign behaviors in the representation space are blurred to evade mainstream deep learning-based security authentication models. We introduce a behavior tomographer (BT) to reconstruct the behavior structure from three slices: agent, event, and attribute slices, enabling more granular detection of hidden cybercrimes. The core idea of BT is to reconstruct interior information about behavior structure from multiple slices, much like computed tomography in modern medicine enables the reconstruction of internal body. It enables the extraction of discriminative information from intricate interior associations between behavioral attributes rather than surface information meticulously crafted by criminals. Our experiments are conducted on two representative cybercrime datasets. Promising experimental results demonstrate that BT outperforms state-of-the-art models on key metrics, achieving around 0.99 AUC-ROC and approximately 0.9 AUC-PR. Moreover, BT notably excels at low false positive rates, showcasing its high effectiveness for real-world applications.


  • X-Trafformer: A Unified Variable-Term Prediction for Object-Generalized Traffic in Network Services

    by Cheng Wang, Hangyu Zhu, Kaixin Chu

    Traffic prediction acts as a fundamental function in the management and optimization of networks and services. There are emerging requirements for extraordinary traffic prediction, including variable-term traffic series and comprehensive traffic behavior. Compared to ordinary traffic prediction, these demands call for solutions to mine rich information and predict business load under broader conditions. In this work, we propose X-Trafformer, a graph spatiotemporal transformer model, for extraordinary traffic prediction. Unlike conventional techniques that model traffic sequences, we transform traffic sequences into traffic behaviors under generalized objects, where behaviors are initiated by generalized objects and possess specific behavioral attributes. It allows for the prediction of multiple variables in traffic data across different networks and services, leveraging the matching of behavioral attributes among behavior objects and events. X-Trafformer incorporates multiple interrelated graph structures to capture fine-grained attribute spatiotemporal associations and coarse-grained object spatiotemporal distributions, forming the foundation for accurate prediction. Evaluation on real and representative traffic scenarios (communication traffic from Italian Telecom and business traffic from Tmall) demonstrates X-Trafformer's exceptional prediction performance at low computational costs.


  • Detecting Evolving Fraudulent Behavior in Online Payment Services: Open-Category and Concept-Drift

    by Hangyu Zhu, Cheng Wang, Songyao Chai

    The convenience offered by the Internet accelerates the evolution of fraudulent behavior during facilitating the rapid development of online payment services. Fraudsters can change their behavior patterns frequently and at a low cost in the online space, allowing them to evade regulatory oversight. This poses a significant challenge for meticulously trained learning-based security applications for fraud detection and can lead to serious social security risks. Most of them depend on the static learning paradigm, which trains a model over a static training dataset and deploys the trained model for inference with the frozen model parameters under the i.i.d. assumption. To stay ahead of the rapidly evolving fraud, researchers have been exploring models with low latency and fast response capabilities to effectively combat fraudulent behavior. Unfortunately, the evolving fraud is not only reflected in the drift of their superimposed risk features but also in the openness of their category. The interweaving of open- category and concept-drift accelerates the process of existing security methods becoming powerless. In this paper, we propose EvoFD, an online evolving fraud detection framework to enable continual learning to cope with undercurrent surges of evolving fraud. The core idea of EvoFD is to weaken the bias caused by the anchoring effect on the learned information. It learns in an online streaming fashion by using instructive representations as anchors. Specially, we maintain the progressively updatable class anchors and optimize the representation network to embed features and class anchors into a unified normalized space, where the training and predicting can be conducted simultaneously or independently. In the framework, we preserve the balanced replay memory for each class to accumulate knowledge and avoid forgetting. The advantages of our method are validated by extensive experiments over the real-world dataset from a prestigious bank.


  • Open Access

    Behavioral authentication for security and safety

    by Cheng Wang, Hao Tang, Hangyu Zhu, Junhan Zheng, Changjun Jiang

    The issues of both system security and safety can be dissected integrally from the perspective of behavioralappropriateness. That is, a system that is secure or safe can be judged by whether the behavior of certain agent(s) isappropriateor not. Specifically, a so-calledappropriate behaviorinvolves the right agent performing the right actions at the right time under certain conditions. Then, according to different levels of appropriateness and degrees of custodies, behavioral authentication can be graded into three levels,i.e., the authentication of behavioralIdentity,Conformity, andBenignity. In a broad sense, for the security and safety issue, behavioral authentication is not only an innovative and promising method due to its inherent advantages but also a critical and fundamental problem due to the ubiquity of behavior generation and the necessity of behavior regulation in any system. By this classification, this review provides a comprehensive examination of the background and preliminaries of behavioral authentication. It further summarizes existing research based on their respective focus areas and characteristics. The challenges confronted by current behavioral authentication methods are analyzed, and potential research directions are discussed to promote the diversified and integrated development of behavioral authentication.


  • Collaborative Prediction in Anti-Fraud System Over Multiple Credit Loan Platforms

    by Cheng Wang, Hao Tang, Hangyu Zhu, Changjun Jiang

    Anti-fraud engineering for online credit loan (OCL) platforms is getting more challenging due to the developing specialization of gang fraud. Associations are critical features referring to assessing the credibility of loan applications for OCL fraud prediction. State-of-the-art solutions employ graph-based methods to mine hidden associations among loan applications effectively. They perform well based on the information asymmetry which is guaranteed by the huge advantage of platforms over fraudsters in terms of data quantity and quality at their disposal. The inherent difficulty that can be foreseen is the data isolation caused by mistrust between multiple platforms and data control legislations for privacy preservation. To maintain the advantage owned by the platforms, we design a privacy-preserving distributed graph learning framework that ensures critical association repairs by merging parameter sharing and data sharing. Specially, we propose the association reconstruction mechanism (ARM) that consists of the devised exploration, processing, transmission and utilization schemes to realize data sharing. For parameter sharing, we design a hybrid encryption technique to protect privacy during collaboratively learning graph neural network (GNN) models among different financial client platforms. We conduct the experiments over real-life data from large financial platforms. The results demonstrate the effectiveness and efficiency of our proposed methods.


  • Enabling Fraud Prediction on Preliminary Data Through Information Density Booster

    by Hangyu Zhu, Cheng Wang

    In online lending services, fraud prediction is an especially critical step to control loss risk and improve processing efficiency. Unfortunately, it is definitely challenging since the ex-ante prediction actually needs to be made only based on the most basic information of applicants. This work figures out that the essential difficulty here is the low information density of data associations which contain the useful information for fraud prediction. Accordingly, we propose a novel multi-stage data representation scheme, called AI2Vec (Applicant Information Vectoring), as an information density booster. It can gradually boost information density of associations by simultaneously decreasing the scale of information carriers and increasing the amount of useful information. The qualified performance of our AI2Vec is validated by the experiments over real-life data from a prestigious online lending platform. It can help commonly-used machine learning classifiers outperform the state-of-the-art methods, including the method of pilot platform with manual feature engineering by the subject matter experts.


  • Wrongdoing Monitor: A Graph-Based Behavioral Anomaly Detection in Cyber Security

    by Cheng Wang, Hangyu Zhu

    The so-called behavioral anomaly detection (BAD) is expected to solve effectively a variety of security issues by detecting the deviances from normal behavioral patterns of protected agents. We propose a new graph-based behavioral modeling paradigm for BAD problem, named behavioral identification graph (BIG), which has distinct advantages over existing methods by mining deeply the property-level (as an enhancement to the event-level ) associations in behavioral data. Under BIG, the behavioral properties and their co-occurrence associations in behavioral data are modeled as the entities and relationships of graph, respectively; furthermore, behavioral properties and events are both vectorized by a devised event-property composite model, and the behavioral patterns of agents are finally represented as a multidimensional spatial distribution of behavioral properties. Consequently, for a behavior, the intensity of its behavioral anomaly can be transformed into the spatial decentrality of its behavioral agent and properties which contain both fine-grained information between behavioral properties and coarse-grained information between behavioral events. To the best of our knowledge, this is the first work to improve behavioral modeling for anomaly detection by integrating inter (event-level) and intra (property-level) associations of behaviors into a unified graph and space. Our method is validated by four representative security issues, i.e., fraud detection in online payment services (by transaction behaviors), intrusion detection in network communication services (by traffic behaviors), insider threat detection in organizational information systems (by system behaviors), and compromise detection in social networking services (by trajectory behaviors).


  • CAeSaR: An Online Payment Anti-Fraud Integration System With Decision Explainability

    by Cheng Wang, Songyao Chai, Hangyu Zhu, Changjun Jiang

    In data-driven anti-fraud engineering for online payment services, the integration of proper function modules is an effective way to further improve detection performance by overcoming the inability of single-function methods to cope with complex and varied frauds. However, a qualified integration is really inaccessible under multiple demanding requirements, i.e., improving detection performance, ensuring decision explainability, and limiting processing latency and computing consumption. In this work, we propose a qualified integration system, named CAeSaR, that can simultaneously meet all of the above requirements. This satisfactory result is achieved by the cooperation of two innovative techniques. The first is a novel three-way taxonomy of function division, called TRTPT, according to the temporal positions of transactions relative to a reference fraudulent transaction. Based on TRTPT, CAeSaR can introduce three kinds of anti-fraud function modules which collaboratively cover all types of frauds theoretically. The second is an effective integration scheme, called TELSI. It generates the candidate decision strategies by combining the judgments of three function modules by only two simple logical connectives, which essentially ensures the decision explainability. Particularly, TELSI can assign the most effective decision strategy to the corresponding transaction adaptively by a devised stacking-based multi-classification. The advantages of CAeSaR are validated in practice over real-life data from a prestigious bank.


  • LongArms: Fraud Prediction in Online Lending Services Using Sparse Knowledge Graph

    by Cheng Wang, Hangyu Zhu, Ruixin Hu, Rui Li, Changjun Jiang

    Gang fraud, the major and primary security issue in online lending services, can be efficiently solved by the data-driven paradigm that is recognized as a promising solution for online lending gang fraud prediction. However, it is challenging that such predictions need to detect evolving and increasingly impalpable fraud patterns based on low-quality data, i.e., very preliminary and coarse applicant information. The technical difficulty mainly stems from two factors: the extreme \emph{deficiency of information associations} and \emph{weakness of data labels}. In this work, we mainly address the challenges by enhancing the utility of associations (i.e., \emph{recovering missing associations} and \emph{mining underlying associations}) on a knowledge graph. Specifically, we first propose an efficient method of Chinese address disambiguation to recover some critical associations that are broken by the ambiguity of applicant information, e.g., address related information. Then, to mine the implicit associations, we design a novel association representation method, called \emph{Adaptive Connected Component Embedding Simplification Scheme} (ACCESS), which can adaptively implement embedding for different connected components depending on their sizes. The good performance is validated by the experiments on a real-world dataset from a commercial lending company. Meanwhile, we provide a visual decision support system named \emph{LongArms} over the RMCP framework.