91 research outputs found
Reinforcement learning based local search for grouping problems: A case study on graph coloring
Grouping problems aim to partition a set of items into multiple mutually
disjoint subsets according to some specific criterion and constraints. Grouping
problems cover a large class of important combinatorial optimization problems
that are generally computationally difficult. In this paper, we propose a
general solution approach for grouping problems, i.e., reinforcement learning
based local search (RLS), which combines reinforcement learning techniques with
descent-based local search. The viability of the proposed approach is verified
on a well-known representative grouping problem (graph coloring) where a very
simple descent-based coloring algorithm is applied. Experimental studies on
popular DIMACS and COLOR02 benchmark graphs indicate that RLS achieves
competitive performances compared to a number of well-known coloring
algorithms
Fast and Accurate Recognition of Chinese Clinical Named Entities with Residual Dilated Convolutions
Clinical Named Entity Recognition (CNER) aims to identify and classify
clinical terms such as diseases, symptoms, treatments, exams, and body parts in
electronic health records, which is a fundamental and crucial task for clinical
and translation research. In recent years, deep learning methods have achieved
significant success in CNER tasks. However, these methods depend greatly on
Recurrent Neural Networks (RNNs), which maintain a vector of hidden activations
that are propagated through time, thus causing too much time to train models.
In this paper, we propose a Residual Dilated Convolutional Neural Network with
Conditional Random Field (RD-CNN-CRF) to solve it. Specifically, Chinese
characters and dictionary features are first projected into dense vector
representations, then they are fed into the residual dilated convolutional
neural network to capture contextual features. Finally, a conditional random
field is employed to capture dependencies between neighboring tags.
Computational results on the CCKS-2017 Task 2 benchmark dataset show that our
proposed RD-CNN-CRF method competes favorably with state-of-the-art RNN-based
methods both in terms of computational performance and training time.Comment: 8 pages, 3 figures. Accepted as regular paper by 2018 IEEE
International Conference on Bioinformatics and Biomedicine. arXiv admin note:
text overlap with arXiv:1804.0501
Bootstrapping Multi-view Representations for Fake News Detection
Previous researches on multimedia fake news detection include a series of
complex feature extraction and fusion networks to gather useful information
from the news. However, how cross-modal consistency relates to the fidelity of
news and how features from different modalities affect the decision-making are
still open questions. This paper presents a novel scheme of Bootstrapping
Multi-view Representations (BMR) for fake news detection. Given a multi-modal
news, we extract representations respectively from the views of the text, the
image pattern and the image semantics. Improved Multi-gate Mixture-of-Expert
networks (iMMoE) are proposed for feature refinement and fusion.
Representations from each view are separately used to coarsely predict the
fidelity of the whole news, and the multimodal representations are able to
predict the cross-modal consistency. With the prediction scores, we reweigh
each view of the representations and bootstrap them for fake news detection.
Extensive experiments conducted on typical fake news detection datasets prove
that the proposed BMR outperforms state-of-the-art schemes.Comment: Authors are from Fudan University, China. Under Revie
- …