Jia Wu

AAAI Conference 2026 Conference Paper

Can Molecular Evolution Mechanism Enhance Molecular Representation?

• Kun Li
• Longtao Hu
• Jiameng Chen
• Hongzhi Zhang
• Yida Xiong
• Xiantao Cai
• Wenbin Hu
• Jia Wu

Molecular evolution is the process of simulating the natural evolution of molecules in chemical space to explore potential molecular structures and properties. The relationships between similar molecules are often described through transformations such as adding, deleting, and modifying atoms and chemical bonds, reflecting specific evolutionary paths. Existing molecular representation methods mainly focus on mining data, such as atomic-level structures and chemical bonds directly from the molecules, often overlooking their evolutionary history. Consequently, we aim to explore the possibility of enhancing molecular representations by simulating the evolutionary process. We extract and analyze the changes in the evolutionary pathway and explore combining it with existing molecular representations. Therefore, this paper proposes the molecular evolutionary network (MEvoN) for molecular representations. First, we construct the MEvoN using molecules with a small number of atoms and generate evolutionary paths utilizing similarity calculations. Then, by modeling the atomic-level changes, MEvoN reveals their impact on molecular properties. Experimental results show that the MEvoN-based molecular property prediction method significantly improves the performance of traditional end-to-end algorithms by approximately 33% on both the QM7 and QM9 datasets.

AAAI Conference 2026 Conference Paper

Sequence-Free for Compound Protein Interaction Prediction

• Hongzhi Zhang
• Jiameng Chen
• Kun Li
• Yida Xiong
• Xiantao Cai
• Wenbin Hu
• Jia Wu

The prediction of compound–protein interactions (CPIs) is crucial for drug discovery. Most existing CPI prediction models rely on protein sequence information as input. However, in early-stage drug development, particularly in phenotype-driven studies or compound-response analyses, proteins are often annotated only with functional labels, and their sequences remain undetermined. Consequently, current methods are inapplicable in such scenarios. Furthermore, our experiments find that even when large-scale perturbations were applied to protein sequences, the predictive performance of the existing models did not show a significant decline. It indicates that the high investment in sequencing may not bring corresponding returns. To address the above issues, we propose an inexpensive, protein-sequencing-free framework BioText-CPI, based on the Biomedical Textual description of protein for CPI prediction. Firstly, during the pre-training stage of the model, we use contrastive learning to align protein texts and sequence modalities. Subsequently, we add biological text descriptions of proteins to the existing public CPI dataset to construct a new CPI dataset. Finally, in the CPI prediction stage, the sequence and biomedical text descriptions of proteins can be used as the input for CPI prediction either separately or simultaneously to meet the application requirements of different scenarios. The experiments demonstrate that BioText-CPI achieves comparable effects to the traditional methods when only the biomedical description of protein is input. Moreover, when the two modalities of protein information are input simultaneously, BioText-CPI achieves state-of-the-art performance across multiple scenarios.

IJCAI Conference 2025 Conference Paper

Antibody Design and Optimization with Multi-scale Equivariant Graph Diffusion Models for Accurate Complex Antigen Binding

• Jiameng Chen
• Xiantao Cai
• Jia Wu
• Wenbin Hu

Antibody design remains a critical challenge in therapeutic and diagnostic development, particularly for complex antigens with diverse binding interfaces. Current computational methods face two main limitations: (1) capturing geometric features while preserving symmetries, and (2) generalizing novel antigen interfaces. Despite recent advancements, these methods often fail to accurately capture molecular interactions and maintain structural integrity. To address these challenges, we propose AbMEGD, an end-to-end framework integrating Multi-scale Equivariant Graph Diffusion for antibody sequence and structure co-design. Leveraging advanced geometric deep learning, AbMEGD combines atomic-level geometric features with residue-level embeddings, capturing local atomic details and global sequence-structure interactions. Its E(3)-equivariant diffusion method ensures geometric precision, computational efficiency, and robust generalizability for complex antigens. Furthermore, experiments using the SAbDab database demonstrate a 10. 13% increase in amino acid recovery, 3. 32% rise in improvement percentage, and a 0. 062 Å reduction in root mean square deviation within the critical CDR-H3 region compared to DiffAb, a leading antibody design model. These results highlight AbMEGD's ability to balance structural integrity with improved functionality, establishing a new benchmark for sequence-structure co-design and affinity optimization. The code is available at: https: //github. com/Patrick221215/AbMEGD.

EAAI Journal 2025 Journal Article

Continuous–Discrete Alignment Optimization for efficient differentiable neural architecture search

• Wenbo Liu
• Jia Wu
• Tao Deng
• Fei Yan

AAAI Conference 2025 Conference Paper

Domain-Level Disentanglement Framework Based on Information Enhancement for Cross-Domain Cold-Start Recommendation

• Nian Rong
• Fei Xiong
• Shirui Pan
• Guixun Luo
• Jia Wu
• Liang Wang

Recommender systems in various applications often encounter the challenge of cold-start, which refers to how to provide recommendations for completely new users. Cross-domain recommendation offers a solution to address this cold-start issue by leveraging user interaction information from other domains and providing recommendations for users in the target domain. However, applying the classic two-tower model in cross-domain scenarios for pure cold-start users proves challenging, and most existing cross-domain cold-start recommendation models adopt an embedding-mapping framework that lacks end-to-end efficiency. The parallel training recommendation method lacks consideration of the domain-level intrinsic characteristics of cross-domain information. In this paper, we propose a generalized framework that Domain-level Disentanglement framework based on information enhancement for Cross-domain Cold-start Recommendation. On one hand, we achieve deep utilization of domain-level information through independent extraction of domain knowledge and fusion using heuristic strategies. On the other hand, our model is incorporated with an information enhancement network based on user attention and a user personalized adaptor. We introduce measures to assess user variability and immutability in cross-domain recommendation, aiming to eliminate inter-domain bias and highlight individual user preferences. Experimental results on widely used cross-domain recommendation datasets demonstrate that our proposed model outperforms state-of-the-art methods, validating its effectiveness.

IJCAI Conference 2025 Conference Paper

Exploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph

• Yuxiang Wang
• Xiao Yan
• Shiyu Jin
• Quanqing Xu
• Chuang Hu
• Yuanyuan Zhu
• Bo Du
• Jia Wu

Text-attributed graph (TAG) provides a text description for each graph node, and few- and zero-shot node classification on TAGs have many applications in fields such as academia and social networks. Existing work utilizes various graph-based augmentation techniques to train the node and text embeddings, while text-based augmentations are largely unexplored. In this paper, we propose Text Semantics Augmentation (TSA) to improve accuracy by introducing more text semantic supervision signals. Specifically, we design two augmentation techniques, i. e. , positive semantics matching and negative semantics contrast, to provide more reference texts for each graph node or text description. Positive semantic matching retrieves texts with similar embeddings to match with a graph node. Negative semantic contrast adds a negative prompt to construct a text description with the opposite semantics, which is contrasted with the original node and text. We evaluate TSA on 5 datasets and compare with 13 state-of-the-art baselines. The results show that TSA consistently outperforms all baselines, and its accuracy improvements over the best-performing baseline are usually over 5%. The code is at https: //github. com/wyx11112/TSA.

IJCAI Conference 2025 Conference Paper

STAMImputer: Spatio-Temporal Attention MoE for Traffic Data Imputation

• Yiming Wang
• Hao Peng
• Senzhang Wang
• Haohua Du
• Chunyang Liu
• Jia Wu
• Guanlin Wu

Traffic data imputation is fundamentally important to support various applications in intelligent transportation systems such as traffic flow prediction. However, existing time-to-space sequential methods often fail to effectively extract features in block-wise missing data scenarios. Meanwhile, the static graph structure for spatial feature propagation significantly constrains the model's flexibility in handling the distribution shift issue for the nonstationary traffic data. To address these issues, this paper proposes a Spatio-Temporal Attention Mixture of experts network named STAMImputer for traffic data imputation. Specifically, we introduce a Mixture of Experts (MoE) framework to capture latent spatio-temporal features and their influence weights, effectively imputing block missing. A novel Low-rank guided Sampling Graph ATtention (LrSGAT) mechanism is designed to dynamically balance the local and global correlations across road networks. The sampled attention vectors are utilized to generate dynamic graphs that capture real-time spatial correlations. Extensive experiments are conducted on four traffic datasets for evaluation. The result shows STAMImputer achieves significantly performance improvement compared with existing SOTA approaches. Our codes are available at https: //github. com/RingBDStack/STAMImupter.

