Xiaoyan Zhang 0005

dblp:63/4485-5 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
6since 2021 · last 2026
0000-0003-2339-5423ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 3 since 2021Artificial intelligence and machine learning · 5 · 2 first-author · 3 since 2021Theory of computation · 3 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 MAS-Net: A medical image segmentation method based on memory augmentation and supplementation
Xiaoyan Zhang 0005, Weiqiang Sun, Yongqin Zhang, Chunlin Yu, Xiangfu Meng
Comput. Vis. Image Underst.1
2026 CC-Net: A cross-hierarchical context-aware network for medical image segmentation
Xiaoyan Zhang 0005, Weiqiang Sun, Yongqin Zhang, Chunlin Yu, Xiangfu Meng
Neural Networks1
2024 Top-k approximate selection for typicality query results over spatio-textual data
Xiangfu Meng, Xiaoyan Zhang 0005, Hongjin Huo, Qiangkui Leng
Knowl. Inf. Syst.2
2023 Predicting Tumor Mutation Burden of Lung Cancer Based on Residual Network
abstract
Medical studies have found that Tumor Mutation Burden (TMB) is positively correlated with the efficacy of immunotherapy for Non-Small Cell Lung Cancer (NSCLC), and TMB value can predict the efficacy of targeted therapy and chemotherapy. However, the calculation of TMB value mainly depends on the Whole Exon Sequencing (WES) technology, which is usually expensive and takes too much time. To deal with this problem, this paper explores the connection between TMB and digital pathology images, predicting TMB using common clinical digital slices. We proposes RCA-MSAG, a deep learning model based on the Residual Coordinate Attention (RCA) structure and Multi-Scale Attention Guidance (MSAG) module, enhancing TMB prediction accuracy. The model takes ResNet-50, integrating Coordinate Attention (CA) and MSAG to extract critical information from lung cancer pathology. Using The Cancer Genome Atlas (TCGA) dataset, the model achieves 96.2% accuracy, 96.4% precision, 96.2% recall, and a 96.3% F1 score, outperforming mainstream models. This model shows promise in aiding clinical diagnoses and guiding TMB predictions.
Xiangfu Meng, Chunlin Yu, Xiaoyan Zhang 0005
BIBM3
2023 Lightweight Graph Convolutional Collaborative Filtering Recommendation Approach Incorporating Social Relationships
abstract
Graph convolutional network (GCN) has rapidly developed in various fields due to its powerful modeling capability. However, most of the researches directly inherit the complex design of GCN, such as feature transformation and nonlinear activation, which lacks thorough ablation analysis on GCN. In addition, implicit feedback is not fully utilized and data sparsity is not well resolved, which are also shortcomings of current recommendation algorithms. To solve the above problems, this paper proposes a lightweight graph convolutional collaborative filtering (F-LightGCCF) recommendation approach incorporating social relationships. Firstly, it abandons the design of feature transformation and nonlinear activation in graph convolutional models and simplifies model training. Additionally, a series of intermediate feedback from users’ implicit negative feedback is generated by taking advantage of social networks, which improves the utilization of implicit negative feedback. Secondly, it can model the long-range dependencies between users and items by using the dual attention mechanism, aggregating the contribution values of neighboring nodes and the importance of the learning vectors in each layer of the graph convolution layer respectively. Lastly, the inner product operation is used to obtain the association score between users and items. Extensive experiment results on two real-world datasets show that F-LightGCCF outperforms existing state-of-the-art recommendation methods. Further ablation studies and analyses validate the efficiency and effectiveness of the F-LightGCCF model.
Xiangfu Meng, Hongjin Huo, Xiaoyan Zhang 0005, Wanchun Wang
DSAA3
2023 A Survey of Personalized News Recommendation
abstract
Abstract Personalized news recommendation is an important technology to help users obtain news information they are interested in and alleviate information overload. In recent years, news recommendation has been increasingly widely studied and has achieved remarkable success in improving the news reading experience of users. In this paper, we provide a comprehensive overview of personalized news recommendation approaches. Firstly, we introduce personalized news recommendation systems according to different needs and analyze the characteristics. And then, a three-part research framework on personalized news recommendation is put forward. Based on the framework, the knowledge and methods involved in each part are analyzed in detail, including news datasets and processing techniques, prediction models, news ranking and display. On this basis, we focus on news recommendation methods based on different types of graph structure learning, including user–news interaction graph, knowledge graph and social relationship graph. Lastly, the challenges of the current news recommendation are analyzed and the prospect of the future research direction is presented.
Xiangfu Meng, Hongjin Huo, Xiaoyan Zhang 0005, Wanchun Wang, Jinxia Zhu
Data Sci. Eng.3
2017 DP-POIRS: A Diversified and Personalized Point-of-Interest Recommendation System
abstract
Diversity point-of-interest recommendation system benefits users to broaden their interests, access and discover new interest points. This paper describes a Diversified and Personalized Point-Of-Interest Recommendation System (DP-POIRS) by leveraging the geo-social relationships between POIs. The system consists of three components. The first component - geo-social distance measuring component is used to construct a correlation matrix to describe the geo-social distance between points of interests. The second component -point-of-interest partition component, divides the interest points into diverse clusters by using the spectral clustering algorithm over the correlation matrix. The third component -personalized sorting component, finds out the user's favorite interest points from each cluster, and then sorts them into a list of recommendation by the use of matrix factorization algorithms.
Xiangfu Meng, Yanhuan Tang, Xiaoyan Zhang 0005
DSAA3
2017 Top-k coupled keyword recommendation for relational keyword queries
Xiangfu Meng, Longbing Cao, Xiaoyan Zhang 0005, Jingyu Shao
Knowl. Inf. Syst.3
2017 Adaptive query relaxation and top-k result ranking over autonomous web databases
Xiangfu Meng, Xiaoyan Zhang 0005, Yanhuan Tang, Chongchun Bi
Knowl. Inf. Syst.2
2016 A Decision Tree-Based Approach for Categorizing Spatial Database Query Results
abstract
Spatial database queries are often exploratory. The users often find that their queries return too many answers and many of them may be irrelevant. Based on the coupling relationships between spatial objects, this paper proposes a novel categorization approach which consists of two steps. The first step analyzes the spatial object coupling relationship by considering the location proximity and semantic similarity between spatial objects, and then a set of clusters over the spatial objects can be generated, where each cluster represents one type of user need. When a user issues a spatial query, the second step presents to the user a category tree which is generated by using modified C4.5 decision tree algorithm over the clusters such that the user can easily select the subset of query results matching his/her needs by exploring the labels assigned on intermediate nodes of the tree. The experiments demonstrate that our spatial object clustering method can efficiently capture both the semantic and location correlations between spatial objects. The effectiveness and efficiency of the categorization algorithm is also demonstrated.
Xiangfu Meng, Xiaoyan Zhang 0005, Jinguang Sun, Lin Li 0001, Changzheng Xing, Chongchun Bi
DSAA2