Bo Wu

Bo Wu

Auto-generated profile, based on publicly available information

Bo Wu

Xiang Jiang Laboratory, Changsha, Hunan, China and School of Artificial Intelligence and Advanced Computing, Hunan University of Technology and Business, Changsha, Hunan, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

13 May 2024
Verified
Conference Paper
Open access
XZXiangping Zheng
Xiangping Zheng
BWBo Wu
Bo Wu
LXLiang Xun
Liang Xun
Wei LiWei Li
Wei Li
Anomaly detection on graphs has recently attracted considerable attention due to its broad range of high-impact applications, including cybersecurity, financial transactions, and recommendation systems. Although many efforts have thus far been made, how to effectively handle the high inconsistency between users' behavior and labels, a fundamental issue in anomaly detection, has not yet received sufficient concern. Moreover, the inconsistency problem is hard to investigate and even deteriorates the performance of anomaly detectors. To this end, we propose a novel graph self-supervised learning framework, Capsule Graph Infomax (termed CapsGI), to overcome the inconsistency of anomaly detection. Inspired by the recent advances of capsules on images, we explore another possibility of reforming the node embedding by capsule ideas to represent the unique node's properties. Concretely, by disentangling heterogeneous factors underlying each node representation, we can establish node capsules such that their representation can reflect intrinsic node properties. To strengthen the connection among normal nodes, CapsGI further represents the part-whole contrastive learning between lower-level capsules (part) and higher-level capsules (whole) by explicitly considering the context graph relations. Extensive experiments on multiple real-world datasets demonstrate that our model significantly outperforms state-of-the-art models.

27 February 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HTHui Tang
Hui Tang
LXLiang Xun
Liang Xun
YGYuhui Guo
Yuhui Guo
XZXiangping Zheng
Xiangping Zheng
BWBo Wu
Bo Wu
ZLZhiying Li
Zhiying Li
As the scope of receptive field and the depth of Graph Neural Networks (GNNs) are two completely orthogonal aspects for graph learning, existing GNNs often have shallow layers with truncated-receptive field and far from achieving satisfactory performance. In this article, we follow the idea of decoupling graph convolution into propagation and transformation processes, which generates representations over a sequence of increasingly larger neighborhoods. Though this manner can enlarge the receptive field, it has two critical problems unsolved: how to find the suitable receptive field to avoid under-smoothing or over-smoothing? and how to balance different diffusion operators for better capturing the local and global dependencies? We tackle these challenges and propose a S calable, A daptive G raph C onvolutional N etworks ( SAGCN ) with Transformer architecture. Concretely, we propose a novel non-heuristic metric method that quickly finds the suitable number of diffusing iterations and produces smoothed local embeddings that enable the truncated receptive field to become scalable and independent of prior experience. Furthermore, we devise smooth2seq and diffusion-based position schemes introduced into Transformer architecture for better capturing local and global information among embeddings. Experimental results show that SAGCN enjoys high accuracy, scalability and efficiency on various open benchmarks and is competitive with other state-of-the-art competitors.

17 March 2023
Verified
Book Chapter
Closed access
PDF file
XZXuan Zhang
Xuan Zhang
LXLiang Xun
Liang Xun
XZXiangping Zheng
Xiangping Zheng
BWBo Wu
Bo Wu
YGYuhui Guo
Yuhui Guo

4 May 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
YGYuhui Guo
Yuhui Guo
LXLiang Xun
Liang Xun
BWBo Wu
Bo Wu
XZXiangping Zheng
Xiangping Zheng
XZXuan Zhang
Xuan Zhang
Weakly Supervised Semantic Segmentation with image-level annotation uses localization maps from the classifier to generate pseudo labels. However, such localization maps focus only on sparse salient object regions, it is difficult to generate high-quality segmentation labels, which deviates from the requirement of semantic segmentation. To address this issue, we propose a dual-aware domain mining and cross-aware supervision (DDMCAS) method for weakly-supervised semantic segmentation. Specifically, we propose a dual-aware domain mining (DDM) module consisting of graph-based global reasoning unit and salient-region extension controller, which produces dense localization maps by exploring object features in salient regions and adjacent non-salient regions simultaneously. In order to further bridge the gap between salient regions and adjacent non-salient regions to generate more refined localization maps, we propose a cross-aware supervision (CAS) strategy to recover missing parts of the target objects and enhance weak attention in adjacent non-salient regions, leading to pseudo labels of higher quality for training the segmentation network. Based on the generated pseudo-labels, extensive experiments on PASCAL VOC 2012 dataset demonstrate that our method outperforms state-of-the-art methods using image-level labels for weakly supervised semantic segmentation.

27 October 2025
Verified
Conference Paper
Open access
XZXiangping Zheng
Xiangping Zheng
XFXuan Feng
Xuan Feng
BWBo Wu
Bo Wu
BRBin Ren
Bin Ren
Wei LiWei Li
Wei Li
ZYZhiwen Yu
Zhiwen Yu