JBHI Journal 2024 Journal Article

Continuous Refinement-Based Digital Pathology Image Assistance Scheme in Medical Decision-Making Systems

• Jia Wu
• Tian Luo
• Jiachen Zeng
• Fangfang Gou

Digital pathology images' extensive cellular information provide a trustworthy foundation for tumor diagnosis. With the aid of computer-aided diagnostics, pathologists can locate crucial information more quickly. The cascade structure refines the segmentation results by utilizing its multi-task and multi-stage characteristics. However, cascade-based models require downsampling and cropping of patches during the inference process due to the ultra-high resolution and complex structure of pathology images. This not only increases the cost and computation time but also results in the loss of cellular details and corrupts the global contextual information. This study proposes a Digital Pathology Image Assistance Program (CRSDPI) for medical decision-making systems that is based on continuous improvement. After locating the region of interest using the maximum inter-class variance method, the pictures are preprocessed to account for the impacts of staining inconsistencies and sensitivity variations on the model's performance. Ultimately, we create a two-phase continuously refined segmentation network (TCRNet) by combining an enhanced continuous refinement model with a coarse segmentation network built on a pyramid scene parsing network. The coarse segmentation network introduces an auxiliary loss term to speed up convergence, and the refined model introduces an implicit function to reduce computational cost and reconstruct more details. The TCRNet model refines the target by successively aligning the features without the need to take cascading decoder operations after encoder. Experiments conducted on digital pathology images of breast cancer and osteosarcoma demonstrate the superior prediction accuracy and computational speed of our strategy.

IJCAI Conference 2024 Conference Paper

Contrastive Learning Drug Response Models from Natural Language Supervision

• Kun Li
• Xiuwen Gong
• Jia Wu
• Wenbin Hu

Deep learning-based drug response prediction (DRP) methods can accelerate the drug discovery process and reduce research and development costs. Despite their high accuracy, generating regression-aware representations remains challenging for mainstream approaches. For instance, the representations are often disordered, aggregated, and overlapping, and they fail to characterize distinct samples effectively. This results in poor representation during the DRP task, diminishing generalizability and potentially leading to substantial costs during the drug discovery. In this paper, we propose CLDR, a contrastive learning framework with natural language supervision for the DRP. The CLDR converts regression labels into text, which is merged with the drug response caption as a second sample modality instead of the traditional modes, i. e. , graphs and sequences. Simultaneously, a common-sense numerical knowledge graph is introduced to improve the continuous text representation. Our framework is validated using the genomics of drug sensitivity in cancer dataset with average performance increases ranging from 7. 8% to 31. 4%. Furthermore, experiments demonstrate that the proposed CLDR effectively maps samples with distinct label values into a high-dimensional space. In this space, the sample representations are scattered, significantly alleviating feature overlap. The code is available at: https: //github. com/DrugD/CLDR.

IJCAI Conference 2024 Conference Paper

Graph Neural Networks for Brain Graph Learning: A Survey

• Xuexiong Luo
• Jia Wu
• Jian Yang
• Shan Xue
• Amin Beheshti
• Quan Z. Sheng
• David McAlpine
• Paul Sowman

Exploring the complex structure of the human brain is crucial for understanding its functionality and diagnosing brain disorders. Thanks to advancements in neuroimaging technology, a novel approach has emerged that involves modeling the human brain as a graph-structured pattern, with different brain regions represented as nodes and the functional relationships among these regions as edges. Moreover, graph neural networks (GNNs) have demonstrated a significant advantage in mining graph-structured data. Developing GNNs to learn brain graph representations for brain disorder analysis has recently gained increasing attention. However, there is a lack of systematic survey work summarizing current research methods in this domain. In this paper, we aim to bridge this gap by reviewing brain graph learning works that utilize GNNs. We first introduce the process of brain graph modeling based on common neuroimaging data. Subsequently, we systematically categorize current works based on the type of brain graph generated and the targeted research problems. To make this research accessible to a broader range of interested researchers, we provide an overview of representative methods and commonly used datasets, along with their implementation sources. Finally, we present our insights on future research directions. The repository of this survey is available at https: //github. com/XuexiongLuoMQ/Awesome-Brain-Graph-Learning-with-GNNs.

TMLR Journal 2024 Journal Article

Temporally Rich Deep Learning Models for Magnetoencephalography

• Tim Chard
• Mark Dras
• Paul Sowman
• Steve Cassidy
• Jia Wu

Deep learning has been used in a wide range of applications, but it has only very recently been applied to Magnetoencephalography (MEG). MEG is a neurophysiological technique used to investigate a variety of cognitive processes such as language and learning, and an emerging technology in the quest to identify neural correlates of cognitive impairments such as those occurring in dementia. Recent work has shown that it is possible to apply deep learning to MEG to categorise induced responses to stimuli across subjects. While novel in the application of deep learning, such work has generally used relatively simple neural network (NN) models compared to those being used in domains such as computer vision and natural language processing. In these other domains, there is a long history in developing complex NN models that combine spatial and temporal information. We propose more complex NN models that focus on modelling temporal relationships in the data, and apply them to the challenges of MEG data. We apply these models to an extended range of MEG-based tasks, and find that they substantially outperform existing work on a range of tasks, particularly but not exclusively temporally-oriented ones. We also show that an autoencoder-based preprocessing component that focuses on the temporal aspect of the data can improve the performance of existing models. Our source code is available at https://github.com/tim-chard/DeepLearningForMEG.

IJCAI Conference 2024 Conference Paper

Where to Mask: Structure-Guided Masking for Graph Masked Autoencoders

• Chuang Liu
• Yuyao Wang
• Yibing Zhan
• Xueqi Ma
• Dapeng Tao
• Jia Wu
• Wenbin Hu

Graph masked autoencoders (GMAE) have emerged as a significant advancement in self-supervised pre-training for graph-structured data. Previous GMAE models primarily utilize a straightforward random masking strategy for nodes or edges during training. However, this strategy fails to consider the varying significance of different nodes within the graph structure. In this paper, we investigate the potential of leveraging the graph's structural composition as a fundamental and unique prior in the masked pre-training process. To this end, we introduce a novel structure-guided masking strategy (i. e. , StructMAE), designed to refine the existing GMAE models. StructMAE involves two steps: 1) Structure-based Scoring: Each node is evaluated and assigned a score reflecting its structural significance. Two distinct types of scoring manners are proposed: predefined and learnable scoring. 2) Structure-guided Masking: With the obtained assessment scores, we develop an easy-to-hard masking strategy that gradually increases the structural awareness of the self-supervised reconstruction task. Specifically, the strategy begins with random masking and progresses to masking structure-informative nodes based on the assessment scores. This design gradually and effectively guides the model in learning graph structural information. Furthermore, extensive experiments consistently demonstrate that our StructMAE method outperforms existing state-of-the-art GMAE models in both unsupervised and transfer learning tasks. Codes are available at https: //github. com/LiuChuang0059/StructMAE.

IJCAI Conference 2024 Conference Paper

Zero-shot Learning for Preclinical Drug Screening

• Kun Li
• Weiwei Liu
• Yong Luo
• Xiantao Cai
• Jia Wu
• Wenbin Hu

Conventional deep learning methods typically employ supervised learning for drug response prediction (DRP). This entails dependence on labeled response data from drugs for model training. However, practical applications in the preclinical drug screening phase demand that DRP models predict responses for novel compounds, often with unknown drug responses. This presents a challenge, rendering supervised deep learning methods unsuitable for such scenarios. In this paper, we propose a zero-shot learning solution for the DRP task in preclinical drug screening. Specifically, we propose a Multi-branch Multi-Source Domain Adaptation Test Enhancement Plug-in, called MSDA. MSDA can be seamlessly integrated with conventional DRP methods, learning invariant features from the prior response data of similar drugs to enhance real-time predictions of unlabeled compounds. The results of experiments on two large drug response datasets showed that MSDA efficiently predicts drug responses for novel compounds, leading to a general performance improvement of 5-10% in the preclinical drug screening phase. The significance of this solution resides in its potential to accelerate the drug discovery process, improve drug candidate assessment, and facilitate the success of drug discovery. The code is available at https: //github. com/DrugD/MSDA.

