Summary
In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous‐time event‐triggered distributed subgradient projective algorithm (C‐ETDSP algorithm), to greatly cut down the number of communication flows, is designed. In the C‐ETDSP algorithm, the demand for step‐size is weakened to a general step‐size of square nonsummable. Then it is proved that the Zeno behavior did not exist in the continuous‐time event‐triggered mechanism. In addition, the convergence of different types of step‐sizes is further compared. Finally, the effectiveness of the design algorithm and the correctness of the theoretical results are verified by a simulation example.
Spotting rumors from social media and intervening early has always been a daunting challenge. In recent years, Deep neural networks have begun to discover rumors by exploring the way of rumor propagation. The existing static graph models either only focus on the spatial structure information of rumor propagation or on time series propagation information but do not effectively combine them. This paper proposes the Static Spatiotemporal Model (SSM), which first extracts the textual semantic information and constructs undirected and directed propagation trees. Then obtains spatial structure information of rumor propagation through Graph Convolutional Network and extracts time series propagation information through the Recurrent Neural Network. The extracted spatiotemporal information is enhanced using different source node information hopping. Finally, SSM uses a weighted connection ensemble to rumor classification. Experimentally validated on datasets such as Weibo and Twitter, the results show that the proposed method outperforms several state-of-the-art static graph models. To better apply SSM in early detection and characterize early concepts, this paper presents a new data collection index for early detection, which can detect events that spread faster and have more significant influence in a targeted manner. The experimental results on the new indicators further verify the superiority of SSM as it can extract sufficient information in early detection or events with fewer participants.
Telecom fraud detection is of great significance in online social networks. Yet the massive, redundant, incomplete, and uncertain network information makes it a challenging task to handle. Hence, this paper mainly uses the correlation of attributes by entropy function to optimize the data quality and then solves the problem of telecommunication fraud detection with incomplete information. First, to filter out redundancy and noise, we propose an attribute reduction algorithm based on max-correlation and max-independence rate (MCIR) to improve data quality. Then, we design a rough-gain anomaly detection algorithm (MCIR-RGAD) using the idea of maximal consistent blocks to deal with missing incomplete data. Finally, the experimental results on authentic telecommunication fraud data and UCI data show that the MCIR-RGAD algorithm provides an effective solution for reducing the computation time, improving the data quality, and processing incomplete data.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.