Accurate traffic forecasting is essential for urban traffic control, route planning, and flow detection. Although many spatial-temporal methods are currently proposed, they are still deficient in synchronously capturi...
详细信息
Multi-Span Question Answering (MSQA) requires models to extract one or multiple answer spans from a given context to answer a question. Prior work mainly focuses on designing specific methods or applying heuristic str...
详细信息
Utilization of inter-base station cooperation for information processing has shown great potential in enhancing the overall quality of communication services (QoS) in wireless communication networks. Nevertheless, suc...
详细信息
In this paper, we propose a shot correlation reverse time migration (SC-RTM) method for multiple-input-multiple-output (MIMO) ground penetrating radar (GPR) imaging to improve image contrast. In GPR applications, nois...
详细信息
ISBN:
(数字)9798350348187
ISBN:
(纸本)9798350348194
In this paper, we propose a shot correlation reverse time migration (SC-RTM) method for multiple-input-multiple-output (MIMO) ground penetrating radar (GPR) imaging to improve image contrast. In GPR applications, noise is unavoidable in radar echo signals and can cause artifacts in the subsurface reconstructed image. Since in general the correlation among noise signals is weaker than that in target signals, a shot correlation image operator is proposed to integrate all shot images and arrive at the final reconstructed image with artifacts suppression and resolution improvement. In numerical experiments, to test the performance of artifacts suppression, we add different noise levels in the synthetic GPR data. It is shown that the noise is effectively suppressed and the contrast between targets and artifacts is improved in reconstructed images of the SC-RTM method by more than 15 dB. The measured MIMO GPR echo signals with significant noises are successfully processed by the SC-RTM method to yield high contrast subsurface images.
The rapid growth of electronic commerce brings convenience to modern life but comes with security risks by various cybercrimes in online payment services. Most existing security methods for fraud detection depend on t...
The rapid growth of electronic commerce brings convenience to modern life but comes with security risks by various cybercrimes in online payment services. Most existing security methods for fraud detection depend on the static learning paradigm, which trains a model over a static training dataset and deploys the trained model for inference with the frozen model parameters under the i.i.d. assumption. Unfortunately, this paradigm becomes incommensurate with the increasingly complicated and varying fraud patterns due to the untimely and delayed responses in the offline environment. Without sensing the evolution of fraud timely, it is challenging to train and deploy targeted countermeasures. The emerging means of fraud are not only reflected in the openness of their category, but also in the drift of their superimposed risk features. The interweaving of open-category and concept drift accelerates the process of existing methods becoming powerless. In this paper, we propose EvoFD, an online evolving fraud detection framework to enable continual learning to cope with undercurrent surges of evolving fraud. The core idea of EvoFD is to weaken the bias caused by the anchoring effect on the learned information. It learns in an online streaming fashion by using instructive representations as anchors. Specially, we maintain the progressively updatable class anchors and optimize the representation network to embed features and class anchors into a unified normalized space, where the training and predicting can be conducted simultaneously or independently. In the framework, we preserve the balanced replay memory for each class to accumulate knowledge and avoid forgetting. The advantages of our method are validated by extensive experiments over the real-world dataset from a prestigious bank.
Clustered federated learning is a federated learning method based on multi-task learning. It groups similar clients into the same clusters and shares model parameters to solve the problem that the joint model is trapp...
详细信息
ISBN:
(纸本)9781450398336
Clustered federated learning is a federated learning method based on multi-task learning. It groups similar clients into the same clusters and shares model parameters to solve the problem that the joint model is trapped in local optima on Non-IID data. Most of the existing clustered federated learning methods are based on the difference of model parameters for clients clustering. During the client model training process, the model parameters are biased and the clustering result is affected due to insufficient samples and missing eigenvalues in the dataset. In this paper, we develop a clustered federated learning method based on data distribution difference (FedDDB) in the dataset level. The method in this paper focuses on the distribution of label probability and eigenvalues, analyzes the difference of data distribution difference between clients and measures the distance between datasets which is used for client clustering. Every cluster will be trained independently and in parallel on the cluster center model. At the beginning of each round of training, the client clustering process needs to be repeated. We conduct relevant experiments and demonstrate the effectiveness of our method.
Deep clustering plays an important role in data analysis, and with the prevalence of graph data nowadays, various deep clustering models on graph are constantly proposed. However, due to the lack of more adequate clus...
详细信息
Ensemble methods have been shown to improve graph neural networks (GNNs). Existing ensemble methods on graphs determine a strong classifier by combining a set of trained base classifiers, i.e., combining the final out...
详细信息
Multi-source location is a significant application in the field of robot swarm and is required to find all sources whose number and distribution are unknown in advance. With few parameters and fast search, Particle Sw...
详细信息
Multi-source location is a significant application in the field of robot swarm and is required to find all sources whose number and distribution are unknown in advance. With few parameters and fast search, Particle Swarm Optimizer (PSO) variants that have certain grouping capability have been applied to address multi-source location problems by dividing a swarm such that every source has robots to locate. However, they are difficult to predetermine the exact number of groups, require a big number of robots, and are easily trapped in the no-signal areas when the proportion of no-signal areas is high. This work proposes a Virtual-source and Virtual-swarm-based PSO (VVPSO) to divide a search area into multiple cells equally, each of which has a virtual source in its center. Then, instead of robots grouping, only one group of robots is employed to traverse all virtual sources, and search their corresponding cells to locate real sources by a new PSO called Real-virtual mapping PSO (RMPSO). RMPSO asymmetrically maps a robot into a particle swarm with multiple virtual particles to perform PSO, which greatly reduces the requirements for the number of robots. Experimental results show that VVPSO has great search scalability and can solve large-scale multi-source location problems than two state-of-the-art grouping methods and three representative multimodal PSO variants, even with only one robot. Hence, this work greatly advances the field of multi-source location by using mobile robot swarm. IEEE
The ability of road networks to withstand external disturbances is a crucial measure of transportation system performance, where resilience distinctly emerges as an effective perspective for its unique insights into t...
详细信息
暂无评论