JBHI Journal 2023 Journal Article

A Medically Assisted Model for Precise Segmentation of Osteosarcoma Nuclei on Pathological Images

• Jia Wu
• Tingyu Yuan
• Jiachen Zeng
• Fangfang Gou

Osteosarcoma is the most common malignant bone tumor with a high degree of malignancy and misdiagnosis rates. Pathological images are crucial for its diagnosis. However, underdeveloped regions currently lack sufficient high-level pathologists, leading to uncertain diagnostic accuracy and efficiency. Existing research on pathological image segmentation often neglects the differences in staining styles and lack of data, without considering medical backgrounds. To alleviate the difficulty in diagnosing osteosarcoma in underdeveloped areas, an intelligent assisted diagnosis and treatment scheme for osteosarcoma pathological images, ENMViT, is proposed. ENMViT utilizes KIN to achieve normalization of mismatched images with limited GPU resources and uses traditional data enhancement methods, such as cleaning, cropping, mosaic, Laplacian sharpening, and other techniques to alleviate the issue of insufficient data. A multi-path semantic segmentation network combining Transformer and CNN is used to segment images, and the degree of edge offset in the spatial domain is introduced into the loss function. Finally, noise is filtered according to the size of the connecting domain. This article experimented on more than 2000 osteosarcoma pathological images from Central South University. The experimental results demonstrate that this scheme performs well in each stage of the osteosarcoma pathological image processing, and the segmentation results' IoU index is 9. 4% higher than the comparative models, demonstrating its significant value in the medical industry.

IJCAI Conference 2023 Conference Paper

Cross-Domain Facial Expression Recognition via Disentangling Identity Representation

• Tong Liu
• Jing Li
• Jia Wu
• Lefei Zhang
• Shanshan Zhao
• Jun Chang
• Jun Wan

Most existing cross-domain facial expression recognition (FER) works require target domain data to assist the model in analyzing distribution shifts to overcome negative effects. However, it is often hard to obtain expression images of the target domain in practical applications. Moreover, existing methods suffer from the interference of identity information, thus limiting the discriminative ability of the expression features. We exploit the idea of domain generalization (DG) and propose a representation disentanglement model to address the above problems. Specifically, we learn three independent potential subspaces corresponding to the domain, expression, and identity information from facial images. Meanwhile, the extracted expression and identity features are recovered as Fourier phase information reconstructed images, thereby ensuring that the high-level semantics of images remain unchanged after disentangling the domain information. Our proposed method can disentangle expression features from expression-irrelevant ones (i. e. , identity and domain features). Therefore, the learned expression features exhibit sufficient domain invariance and discriminative ability. We conduct experiments with different settings on multiple benchmark datasets, and the results show that our method achieves superior performance compared with state-of-the-art methods.

IJCAI Conference 2023 Conference Paper

Don't Ignore Alienation and Marginalization: Correlating Fraud Detection

• Yilong Zang
• Ruimin Hu
• Zheng Wang
• Danni Xu
• Jia Wu
• Dengshi Li
• Junhang Wu
• Lingfei Ren

The anonymity of online networks makes tackling fraud increasingly costly. Thanks to the superiority of graph representation learning, graph-based fraud detection has made significant progress in recent years. However, upgrading fraudulent strategies produces more advanced and difficult scams. One common strategy is synergistic camouflage —— combining multiple means to deceive others. Existing methods mostly investigate the differences between relations on individual frauds, that neglect the correlation among multi-relation fraudulent behaviors. In this paper, we design several statistics to validate the existence of synergistic camouflage of fraudsters by exploring the correlation among multi-relation interactions. From the perspective of multi-relation, we find two distinctive features of fraudulent behaviors, i. e. , alienation and marginalization. Based on the finding, we propose COFRAUD, a correlation-aware fraud detection model, which innovatively incorporates synergistic camouflage into fraud detection. It captures the correlation among multi-relation fraudulent behaviors. Experimental results on two public datasets demonstrate that COFRAUD achieves significant improvements over state-of-the-art methods.

IJCAI Conference 2023 Conference Paper

Gapformer: Graph Transformer with Graph Pooling for Node Classification

• Chuang Liu
• Yibing Zhan
• Xueqi Ma
• Liang Ding
• Dapeng Tao
• Jia Wu
• Wenbin Hu

Graph Transformers (GTs) have proved their advantage in graph-level tasks. However, existing GTs still perform unsatisfactorily on the node classification task due to 1) the overwhelming unrelated information obtained from a vast number of irrelevant distant nodes and 2) the quadratic complexity regarding the number of nodes via the fully connected attention mechanism. In this paper, we present Gapformer, a method for node classification that deeply incorporates Graph Transformer with Graph Pooling. More specifically, Gapformer coarsens the large-scale nodes of a graph into a smaller number of pooling nodes via local or global graph pooling methods, and then computes the attention solely with the pooling nodes rather than all other nodes. In such a manner, the negative influence of the overwhelming unrelated nodes is mitigated while maintaining the long-range information, and the quadratic complexity is reduced to linear complexity with respect to the fixed number of pooling nodes. Extensive experiments on 13 node classification datasets, including homophilic and heterophilic graph datasets, demonstrate the competitive performance of Gapformer over existing Graph Neural Networks and GTs.

IJCAI Conference 2023 Conference Paper

Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities

• Chuang Liu
• Yibing Zhan
• Jia Wu
• Chang Li
• Bo Du
• Wenbin Hu
• Tongliang Liu
• Dacheng Tao

Graph neural networks have emerged as a leading architecture for many graph-level tasks, such as graph classification and graph generation. As an essential component of the architecture, graph pooling is indispensable for obtaining a holistic graph-level representation of the whole graph. Although a great variety of methods have been proposed in this promising and fast-developing research field, to the best of our knowledge, little effort has been made to systematically summarize these works. To set the stage for the development of future works, in this paper, we attempt to fill this gap by providing a broad review of recent methods for graph pooling. Specifically, 1) we first propose a taxonomy of existing graph pooling methods with a mathematical summary for each category; 2) then, we provide an overview of the libraries related to graph pooling, including the commonly used datasets, model architectures for downstream tasks, and open-source implementations; 3) next, we further outline the applications that incorporate the idea of graph pooling in a variety of domains; 4) finally, we discuss certain critical challenges facing current studies and share our insights on future potential directions for research on the improvement of graph pooling.

EAAI Journal 2023 Journal Article

Meta-GNAS: Meta-reinforcement learning for graph neural architecture search

• Yufei Li
• Jia Wu
• TianJin Deng

JBHI Journal 2022 Journal Article

A Cascaded Multi-Stage Framework for Automatic Detection and Segmentation of Pulmonary Nodules in Developing Countries

• Zhixun Zhou
• Fangfang Gou
• YanLin Tan
• Jia Wu

Lung cancer has the highest mortality rate among all malignancies. Non-micro pulmonary nodules are the primary manifestation of early-stage lung cancer. If patients can be detected with nodules in the early stage and receive timely treatment, their survival rate can be improved. Due to the large number of patients and limited medical resources, doctors take a longer time to make a diagnosis, which reduces efficiency and accuracy. Besides, there are no suitable approaches for developing countries. Therefore, we propose a 2. 5D-based cascaded multi-stage framework for automatic detection and segmentation (DS-CMSF) of pulmonary nodules. The first three stages of the framework are used to discover lesions, and the latter stage is used to segment them. The first locating stage introduces the classical 2D-based Yolov5 model to locate the nodules roughly on axial slices. The second aggregation stage proposes a candidate nodule selection (CNS) algorithm to locate further and reduce redundant candidate nodules. The third classification stage uses a multi-size 3D-based fusion model to accommodate nodules of varying sizes and shapes for false-positive reducing. The last segmentation stage introduces multi-scale and attention modules into 3D-based UNet autoencoder to segment the nodular regions finely. Our proposed framework achieves 95. 95% sensitivity and 89. 50% CPM for nodules detection on the LUNA16 dataset, and 86. 75% DSC for nodules segmentation on the LIDC-IDRI dataset. Moreover, our approach also achieves the accuracy-complexity trade-off, which can effectively realize the auxiliary diagnosis of pulmonary nodules in developing countries.

