Wenxiang Dong

Wenxiang Dong

Auto-generated profile, based on publicly available information

Wenxiang Dong

Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 July 2013
Verified
Conference Paper
Closed access
WDWenxiang Dong
Wenxiang Dong
WZWenyi Zhang
Wenyi Zhang
Chee Wei TanChee Wei Tan
Chee Wei Tan
Suppose that a rumor originating from a single source among a set of suspects spreads in a network, how to root out this rumor source? With the a priori knowledge of suspect nodes and a snapshot observation of infected nodes, we construct a maximum a posteriori (MAP) estimator to identify the rumor source using the susceptible-infected (SI) model. We propose to use a notion of local rumor center to characterize P c (n), the correct detection probability of the source estimator upon observing n infected nodes, in both the finite and asymptotic regimes, for regular trees of node degree δ. First, when all nodes are suspects, lim n→∞ P c (n) grows from 0.25 to 0.307 as δ increases from three to infinity, a result first established in Shah and Zaman (2011, 2012) via a different approach; furthermore, P c (n) monotonically decreases with n and increases with δ even in the finite-n regime. Second, when the suspect nodes form a connected subgraph of the network, lim n→∞ P c (n) significantly exceeds the a priori probability if δ ≥ 3, and reliable detection is achieved as δ becomes sufficiently large; furthermore, P c (n) monotonically decreases with n and increases with δ. Third, when there are only two suspect nodes, lim n→∞ P c (n) is at least 0.75 if δ ≥ 3; and P c (n) increases with the distance between the two suspects. Fourth, when there are multiple suspect nodes, among all possible connection patterns, that all the suspects form a single connected subgraph yields the smallest P c (n). Our analysis leverages ideas from the Pólya's urn model in probability theory and sheds insight into the behavior of the rumor spreading process not only in the asymptotic regime but also for the general finite-n regime.

14 January 2022 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
FAFarooq Ahmed
Farooq Ahmed
LWLingbo Wei
Lingbo Wei
YNYukun Niu
Yukun Niu
TZTianyu Zhao
Tianyu Zhao
WZWei Zhang
Wei Zhang
WDWenxiang Dong
Wenxiang Dong

9 May 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
JWJinguang Wang
Jinguang Wang
SQShengsheng Qian
Shengsheng Qian
JHJun Hu
Jun Hu
WDWenxiang Dong
Wenxiang Dong
XHXudong Huang
Xudong Huang
RHRichang Hong
Richang Hong
Explainable Fake News Detection (EFND) is a new challenge that aims to verify news authenticity and provide clear explanations for its decisions. Traditional EFND methods often treat the tasks of classification and explanation as separate, ignoring the fact that explanation content can assist in enhancing fake news detection. To overcome this gap, we present a new solution: the End-to-End Explainable Fake News Detection Network ( EExpFND ). Our model includes an evidence-claim variational causal inference component, which not only utilizes explanation content to improve fake news detection but also employs a variational approach to address the distributional bias between the ground truth explanation in the training set and the prediction explanation in the test set. Additionally, we incorporate a masked attention network to detail the nuanced relationships between evidence and claims. Our comprehensive tests across two public datasets show that EExpFND sets a new benchmark in performance. The code is available at https://anonymous.4open.science/r/EExpFND-F5C6 .

1 January 2014 in IEICE Transactions on Communications
Verified
Journal Article
Closed access
YYYing Yang
Ying Yang
WDWenxiang Dong
Wenxiang Dong
WLWeiqiang Liu
Weiqiang Liu
WWWeidong Wang
Weidong Wang

1 April 2015 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
WDWenxiang Dong
Wenxiang Dong
YYYing Yang
Ying Yang
WZWenyi Zhang
Wenyi Zhang
Information diffusion is efficient via gossip or rumor spreading in many of the next generation networks. It is of great importance to select some seed nodes as information sources in a network so as to maximize the gossip spreading. In this paper, we deal with the issue of the selection of information sources, which are initially informed nodes (i.e., seed nodes) in a network, for pull-based gossip protocol. We prove that the gossip spreading maximization problem (GSMP) is NP-hard. We establish a temporal mapping of the gossip spreading process using virtual coupon collectors by leveraging the concept of temporal network, further prove that the gossip spreading process has the property of submodularity, and consequently propose a greedy algorithm for selecting the information sources, which yields a suboptimal solution within 1-1/e of the optimal value for GSMP. Experiments are carried out to study the spreading performance, illustrating the significant superiority of the greedy algorithm over heuristic and random algorithms.

1 August 2012
Verified
Conference Paper
Closed access
WDWenxiang Dong
Wenxiang Dong
WZWenyi Zhang
Wenyi Zhang
XCXiaohui Chen
Xiaohui Chen
GWGuo Wei
Guo Wei
IEEE-802.11-based WLAN MAC performance evaluation is of great importance, especially under non-saturated conditions. A new load equation, respect to the non-saturation, is proposed for analysis of the MAC mechanism in this paper. The load equation together with a backoff equation and a transmission equation are sufficient to analyze the MAC performance under non-saturated conditions. In the new load equation, both traffic arrival and first order buffer memory are considered. In addition, a lower bound derived from the new load equation is found if traffic arrival obeys Poisson distribution. From NS2 simulation results, it is shown that the load equation using the bound outperforms the one only considering traffic arrival significantly, especially as the offered traffic load at each station is moderate.