Xiaocui Li

Dr. Xiaocui Li


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
24 August 2019 in World Wide Web
Verified
Journal Article
Closed access
PDF file
XLXiaocui Li
Xiaocui Li
HYHongzhi Yin
Hongzhi Yin
KZKe Zhou
Ke Zhou
XZXiaofang Zhou
Xiaofang Zhou

29 April 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
JLJiagang Liu
Jiagang Liu
YMYun Mi
Yun Mi
XZXinyu Zhang
Xinyu Zhang
XLXiaocui Li
Xiaocui Li

11 January 2020 in World Wide Web
Verified
Journal Article
Closed access
PDF file
XLXiaocui Li
Xiaocui Li
YWYangtao Wang
Yangtao Wang
JSJingkuan Song
Jingkuan Song
YLYu Liu
Yu Liu
XZXinyu Zhang
Xinyu Zhang
CLChunhua Li
Chunhua Li

10 March 2025
Verified
Conference Paper
Open access
XLXiaocui Li
Xiaocui Li
GLGuoliang Li
Guoliang Li
Xinyu ZhangXinyu Zhang
Xinyu Zhang
YWYangtao Wang
Yangtao Wang
QSQingyu Shi
Qingyu Shi
LWLiang Wei
Liang Wei
In recent years, incomplete multi-view clustering (IMVC) has attracted considerable attention for its ability to acheieve effective clustering results through the integration of key information amidst missing view. However, the existing IMVC methods are still faced with 3 limitations: (1) They exhibit deficiencies in considering the weight distribution within views, (2) they ignore the varying contributions of different views to the common consistent representation, and (3) they struggle to sufficiently extract and recover the vital information within incomplete views. To address these limitations, we incorporates local reasoning and correlation analysis to design an incomplete multi-view clustering method(IMVCLRCA), which introduces a new strategy of feature learning and missing view recovery, fully exploiting local similarity and structural continuity within views and performing precise local reasoning recovery on missing data. By maximizing mutual information between views through contrastive learning, we achieve the consistent representation learning of multiple views. Furthermore, based on semantic consistency, we comprehensively consider the correlation between views, utilized a weight matrix to fuse cross-view data, and constructed a view with a correlation structure, ultimately obtaining a common consistent representation. We conduct extensive experiments on 4 public datasets including Caltech101-20, BBCSport, Scene-15, and LandUse-21. Experimental results demonstrate that IMVCLRCA has higher accuracy and robustness compared to the state-of-the-art IMVC methods. The anonymous code of this project is available on GitHub at https://github.com/ggg2111/2025WSDM-IMVCLRCA.

12 November 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
XLXiaocui Li
Xiaocui Li
GLGuoliang Li
Guoliang Li
Xinyu ZhangXinyu Zhang
Xinyu Zhang
Jie WenJie Wen
Jie Wen
LWLian Wu
Lian Wu
In recent years, multi-view data often suffer from incompleteness owing to environmental factors, equipment failures. Thus Incomplete Multi-View Clustering (IMVC) has become an important research focus, which aims to alleviate the adverse impacts of missing views and leverage inter-view complementary information to enhance clustering performance. However, existing IMVC methodologies suffer from three critical limitations: 1) Inadequate integration of cross-view learning and cross-instance learning; 2) Lack of explicit modeling for dynamic interactions between view-specific information and cross-view shared semantics; 3) Inability to dynamically capture high-order topological correlations under view-missing conditions, leading to semantic misalignment among samples. To address these challenges, we propose an IMVC framework CrossNet-VGA based on variational collaboration and graph attention fusion. Specifically, We formulate a novel multi-view evidence lower bound to explicitly separate view-specific latent variables and cross-view shared latent variables, and achieve inter-view semantic fusion by integrating variational distributions shared across views. Contrastive learning is employed to maximize mutual information and promote feature distribution uniformity, thereby achieving consistent representation learning. We employ dynamic k-nearest neighbor graph construction and multi-head graph attention mechanisms to capture the inter-sample deep topological correlations, achieving robust structural alignment. Comprehensive experiments conducted on 6 public datasets demonstrate that CrossNet-VGA significantly outperforms the competing methods both on accuracy and robustness. The anonymous code of this work is available on GitHub at https://github.com/ggg2111/2025-TIP-CrossNet-VGA.

18 December 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XLXiaocui Li
Xiaocui Li
DHDan He
Dan He
Xinyu ZhangXinyu Zhang
Xinyu Zhang
The challenge of optimally placing facilities to maximize coverage within road networks is a critical problem with significant implications for urban planning, emergency response, and the development of sustainable infrastructure. For instance, strategically locating fire stations or electric vehicle (EV) charging stations along a road network can greatly enhance public safety and support the adoption of clean transportation technologies. However, determining these optimal placements is computationally challenging, particularly when accounting for factors like road network distances and coverage radius. Traditional methods, such as greedy algorithms, offer a reasonable approximation but are limited by high computational complexity, making them less suitable for large-scale transportation networks. In response, our research introduces two novel algorithms designed to improve both the efficiency and scalability of the $k$ -radius coverage problem. The first algorithm achieves a strong approximation with significantly reduced time complexity, while the second employs a sketch-based approach, offering a nearly linear time complexity relative to the number of edges. Although the second algorithm sacrifices some approximation accuracy, it offers substantial gains in computational speed, making it particularly valuable for large-scale transportation networks. Extensive experiments on large-scale real-world road networks demonstrate the superior performance of our proposed methods compared to existing solutions.