JBHI Journal 2022 Journal Article

AI-Driven Synthetic Biology for Non-Small Cell Lung Cancer Drug Effectiveness-Cost Analysis in Intelligent Assisted Medical Systems

• Liu Chang
• Jia Wu
• Nour Moustafa
• Ali Kashif Bashir
• Keping Yu

According to statistics, in the 185 countries' 36 types of cancer, the morbidity and mortality of lung cancer take the first place, and non-small cell lung cancer (NSCLC) accounts for 85% of lung cancer (International Agency for Research on Cancer, 2018), (Bray et al. , 2018). Significantly in many developing countries, limited medical resources and excess population seriously affect the diagnosis and treatment of alung cancer patients. The 21st century is an era of life medicine, big data, and information technology. Synthetic biology is known as the driving force of natural product innovation and research in this era. Based on the research of NSCLC targeted drugs, through the cross-fusion of synthetic biology and artificial intelligence, using the idea of bioengineering, we construct an artificial intelligence assisted medical system and propose a drug selection framework for the personalized selection of NSCLC patients. Under the premise of ensuring the efficacy, considering the economic cost of targeted drugs as an auxiliary decision-making factor, the system predicts the drug effectiveness-cost then. The experiment shows that our method can rely on the provided clinical data to screen drug treatment programs suitable for the patient's conditions and assist doctors in making an efficient diagnosis.

JBHI Journal 2022 Journal Article

An Artificial Intelligence Multiprocessing Scheme for the Diagnosis of Osteosarcoma MRI Images

• Jia Wu
• Pei Xiao
• Haojie Huang
• Fangfang Gou
• Zhixun Zhou
• Zhehao Dai

Osteosarcoma is the most common malignant osteosarcoma, and most developing countries face great challenges in the diagnosis due to the lack of medical resources. Magnetic resonance imaging (MRI) has always been an important tool for the detection of osteosarcoma, but it is a time-consuming and labor-intensive task for doctors to manually identify MRI images. It is highly subjective and prone to misdiagnosis. Existing computer-aided diagnosis methods of osteosarcoma MRI images focus only on accuracy, ignoring the lack of computing resources in developing countries. In addition, the large amount of redundant and noisy data generated during imaging should also be considered. To alleviate the inefficiency of osteosarcoma diagnosis faced by developing countries, this paper proposed an artificial intelligence multiprocessing scheme for pre-screening, noise reduction, and segmentation of osteosarcoma MRI images. For pre-screening, we propose the Slide Block Filter to remove useless images. Next, we introduced a fast non-local means algorithm using integral images to denoise noisy images. We then segmented the filtered and denoised MRI images using a U-shaped network (ETUNet) embedded with a transformer layer, which enhances the functionality and robustness of the traditional U-shaped architecture. Finally, we further optimized the segmented tumor boundaries using conditional random fields. This paper conducted experiments on more than 70, 000 MRI images of osteosarcoma from three hospitals in China. The experimental results show that our proposed methods have good results and better performance in pre-screening, noise reduction, and segmentation.

NeurIPS Conference 2022 Conference Paper

Dual-discriminative Graph Neural Network for Imbalanced Graph-level Anomaly Detection

• Ge Zhang
• Zhenyu Yang
• Jia Wu
• Jian Yang
• Shan Xue
• Hao Peng
• Jianlin Su
• Chuan Zhou

Graph-level anomaly detection aims to distinguish anomalous graphs in a graph dataset from normal graphs. Anomalous graphs represent a very few but essential patterns in the real world. The anomalous property of a graph may be referable to its anomalous attributes of particular nodes and anomalous substructures that refer to a subset of nodes and edges in the graph. In addition, due to the imbalance nature of anomaly problem, anomalous information will be diluted by normal graphs with overwhelming quantities. Various anomaly notions in the attributes and/or substructures and the imbalance nature together make detecting anomalous graphs a non-trivial task. In this paper, we propose a graph neural network for graph-level anomaly detection, namely iGAD. Specifically, an anomalous graph attribute-aware graph convolution and an anomalous graph substructure-aware deep Random Walk Kernel (deep RWK) are welded into a graph neural network to achieve the dual-discriminative ability on anomalous attributes and substructures. Deep RWK in iGAD makes up for the deficiency of graph convolution in distinguishing structural information caused by the simple neighborhood aggregation mechanism. Further, we propose a Point Mutual Information (PMI)-based loss function to target the problems caused by imbalance distributions. PMI-based loss function enables iGAD to capture essential correlation between input graphs and their anomalous/normal properties. We evaluate iGAD on four real-world graph datasets. Extensive experiments demonstrate the superiority of iGAD on the graph-level anomaly detection task.

AAAI Conference 2022 Conference Paper

Graph Structure Learning with Variational Information Bottleneck

• Qingyun Sun
• Jianxin Li
• Hao Peng
• Jia Wu
• Xingcheng Fu
• Cheng Ji
• Philip S Yu

Graph Neural Networks (GNNs) have shown promising results on a broad spectrum of applications. Most empirical studies of GNNs directly take the observed graph as input, assuming the observed structure perfectly depicts the accurate and complete relations between nodes. However, graphs in the real-world are inevitably noisy or incomplete, which could even exacerbate the quality of graph representations. In this work, we propose a novel Variational Information Bottleneck guided Graph Structure Learning framework, namely VIB-GSL, in the perspective of information theory. VIB-GSL is the first attempt to advance the Information Bottleneck (IB) principle for graph structure learning, providing a more elegant and universal framework for mining underlying task-relevant relations. VIB-GSL learns an informative and compressive graph structure to distill the actionable information for specific downstream tasks. VIB-GSL deduces a variational approximation for irregular graph data to form a tractable IB objective function, which facilitates training stability. Extensive experimental results demonstrate that the superior effectiveness and robustness of VIB-GSL.

JBHI Journal 2022 Journal Article

Intelligent Assistant Diagnosis System of Osteosarcoma MRI Image Based on Transformer and Convolution in Developing Countries

• Ziqiang Ling
• Shun Yang
• Fangfang Gou
• Zhehao Dai
• Jia Wu

Osteosarcoma is a malignant bone tumor commonly found in adolescents or children, with high incidence and poor prognosis. Magnetic resonance imaging (MRI), which is the more common diagnostic method for osteosarcoma, has a very large number of output images with sparse valid data and may not be easily observed due to brightness and contrast problems, which in turn makes manual diagnosis of osteosarcoma MRI images difficult and increases the rate of misdiagnosis. Current image segmentation models for osteosarcoma mostly focus on convolution, whose segmentation performance is limited due to the neglect of global features. In this paper, we propose an intelligent assisted diagnosis system for osteosarcoma, which can reduce the burden of doctors in diagnosing osteosarcoma from three aspects. First, we construct a classification-image enhancement module consisting of resnet18 and DeepUPE to remove redundant images and improve image clarity, which can facilitate doctors' observation. Then, we experimentally compare the performance of serial, parallel, and hybrid fusion transformer and convolution, and propose a Double U-shaped visual transformer with convolution (DUconViT) for automatic segmentation of osteosarcoma to assist doctors' diagnosis. This experiment utilizes more than 80, 000 osteosarcoma MRI images from three hospitals in China. The results show that DUconViT can better segment osteosarcoma with DSC 2. 6% and 1. 8% higher than Unet and Unet++, respectively. Finally, we propose the pixel point quantification method to calculate the area of osteosarcoma, which provides more reference basis for doctors' diagnosis.

IJCAI Conference 2022 Conference Paper

Vertically Federated Graph Neural Network for Privacy-Preserving Node Classification

• Chaochao Chen
• Jun Zhou
• Longfei Zheng
• Huiwen Wu
• Lingjuan Lyu
• Jia Wu
• Bingzhe Wu
• Ziqi Liu

