Xianghua Li

Xianghua Li

Auto-generated profile, based on publicly available information

Xianghua Li

Northwestern Polytechnical University, Xi'an, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
18 February 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Chao GaoChao Gao
Chao Gao
YFYi Fan
Yi Fan
SJShihong Jiang
Shihong Jiang
YDYue Deng
Yue Deng
JLJiming Liu
Jiming Liu
XLXianghua Li
Xianghua Li
Robustness is one of the most important performance criteria for any rail transit network (RTN), because it helps us enhance the efficiency of RTN. Several studies have addressed the issue of RTN robustness primarily from the perspectives of given rail network structures or static distributions of passenger flow. An open problem that remains in fully understanding RTN robustness is how to take the spatio-temporal characteristics of passenger travel into consideration, since the dynamic passenger flow in an RTN can readily trigger unexpected cascading failures. This paper addresses this problem as follows: (1) we propose a two-layer rail transit network (TL-RTN) model that captures the interactions between a rail network and its corresponding dynamic passenger flow network, and then (2) we conduct the cascading failure analysis of the TL-RTN model based on an extended coupled map lattice (CML). Specifically, our proposed model takes the strategy of passenger flow redistribution and the passenger flow capacity of each station into account to simulate the human mobility behaviors and to estimate the maximum passenger flow appeal in each station, respectively. Based on the smart card data of RTN passengers in Shanghai, our experiments show that the TL-RTN robustness is related to both external perturbations and failure modes. Moreover, during the peak hours on weekdays, due to the large passenger flow, a small perturbation will trigger a 20% cascading failure of a network. Having ranked the cascade size caused by the stations, we find that this phenomenon is determined by both the hub nodes and their neighbors.

25 May 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZWZhen Wang
Zhen Wang
CWChunyu Wang
Chunyu Wang
XLXianghua Li
Xianghua Li
Chao GaoChao Gao
Chao Gao
XLXuelong Li
Xuelong Li
JZJunyou Zhu
Junyou Zhu
Community structure division is a crucial problem in the field of network data analysis. Algorithms based on Markov chains are easy to use and provide promising solutions for community detection. In a Markov chain-based algorithm (i.e., MCL), a flow distribution matrix and a transition matrix are used to describe stochastic flows and transition probabilities, respectively, on a network. The dynamic interaction process between stochastic flows and transition probabilities in MCLs is manifested through an iterative process of updating the abovementioned two matrices. As one of the key mechanisms of MCLs, such a dynamic process for increasing the inhomogeneity directly affects the accuracy and computational cost of MCL-based methods. Inspired by a kind of positive feedback interaction of a dendritic network of tube-like amoeba cell pseudopodia (named the Physarum foraging network), a Physarum -inspired relationship among vertices is proposed to enhance the transition probability in the dynamic process of MCL-based community detection algorithms. Specifically, the proposed hybrid community detection algorithm can adaptively search for a better combination of parameters based on a genetic algorithm. Some experiments are carried out on both static and dynamic networks. The results show that the unique Physarum inspired algorithm achieved better computational efficiency and detection performance than other algorithms.

9 April 2025 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
XLXianghua Li
Xianghua Li
JQJiao Qiao
Jiao Qiao
SYShu Yin
Shu Yin
LWLianwei Wu
Lianwei Wu
Chao GaoChao Gao
Chao Gao
XLXuelong Li
Xuelong Li
The growth of social media platforms has made it easier for fake news to spread, which poses a significant threat to authoritative news outlets, politics, and public health. Manual verification of the massive amount of online information has proven to be a daunting task, which has led to the growing interest in automatic fake news detection. Some methods that rely on news text, images, external knowledge, social contexts, or propagation graphs have demonstrated good performance. In contrast to earlier studies that focused solely on the unimodal news textual information, recent works have integrated multimodal features from various granularities, such as words, visual semantic regions, and multimodal entities, to more effectively leverage news content and align with human reading habits. However, a comprehensive review of Multimodal Fake News Detection (MFND) is still lacking, prompting our aim to complement this topic. Specifically, we present a systematic taxonomy from the perspective of cross-modal interactions. We categorize existing methods into the data-based, entity-based, and knowledge-based approaches. Connections between various works are detailed when outlining representative papers. Additionally, we introduce prevalent multimodal learning methods, present accessible MFND datasets and evaluation metrics, and analyze current research results. Finally, the promising future research directions are discussed.


28 September 2020 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
ZWZhen Wang
Zhen Wang
CWChunyu Wang
Chunyu Wang
CGChao Gao
Chao Gao
XLXuelong Li
Xuelong Li
XLXianghua Li
Xianghua Li

14 September 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
CGChao Gao
Chao Gao
ZWZhen Wang
Zhen Wang
XLXianghua Li
Xianghua Li
ZZZili Zhang
Zili Zhang
WZWei Zeng
Wei Zeng
Several technical indicators have been proposed to assess the impact of authors and institutions. Here, we combine the h-index and the PageRank algorithm to do away with some of the individual limitations of these two indices. Most importantly, we aim to take into account value differences between citations-evaluating the citation sources by defining the h-index using the PageRank score rather than with citations. The resulting PR-index is then constructed by evaluating source popularity as well as the source publication authority. Extensive tests on available collections data (i.e., Microsoft Academic Search and benchmarks on the SIGKDD innovation award) show that the PR-index provides a more balanced impact measure than many existing indices. Due to its simplicity and similarity to the popular h-index, the PR-index may thus become a welcome addition to the technical indices already in use. Moreover, growth dynamics prior to the SIGKDD innovation award indicate that the PR-index might have notable predictive power.