JYJian Yang

Jian Yang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jian Yang has a total of 380 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Is the Last Check-In All You Need? Next POI Recommendation: Recall and Rerank

    by Zhengjia Xu, Dingyang Lyu, Zitai Qiu, Shan Xue, Jian Yang, Jia Wu

  • Self-expression property theory guided multi-modal brain graph learning

    by Xuexiong Luo, Jia Wu, Sheng Zhang, Jian Yang, Amin Beheshti, Bo Du, Shan Xue, Quan Z. Sheng

  • Open Access

    Beyond Smoothing: A Discriminative Enhanced Aggregation Graph Neural Network for Camouflaged Fraud Detection

    by Venus Haghighi, Behnaz Soltani, Lina Yao, Jia Wu, Jian Yang, Quan Z. Sheng

    Graph Neural Networks (GNNs) have been widely used for learning representations of graph-structured data, achieving remarkable success in various graph-related Web applications, such as fraud detection. To generate node representations, GNN-based models operate message-passing mechanisms that aim to smooth the learned representations in a local neighborhood. However, fraudsters increasingly employ sophisticated “camouflage” tactics, exhibiting normal behaviors by strategically forming numerous connections with legitimate entities. As a result, existing GNN-based methods struggle to effectively tackle such fraudulent activities due to their reliance on homophily-based message-passing architectures. These methods fail to generate discriminative representations, which is crucial for distinguishing fraudsters from benign entities. To address this problem, we propose a novel Discriminative Enhanced Aggregation Graph Neural Network-based FraudDEtectioNMoDel (DEFEND) . DEFEND incorporates tailored discriminative mechanisms that strengthen representation learning at two complementary levels: (i) intra-relation and (ii) inter-relation. While prior approaches primarily focus on intra-relation patterns and overlook inter-relation information, DEFEND integrates both to capture subtle inconsistencies in fraudster behavior. Specifically, an edge discriminating mechanism classifies neighborhoods into homophily or heterophily-based views by leveraging node attributes and structural characteristics, and a camouflage-aware dual-channel aggregation module captures different frequencies of information tailored to these views to generate rich intra-relation node representations. While prior approaches typically rely on intra-relation information within each relation type, they overlook the discriminative signals that arise from correlations across different relations. In DEFEND, we observe that fraudsters often avoid forming consistent cross-relation interactions, whereas benign entities tend to establish them more frequently. This discrepancy creates a distinctive behavioral pattern. To capture this, we introduce an inter-relation correlation mechanism that correlates a node’s intra-relation representations across multiple relation types using an attention-based weighting scheme. By adaptively weighing the importance of each relation and integrating their contributions, DEFEND enhances the discriminative power of node representations. This mechanism enables the model to leverage both intra-relation and inter-relation levels of information, leading to richer and more robust representations for fraud detection. Finally, a multi-relation combination module aggregates information across different relation types, emphasizing the importance of node–relation pairs in the embedding. We conducted extensive experiments on two real-world fraud datasets to demonstrate the effectiveness of our proposed model, and our results show that DEFEND outperforms the state-of-the-art baselines. The source codes and datasets of our work are available at https://github.com/VenusHaghighi/DEFEND .


  • Open Access

    LHG: LLM-enhanced and Heterogeneous Graph-induced for Unsupervised Social Event Detection

    by Zitai Qiu, Rongwei Xu, Congbo Ma, Shan Xue, Jian Yang, Guanfeng Liu, Quan Z. Sheng, Amin Beheshti, Jia Wu

  • Open Access

    They Said Memes Were Harmless --- We Found the Ones That Hurt: Decoding Jokes, Symbols, and Cultural References

    by Sahil Tripathi, Gautam Siddharth Kashyap, Mehwish Nasim, Jian Yang, Jiechao Gao, Usman Naseem


  • Open Access

    Revisiting Graph-Level Anomaly Detection: From Partially to Fully Unsupervised Learning

    by Zhenyu Yang, Ge Zhang, Shan Xue, Xiaoxiao Ma, Jian Yang, Hao Peng, Amin Beheshti, Jia Wu

    Graph-level anomaly detection (GLAD) is a critical task to identify graphs with abnormal properties in various domains, ranging from fraudulent social networks to malicious botnets on online platforms. The dominant paradigm for existing GLAD detectors has been partially unsupervised, relying on training data composed exclusively of normal samples. However, this partially unsupervised paradigm inevitably requires a costly expert filtering process to ensure the training data is free of anomalies. This creates a significant gap between current approaches and the real-world necessity of a fully unsupervised paradigm, which involves training a model directly on real-world data ''as-is'', with its inherent mix of normal and anomalous samples. To bridge this gap, we incorporate uncertainty learning into GLAD to promote fully unsupervised learning. We propose two frameworks: Score Uncertainty Learning (SUL) and Graph-data Uncertainty Learning (GUL). Specifically, SUL enhances existing GLAD detectors by modeling uncertainty through Gaussian distributions over the detectors' predictions, adaptively attenuating the influence of potential anomalies. GUL is an end-to-end framework that iteratively optimizes anomaly detection and uncertainty modeling via an Expectation-Maximization algorithm. In addition, we develop a dedicated loss that utilizes potential anomalies to enhance the effectiveness and robustness of GUL. Empirical results on sixteen benchmark datasets, covering real-world graphs from social networks and online platforms, demonstrate the superiority of our methods and highlight the promise of incorporating uncertainty into fully unsupervised GLAD.

  • Real-Time Multi-Modal Social Event Detection: A New Dataset and a Key Instance-Driven, Quality-Aware Graph Neural Network

    by Yifei Han, Congbo Ma, Shan Xue, Jian Yang, Jia Wu

    Social event detection (SED) involves identifying and analyzing significant real-world events using data generated on social media platforms. With the rapid growth of platforms like Weibo and Twitter, users are sharing not just text but also images. However, most existing SED methods remain text-focused, limiting their ability to fully capture the complexity of real-world social dynamics. Moreover, the lack of multi-modal datasets specifically designed for SED has blocked the development of models that can effectively exploit these rich content types. To address these limitations, we introduced WEIBO2022, an extensive multi-modal SED dataset that includes both text and image data. The dataset is available in two versions: WEIBO2022-Medium, containing 25,435 entries and WEIBO2022-Large, containing 79,825 entries. In addition, we presented a novel network called the Key Instance-driven, Quality-aware Graph Neural Network (KQGNN), which features a key instance-driven library, a quality-aware learning process, and a multi-modal fusion module, enhancing its ability to detect events accurately in both offline and real-time settings. Extensive experiments showcase the exceptional performance and superiority of the proposed model, showing improvements in detection accuracy and effective prevention of catastrophic forgetting during continuous training.

  • Extract and Refine Brain Subgraph for Disorder Analysis via Cross-Domain Learning

    by Xuexiong Luo, Jia Wu, Sheng Zhang, Guangwei Dong, Shan Xue, Hao Peng, Jian Yang, Chuan Zhou, Wenbin Hu, Amin Beheshti

    Brain graphs (brain connectivity networks) play an important role in modeling the complex structure of the human brain. Furthermore, brain graph learning based on graph neural networks (GNNs) has recently attracted growing interest. Although existing methods have made great progress in brain disorder prediction and pathogenic analysis, there are two key problems: (1) They rarely utilize the pathogenic reason of brain disorders, that is, salient brain regions always lead to abnormal connections between brain regions, to extract critical brain graph information for disorder analysis; (2) Since most of the available brain graph data is limited, how can we improve the performance of brain graph learning models on insufficient training data? Thus, in this paper, we learn brain graph representations for disorder prediction and analyze disorder-specific brain regions and connections from the subgraph perspective. Besides, we introduce the cross-domain brain graph learning framework to alleviate the problem of poor model performance on limited data. To consider the pathogenic reason by brain subgraphs, we first propose the node entropy of brain graphs based on brain graph properties to extract important nodes. We then introduce subgraph information bottleneck to refine the critical subgraph from the rough subgraph generated by these important nodes, recognizing important connections related to disorders. To achieve a better model performance on limited data, we design a cross-domain brain graph learning framework to improve the subgraph extraction model by the meta-learning method. The subgraph extraction model is pre-trained on a large source training dataset and then quickly adapted to target task dataset. Besides, a simple yet effective feature alignment module is applied to mitigate the negative transfer problem for cross-domain datasets. Extensive experimental results, including disorder prediction and pathogenic analysis on real-world neuroimaging data, demonstrate the effectiveness of our method.


  • A Bidirectional Feedback Actor–Critic Approach for Collaborative Target Search in Heterogeneous Intelligent Agent Systems

    by Xin Cao, He Luo, Guoqiang Wang, Shan Xue, Jian Yang, Amin Beheshti, Jia Wu

    In target search tasks such as post-disaster rescue, collaboration between unmanned aerial vehicles and unmanned ground vehicles can significantly improve search efficiency. This study proposes an air–ground heterogeneous unmanned system cooperative search method termed bidirectional feedback actor–critic (BiF-AC). The key innovation lies in integrating aerial wide-area coverage with precise ground positioning to design a point-area combined search mechanism. A dynamic Voronoi-based method is further adopted to enhance collaboration within heterogeneous systems. Considering the characteristics of the target search problem, an actor–critic framework is introduced for agent training, bidirectional information interaction is employed, and a multilevel feedback reward function is constructed to ensure efficient search performance in diverse environments. Experimental results show that BiF-AC improves the target search success rates by an average of 40.3% and reduces search steps by 21.3% compared with other baseline algorithms. This research offers theoretical support and implementation paths for intelligent unmanned systems in emergency search, environmental monitoring, and related fields.