Recently, Graph Neural Network (GNN) has achieved remarkable progresses in various real-world tasks on graph data, consisting of node features and the adjacent information between different nodes. High-performance GNN models always depend on both rich features and complete edge information in graph. However, such information could possibly be isolated by different data holders in practice, which is the so-called data isolation problem. To solve this problem, in this paper, we propose VFGNN, a federated GNN learning paradigm for privacy-preserving node classification task under data vertically partitioned setting, which can be generalized to existing GNN models. Specifically, we split the computation graph into two parts. We leave the private data (i. e. , features, edges, and labels) related computations on data holders, and delegate the rest of computations to a semi-honest server. We also propose to apply differential privacy to prevent potential information leakage from the server. We conduct experiments on three benchmarks and the results demonstrate the effectiveness of VFGNN.

TIST Journal 2021 Journal Article

A Comprehensive Survey of the Key Technologies and Challenges Surrounding Vehicular Ad Hoc Networks

• Zhenchang Xia
• Jia Wu
• Libing Wu
• Yanjiao Chen
• Jian Yang
• Philip S. Yu

Vehicular ad hoc networks ( VANETs ) and the services they support are an essential part of intelligent transportation. Through physical technologies, applications, protocols, and standards, they help to ensure traffic moves efficiently and vehicles operate safely. This article surveys the current state of play in VANETs development. The summarized and classified include the key technologies critical to the field, the resource-management and safety applications needed for smooth operations, the communications and data transmission protocols that support networking, and the theoretical and environmental constructs underpinning research and development, such as graph neural networks and the Internet of Things. Additionally, we identify and discuss several challenges facing VANETs, including poor safety, poor reliability, non-uniform standards, and low intelligence levels. Finally, we touch on hot technologies and techniques, such as reinforcement learning and 5G communications, to provide an outlook for the future of intelligent transportation systems.

JBHI Journal 2021 Journal Article

A Multiprocessing Scheme for PET Image Pre-Screening, Noise Reduction, Segmentation and Lesion Partitioning

• Runxi Cui
• Zhigang Chen
• Jia Wu
• YanLin Tan
• GengHua Yu

Objective: Accurate segmentation and partitioning of lesions in PET images provide computer-aided procedures and doctors with parameters for tumour diagnosis, staging and prognosis. Currently, PET segmentation and lesion partitioning are manually measured by radiologists, which is time consuming and laborious, and tedious manual procedures might lead to inaccurate measurement results. Therefore, we designed a new automatic multiprocessing scheme for PET image pre-screening, noise reduction, segmentation and lesion partitioning in this study. PET image pre-screening can reduce the time cost of noise reduction, segmentation and lesion partitioning methods, and denoising can enhance both quantitative metrics and visual quality for better segmentation accuracy. For pre-screening, we propose a new differential activation filter (DAF) to screen the lesion images from whole-body scanning. For noise reduction, neural network inverse (NN inverse) as the inverse transformation of generalized Anscombe transformation (GAT), which does not depend on the distribution of residual noise, was presented to improve the SNR of images. For segmentation and lesion partitioning, definition density peak clustering (DDPC) was proposed to realize instance segmentation of lesion and normal tissue with unsupervised images, which helped reduce the cost of density calculation and completely deleted the cluster halo. The experimental results of clinical data demonstrate that our proposed methods have good results and better performance in noise reduction, segmentation and lesion partitioning compared with state-of-the-art methods.

YNICL Journal 2021 Journal Article

Co-occurring tobacco and cannabis use in adolescents: Dissociable relationships with mediofrontal electrocortical activity during reward feedback processing

• Christopher J. Hammond
• Jia Wu
• Suchitra Krishnan-Sarin
• Linda C. Mayes
• Marc N. Potenza
• Michael J. Crowley

IS Journal 2021 Journal Article

CoTrRank: Trust Ranking on Twitter

• Peiyao Li
• Weiliang Zhao
• Jian Yang
• Jia Wu

Trust evaluation of people and information on social media is critical for maintaining a healthy online social environment. How to evaluate the trustworthiness of users and tweets is challenging due to the complex and complicated relationships between/among users and their posts. As existing approaches use a single network to represent users, posts, and their relationships, they have the limitation to reflect the different statistical features of users and tweets, which has reduced the ability to determine the trustworthiness of users and tweets. To address this issue, we develop a trust evaluation method that models users and tweets separately in two networks that are coupled with each other via interactions. We provide mapping functions to map the statistical numbers of actions of users/tweets to trust values that indicate their relevant trust degrees. The proposed method provides a configurable solution that has the capability to consider the effects of users and tweets differently in different trust ranking situations. A set of experiments are conducted against real-data collected from Twitter. The experimental results show that the proposed approach is more effective in trust evaluation compared with several baseline methods.

EAAI Journal 2021 Journal Article

EMORL: Effective multi-objective reinforcement learning method for hyperparameter optimization

• SenPeng Chen
• Jia Wu
• XiYuan Liu

AAAI Conference 2020 Conference Paper

A Knowledge-Aware Attentional Reasoning Network for Recommendation

• Qiannan Zhu
• Xiaofei Zhou
• Jia Wu
• Jianlong Tan
• Li Guo

Knowledge-graph-aware recommendation systems have increasingly attracted attention in both industry and academic recently. Many existing knowledge-aware recommendation methods have achieved better performance, which usually perform recommendation by reasoning on the paths between users and items in knowledge graphs. However, they ignore the users’ personal clicked history sequences that can better reflect users’ preferences within a period of time for recommendation. In this paper, we propose a knowledge-aware attentional reasoning network KARN that incorporates the users’ clicked history sequences and path connectivity between users and items for recommendation. The proposed KARN not only develops an attention-based RNN to capture the user’s history interests from the user’s clicked history sequences, but also a hierarchical attentional neural network to reason on paths between users and items for inferring the potential user intents on items. Based on both user’s history interest and potential intent, KARN can predict the clicking probability of the user with respective to a candidate item. We conduct experiment on Amazon review dataset, and the experimental results demonstrate the superiority and effectiveness of our proposed KARN model.

IJCAI Conference 2020 Conference Paper

Deep Learning for Community Detection: Progress, Challenges and Opportunities

• Fanzhen Liu
• Shan Xue
• Jia Wu
• Chuan Zhou
• Wenbin Hu
• Cecile Paris
• Surya Nepal
• Jian Yang

As communities represent similar opinions, similar functions, similar purposes, etc. , community detection is an important and extremely useful tool in both scientific inquiry and data analytics. However, the classic methods of community detection, such as spectral clustering and statistical inference, are falling by the wayside as deep learning techniques demonstrate an increasing capacity to handle high-dimensional graph data with impressive performance. Thus, a survey of current progress in community detection through deep learning is timely. Structured into three broad research streams in this domain – deep neural networks, deep graph embedding, and graph neural networks, this article summarizes the contributions of the various frameworks, models, and algorithms in each stream along with the current challenges that remain unsolved and the future research opportunities yet to be explored.

NeurIPS Conference 2020 Conference Paper

Graph Geometry Interaction Learning

• Shichao Zhu
• Shirui Pan
• Chuan Zhou
• Jia Wu
• Yanan Cao
• Bin Wang

While numerous approaches have been developed to embed graphs into either Euclidean or hyperbolic spaces, they do not fully utilize the information available in graphs, or lack the flexibility to model intrinsic complex graph geometry. To utilize the strength of both Euclidean and hyperbolic geometries, we develop a novel Geometry Interaction Learning (GIL) method for graphs, a well-suited and efficient alternative for learning abundant geometric properties in graph. GIL captures a more informative internal structural features with low dimensions while maintaining conformal invariance of each space. Furthermore, our method endows each node the freedom to determine the importance of each geometry space via a flexible dual feature interaction learning and probability assembling mechanism. Promising experimental results are presented for five benchmark datasets on node classification and link prediction tasks.

NeurIPS Conference 2020 Conference Paper

Graph Stochastic Neural Networks for Semi-supervised Learning

• Haibo Wang
• Chuan Zhou
• Xin Chen
• Jia Wu
• Shirui Pan
• Jilong Wang

Graph Neural Networks (GNNs) have achieved remarkable performance in the task of the semi-supervised node classification. However, most existing models learn a deterministic classification function, which lack sufficient flexibility to explore better choices in the presence of kinds of imperfect observed data such as the scarce labeled nodes and noisy graph structure. To improve the rigidness and inflexibility of deterministic classification functions, this paper proposes a novel framework named Graph Stochastic Neural Networks (GSNN), which aims to model the uncertainty of the classification function by simultaneously learning a family of functions, i. e. , a stochastic function. Specifically, we introduce a learnable graph neural network coupled with a high-dimensional latent variable to model the distribution of the classification function, and further adopt the amortised variational inference to approximate the intractable joint posterior for missing labels and the latent variable. By maximizing the lower-bound of the likelihood for observed node labels, the instantiated models can be trained in an end-to-end manner effectively. Extensive experiments on three real-world datasets show that GSNN achieves substantial performance gain in different scenarios compared with stat-of-the-art baselines.

IJCAI Conference 2020 Conference Paper

Opinion Maximization in Social Trust Networks

• Pinghua Xu
• Wenbin Hu
• Jia Wu
• Weiwei Liu

Social media sites are now becoming very important platforms for product promotion or marketing campaigns. Therefore, there is broad interest in determining ways to guide a site to react more positively to a product with a limited budget. However, the practical significance of the existing studies on this subject is limited for two reasons. First, most studies have investigated the issue in oversimplified networks in which several important network characteristics are ignored. Second, the opinions of individuals are modeled as bipartite states (e. g. , support or not) in numerous studies, however, this setting is too strict for many real scenarios. In this study, we focus on social trust networks (STNs), which have the significant characteristics ignored in the previous studies. We generalized a famed continuous-valued opinion dynamics model for STNs, which is more consistent with real scenarios. We subsequently formalized two novel problems for solving the issue in STNs. In addition, we developed two matrix-based methods for these two problems and experiments on realworld datasets to demonstrate the practical utility of our methods.

AAAI Conference 2020 Conference Paper

Temporal Network Embedding with High-Order Nonlinear Information

• Zhenyu Qiu
• Wenbin Hu
• Jia Wu
• Weiwei Liu
• Bo Du
• Xiaohua Jia

Temporal network embedding, which aims to learn the lowdimensional representations of nodes in temporal networks that can capture and preserve the network structure and evolution pattern, has attracted much attention from the scientific community. However, existing methods suffer from two main disadvantages: 1) they cannot preserve the node temporal proximity that capture important properties of the network structure; and 2) they cannot represent the nonlinear structure of temporal networks. In this paper, we propose a high-order nonlinear information preserving (HNIP) embedding method to address these issues. Specifically, we define three orders of temporal proximities by exploring network historical information with a time exponential decay model to quantify the temporal proximity between nodes. Then, we propose a novel deep guided auto-encoder to capture the highly nonlinear structure. Meanwhile, the training set of the guide autoencoder is generated by the temporal random walk (TRW) algorithm. By training the proposed deep guided auto-encoder with a specific mini-batch stochastic gradient descent algorithm, HNIP can efficiently preserves the temporal proximities and highly nonlinear structure of temporal networks. Experimental results on four real-world networks demonstrate the effectiveness of the proposed method.

IJCAI Conference 2019 Conference Paper

CoTrRank: Trust Evaluation of Users and Tweets

• Peiyao Li
• Weiliang Zhao
• Jian Yang
• Jia Wu

Trust evaluation of people and information on Twitter is critical for maintaining a healthy online social environment. How to evaluate the trustworthiness of users and tweets becomes a challenging question. In this demo, we show how our proposed CoTrRank approach deal with this problem. This approach models users and tweets in two coupled networks and calculate their trust values in different trust spaces. In particular, our solution provides a configurable way when mapping the calculated raw evidences to the trust values. The CoTrRank demo system has an interactive interface to show how our proposed approach produces more effective and adaptive trust evaluation results comparing with baseline methods.

IJCAI Conference 2019 Conference Paper

Deep Active Learning for Anchor User Prediction

• Anfeng Cheng
• Chuan Zhou
• Hong Yang
• Jia Wu
• Lei Li
• Jianlong Tan
• Li Guo

Predicting pairs of anchor users plays an important role in the cross-network analysis. Due to the expensive costs of labeling anchor users for training prediction models, we consider in this paper the problem of minimizing the number of user pairs across multiple networks for labeling as to improve the accuracy of the prediction. To this end, we present a deep active learning model for anchor user prediction (DALAUP for short). However, active learning for anchor user sampling meets the challenges of non-i. i. d. user pair data caused by network structures and the correlation among anchor or non-anchor user pairs. To solve the challenges, DALAUP uses a couple of neural networks with shared-parameter to obtain the vector representations of user pairs, and ensembles three query strategies to select the most informative user pairs for labeling and model training. Experiments on real-world social network data demonstrate that DALAUP outperforms the state-of-the-art approaches.

TIST Journal 2019 Journal Article

Multi-View Fusion with Extreme Learning Machine for Clustering

• Yongshan Zhang
• Jia Wu
• Chuan Zhou
• Zhihua Cai
• Jian Yang
• Philip S. Yu

Unlabeled, multi-view data presents a considerable challenge in many real-world data analysis tasks. These data are worth exploring because they often contain complementary information that improves the quality of the analysis results. Clustering with multi-view data is a particularly challenging problem as revealing the complex data structures between many feature spaces demands discriminative features that are specific to the task and, when too few of these features are present, performance suffers. Extreme learning machines (ELMs) are an emerging form of learning model that have shown an outstanding representation ability and superior performance in a range of different learning tasks. Motivated by the promise of this advancement, we have developed a novel multi-view fusion clustering framework based on an ELM, called MVEC. MVEC learns the embeddings from each view of the data via the ELM network, then constructs a single unified embedding according to the correlations and dependencies between each embedding and automatically weighting the contribution of each. This process exposes the underlying clustering structures embedded within multi-view data with a high degree of accuracy. A simple yet efficient solution is also provided to solve the optimization problem within MVEC. Experiments and comparisons on eight different benchmarks from different domains confirm MVEC’s clustering accuracy.

IJCAI Conference 2019 Conference Paper

Neighborhood-Aware Attentional Representation for Multilingual Knowledge Graphs

• Qiannan Zhu
• Xiaofei Zhou
• Jia Wu
• Jianlong Tan
• Li Guo

Multilingual knowledge graphs constructed by entity alignment are the indispensable resources for numerous AI-related applications. Most existing entity alignment methods only use the triplet-based knowledge to find the aligned entities across multilingual knowledge graphs, they usually ignore the neighborhood subgraph knowledge of entities that implies more richer alignment information for aligning entities. In this paper, we incorporate neighborhood subgraph-level information of entities, and propose a neighborhood-aware attentional representation method NAEA for multilingual knowledge graphs. NAEA devises an attention mechanism to learn neighbor-level representation by aggregating neighbors' representations with a weighted combination. The attention mechanism enables entities not only capture different impacts of their neighbors on themselves, but also attend over their neighbors' feature representations with different importance. We evaluate our model on two real-world datasets DBP15K and DWY100K, and the experimental results show that the proposed model NAEA significantly and consistently outperforms state-of-the-art entity alignment models.

IJCAI Conference 2019 Conference Paper

Noise-Resilient Similarity Preserving Network Embedding for Social Networks

• Zhenyu Qiu
• Wenbin Hu
• Jia Wu
• Zhongzheng Tang
• Xiaohua Jia

Network embedding assigns nodes in a network to low-dimensional representations and effectively preserves the structure and inherent properties of the network. Most existing network embedding methods didn't consider network noise. However, it is almost impossible to observe the actual structure of a real-world network without noise. The noise in the network will affect the performance of network embedding dramatically. In this paper, we aim to exploit node similarity to address the problem of social network embedding with noise and propose a node similarity preserving (NSP) embedding method. NSP exploits a comprehensive similarity index to quantify the authenticity of the observed network structure. Then we propose an algorithm to construct a correction matrix to reduce the influence of noise. Finally, an objective function for accurate network embedding is proposed and an efficient algorithm to solve the optimization problem is provided. Extensive experimental results on a variety of applications of real-world networks with noise show the superior performance of the proposed method over the state-of-the-art methods.

IJCAI Conference 2018 Conference Paper

A Deep Framework for Cross-Domain and Cross-System Recommendations

• Feng Zhu
• Yan Wang
• Chaochao Chen
• Guanfeng Liu
• Mehmet Orgun
• Jia Wu

Cross-Domain Recommendation (CDR) and Cross-System Recommendations (CSR) are two of the promising solutions to address the long-standing data sparsity problem in recommender systems. They leverage the relatively richer information, e. g. , ratings, from the source domain or system to improve the recommendation accuracy in the target domain or system. Therefore, finding an accurate mapping of the latent factors across domains or systems is crucial to enhancing recommendation accuracy. However, this is a very challenging task because of the complex relationships between the latent factors of the source and target domains or systems. To this end, in this paper, we propose a Deep framework for both Cross-Domain and Cross-System Recommendations, called DCDCSR, based on Matrix Factorization (MF) models and a fully connected Deep Neural Network (DNN). Specifically, DCDCSR first employs the MF models to generate user and item latent factors and then employs the DNN to map the latent factors across domains or systems. More importantly, we take into account the rating sparsity degrees of individual users and items in different domains or systems and use them to guide the DNN training process for utilizing the rating data more effectively. Extensive experiments conducted on three real-world datasets demonstrate that DCDCSR framework outperforms the state-of-the-art CDR and CSR approaches in terms of recommendation accuracy.

IJCAI Conference 2018 Conference Paper

Active Discriminative Network Representation Learning

• Li Gao
• Hong Yang
• Chuan Zhou
• Jia Wu
• Shirui Pan
• Yue Hu

Most of current network representation models are learned in unsupervised fashions, which usually lack the capability of discrimination when applied to network analysis tasks, such as node classification. It is worth noting that label information is valuable for learning the discriminative network representations. However, labels of all training nodes are always difficult or expensive to obtain and manually labeling all nodes for training is inapplicable. Different sets of labeled nodes for model learning lead to different network representation results. In this paper, we propose a novel method, termed as ANRMAB, to learn the active discriminative network representations with a multi-armed bandit mechanism in active learning setting. Specifically, based on the networking data and the learned network representations, we design three active learning query strategies. By deriving an effective reward scheme that is closely related to the estimated performance measure of interest, ANRMAB uses a multi-armed bandit mechanism for adaptive decision making to select the most informative nodes for labeling. The updated labeled nodes are then used for further discriminative network representation learning. Experiments are conducted on three public data sets to verify the effectiveness of ANRMAB.

AAAI Conference 2018 Conference Paper

Nonlocal Patch Based t-SVD for Image Inpainting: Algorithm and Error Analysis

• Liangchen Song
• Bo Du
• Lefei Zhang
• Liangpei Zhang
• Jia Wu
• Xuelong Li

In this paper, we propose a novel image inpainting framework consisting of an interpolation step and a low-rank tensor completion step. More specifically, we first initial the image with triangulation-based linear interpolation, and then we find similar patches for each missing-entry centered patch. Treating a group of patch matrices as a tensor, we employ the recently proposed effective t-SVD tensor completion algorithm with a warm start strategy to inpaint it. We observe that the interpolation step is such a rough initialization that the similar patch we found may not exactly match with the reference, so we name the problem as Patch Mismatch and analyse the error caused by it thoroughly. Our theoretical analysis shows that the error caused by Patch Mismatch can be decomposed into two components, one of which can be bounded by a reasonable assumption named local patch similarity, and another part is lower than that using matrix. Experiments on real images verify our method’s superiority to the state-of-the-art inpainting methods.

IJCAI Conference 2018 Conference Paper

Recommendation with Multi-Source Heterogeneous Information

• Li Gao
• Hong Yang
• Jia Wu
• Chuan Zhou
• Weixue Lu
• Yue Hu

Network embedding has been recently used in social network recommendations by embedding low-dimensional representations of network items for recommendation. However, existing item recommendation models in social networks suffer from two limitations. First, these models partially use item information and mostly ignore important contextual information in social networks such as textual content and social tag information. Second, network embedding and item recommendations are learned in two independent steps without any interaction. To this end, we in this paper consider item recommendations based on heterogeneous information sources. Specifically, we combine item structure, textual content and tag information for recommendation. To model the multi-source heterogeneous information, we use two coupled neural networks to capture the deep network representations of items, based on which a new recommendation model Collaborative multi-source Deep Network Embedding (CDNE for short) is proposed to learn different latent representations. Experimental results on two real-world data sets demonstrate that CDNE can use network representation learning to boost the recommendation performance.

IJCAI Conference 2018 Conference Paper

Self-Representative Manifold Concept Factorization with Adaptive Neighbors for Clustering

• Sihan Ma
• Lefei Zhang
• Wenbin Hu
• Yipeng Zhang
• Jia Wu
• Xuelong Li

Matrix Factorization based methods, e. g. , the Concept Factorization (CF) and Nonnegative Matrix Factorization (NMF), have been proved to be efficient and effective for data clustering tasks. In recent years, various graph extensions of CF and NMF have been proposed to explore intrinsic geometrical structure of data for the purpose of better clustering performance. However, many methods build the affinity matrix used in the manifold structure directly based on the input data. Therefore, the clustering results are highly sensitive to the input data. To further improve the clustering performance, we propose a novel manifold concept factorization model with adaptive neighbor structure to learn a better affinity matrix and clustering indicator matrix at the same time. Technically, the proposed model constructs the affinity matrix by assigning the adaptive and optimal neighbors to each point based on the local distance of the learned new representation of the original data with itself as a dictionary. Our experimental results present superior performance over the state-of-the-art alternatives on numerous datasets.

AAAI Conference 2018 Conference Paper

Social Recommendation with an Essential Preference Space

• Chun-Yi Liu
• Chuan Zhou
• Jia Wu
• Yue Hu
• Li Guo

Social recommendation, which aims to exploit social information to improve the quality of a recommender system, has attracted an increasing amount of attention in recent years. A large portion of existing social recommendation models are based on the tractable assumption that users consider the same factors to make decisions in both recommender systems and social networks. However, this assumption is not in concert with real-world situations, since users usually show different preferences in different scenarios. In this paper, we investigate how to exploit the differences between user preference in recommender systems and that in social networks, with the aim to further improve the social recommendation. In particular, we assume that the user preferences in different scenarios are results of different linear combinations from a more underlying user preference space. Based on this assumption, we propose a novel social recommendation framework, called social recommendation with an essential preferences space (SREPS), which simultaneously models the structural information in the social network, the rating and the consumption information in the recommender system under the capture of essential preference space. Experimental results on four real-world datasets demonstrate the superiority of the proposed SREPS model compared with seven stateof-the-art social recommendation methods.

AAAI Conference 2017 Conference Paper

Collaborative Dynamic Sparse Topic Regression with User Profile Evolution for Item Recommendation

• Li Gao
• Jia Wu
• Chuan Zhou
• Yue Hu

In many time-aware item recommender systems, modeling the accurate evolution of both user profiles and the contents of items over time is essential. However, most existing methods focus on learning users’ dynamic interests, where the contents of items are assumed to be stable over time. They thus fail to capture the dynamic changes in the item’s contents. In this paper, we present a novel method CDUE for time-aware item recommendation, which captures the evolution of both user’s interests and item’s contents information via topic dynamics. Specifically, we propose a dynamic sparse topic model to track the evolution of topics for changes in items’ contents over time and adapt a vector autoregressive model to profile users’ dynamic interests. The item’s topics and user’s interests and their evolutions are learned collaboratively and simultaneously into a unified learning framework. Experimental results on two real-world data sets demonstrate the quality and effectiveness of the proposed method and show that our method can be used to make better future recommendations.

IS Journal 2017 Journal Article

Collective Hyping Detection System for Identifying Online Spam Activities

• Qinzhe Zhang
• Jia Wu
• Peng Zhang
• Guodong Long
• Chengqi Zhang

Although existing antispam strategies detect traditional spam activities effectively, evolving spam schemes can successfully cheat conventional testing by buying the comments that are written by genuine users and sold by specific web markets. Such spam activities turn into a kind of advertising campaign among business owners to maintain their rank in top positions. This article proposes a new collaborative marketing hyping detection solution that aims to identify spam comments generated by the Spam Reviewer Cloud and detect products that adopt an evolving spam strategy for promotion. The authors propose an unsupervised learning model that combines heterogeneous product review networks in an attempt to discover collective hyping activities. Their experiments validate the existence of the collaborative marketing hyping activities on a real-life e-commerce platform and demonstrate that their model can effectively and accurately identify these advanced spam activities.

IJCAI Conference 2016 Conference Paper

Bernoulli Random Forests: Closing the Gap between Theoretical Consistency and Empirical Soundness

• Yisen Wang
• Qingtao Tang
• Shu-Tao Xia
• Jia Wu
• Xingquan Zhu

Random forests are one type of the most effective ensemble learning methods. In spite of their sound empirical performance, the study on their theoretical properties has been left far behind. Recently, several random forests variants with nice theoretical basis have been proposed, but they all suffer from poor empirical performance. In this paper, we propose a Bernoulli random forests model (BRF), which intends to close the gap between the theoretical consistency and the empirical soundness of random forests classification. Compared to Breiman's original random forests, BRF makes two simplifications in tree construction by using two independent Bernoulli distributions. The first Bernoulli distribution is used to control the selection of candidate attributes for each node of the tree, and the second one controls the splitting point used by each node. As a result, BRF enjoys proved theoretical consistency, so its accuracy will converge to optimum (i. e. , the Bayes risk) as the training data grow infinitely large. Empirically, BRF demonstrates the best performance among all theoretical random forests, and is very comparable to Breiman's original random forests (which do not have the proved consistency yet). The theoretical and experimental studies advance the research one step further towards closing the gap between the theory and the practical performance of random forests classification.

AAAI Conference 2016 Conference Paper

Direct Discriminative Bag Mapping for Multi-Instance Learning

• Jia Wu
• Shirui Pan
• Peng Zhang
• Xingquan Zhu

Multi-instance learning (MIL) is useful for tackling labeling ambiguity in learning tasks, by allowing a bag of instances to share one label. Recently, bag mapping methods, which transform a bag to a single instance in a new space via instance selection, have drawn significant attentions. To date, most existing works are developed based on the original space, i. e. , utilizing all instances for bag mapping, and instance selection is indirectly tied to the MIL objective. As a result, it is hard to guarantee the distinguish capacity of the selected instances in the new bag mapping space for MIL. In this paper, we propose a direct discriminative mapping approach for multi-instance learning (MILDM), which identifies instances to directly distinguish bags in the new mapping space. Experiments and comparisons on real-world learning tasks demonstrate the algorithm performance.

AAAI Conference 2016 Conference Paper

On the Minimum Differentially Resolving Set Problem for Diffusion Source Inference in Networks

• Chuan Zhou
• Wei-Xue Lu
• Peng Zhang
• Jia Wu
• Yue Hu
• Li Guo

In this paper we theoretically study the minimum Differentially Resolving Set (DRS) problem derived from the classical sensor placement optimization problem in network source locating. A DRS of a graph G = (V, E) is defined as a subset S ⊆ V where any two elements in V can be distinguished by their different differential characteristic sets defined on S. The minimum DRS problem aims to find a DRS S in the graph G with minimum total weight v∈S w(v). In this paper we establish a group of Integer Linear Programming (ILP) models as the solution. By the weighted set cover theory, we propose an approximation algorithm with the Θ(ln n) approximability for the minimum DRS problem on general graphs, where n is the graph size.

IJCAI Conference 2016 Conference Paper

Semi-Data-Driven Network Coarsening

• Li Gao
• Jia Wu
• Hong Yang
• Zhi Qiao
• Chuan Zhou
• Yue Hu

Network coarsening refers to a new class of graph `zoom-out' operations by grouping similar nodes and edges together so that a smaller equivalent representation of the graph can be obtained for big network analysis. Existing network coarsening methods consider that network structures are static and thus cannot handle dynamic networks. On the other hand, data-driven approaches can infer dynamic network structures by using network information spreading data. However, existing data-driven approaches neglect static network structures that are potentially useful for inferring big networks. In this paper, we present a new semi-data-driven network coarsening model to learn coarsened networks by embedding both static network structure data and dynamic network information spreading data. We prove that the learning model is convex and the Accelerated Proximal Gradient algorithm is adapted to achieve the global optima. Experiments on both synthetic and real-world data sets demonstrate the quality and effectiveness of the proposed method.

IJCAI Conference 2016 Conference Paper

Tri-Party Deep Network Representation

• Shirui Pan
• Jia Wu
• Xingquan Zhu
• Chengqi Zhang
• Yang Wang

Information network mining often requires examination of linkage relationships between nodes for analysis. Recently, network representation has emerged to represent each node in a vector format, embedding network structure, so off-the-shelf machine learning methods can be directly applied for analysis. To date, existing methods only focus on one aspect of node information and cannot leverage node labels. In this paper, we propose TriDNR, a tri-party deep network representation model, using information from three parties: node structure, node content, and node labels (if available) to jointly learn optimal node representation. TriDNR is based on our new coupled deep natural language module, whose learning is enforced at three levels: (1) at the network structure level, TriDNR exploits inter-node relationship by maximizing the probability of observing surrounding nodes given a node in random walks; (2) at the node content level, TriDNR captures node-word correlation by maximizing the co-occurrence of word sequence given a node; and (3) at the node label level, TriDNR models label-word correspondence by maximizing the probability of word sequence given a class label. The tri-party information is jointly fed into the neural network model to mutually enhance each other to learn optimal representation, and results in up to 79% classification accuracy gain, compared to state-of-the-art methods.

IJCAI Conference 2016 Conference Paper

Unsupervised Feature Learning from Time Series

• Qin Zhang
• Jia Wu
• Hong Yang
• YingJie Tian
• Chengqi Zhang

In this paper we study the problem of learning discriminative features (segments), often referred to as shapelets [Ye and Keogh, 2009] of time series, from unlabeled time series data. Discovering shapelets for time series classification has been widely studied, where many search-based algorithms are proposed to efficiently scan and select segments from a pool of candidates. However, such types of search-based algorithms may incur high time cost when the segment candidate pool is large. Alternatively, a recent work [Grabocka et al. , 2014] uses regression learning to directly learn, instead of searching for, shapelets from time series. Motivated by the above observations, we propose a new Unsupervised Shapelet Learning Model (USLM) to efficiently learn shapelets from unlabeled timeseries data. The corresponding learning function integrates the strengths of pseudo-class label, spectral analysis, shapelets regularization term and regularized least-squares to auto-learn shapelets, pseudo-class labels and classification boundaries simultaneously. A coordinate descent algorithm is used to iteratively solve the learning function. Experiments show that USLM outperforms search-based algorithms on real-world time series data.

IJCAI Conference 2015 Conference Paper

Multi-Graph-View Learning for Complicated Object Classification

• Jia Wu
• Shirui Pan
• Xingquan Zhu
• Zhihua Cai
• Chengqi Zhang

In this paper, we propose to represent and classify complicated objects. In order to represent the objects, we propose a multi-graph-view model which uses graphs constructed from multiple graph-views to represent an object. In addition, a bag based multi-graph model is further used to relax labeling by only requiring one label for a bag of graphs, which represent one object. In order to learn classification models, we propose a multi-graph-view bag learning algorithm (MGVBL), which aims to explore subgraph features from multiple graphviews for learning. By enabling a joint regularization across multiple graph-views, and enforcing labeling constraints at the bag and graph levels, MGVBL is able to discover most effective subgraph features across all graph-views for learning. Experiments on real-world learning tasks demonstrate the performance of MGVBL for complicated object classification.

YNIMG Journal 2015 Journal Article

Social exclusion modulates event-related frontal theta and tracks ostracism distress in children

• Stefon J.R. van Noordt
• Lars O. White
• Jia Wu
• Linda C. Mayes
• Michael J. Crowley