7,205 research outputs found
HHMM at SemEval-2019 Task 2: Unsupervised Frame Induction using Contextualized Word Embeddings
We present our system for semantic frame induction that showed the best
performance in Subtask B.1 and finished as the runner-up in Subtask A of the
SemEval 2019 Task 2 on unsupervised semantic frame induction (QasemiZadeh et
al., 2019). Our approach separates this task into two independent steps: verb
clustering using word and their context embeddings and role labeling by
combining these embeddings with syntactical features. A simple combination of
these steps shows very competitive results and can be extended to process other
datasets and languages.Comment: 5 pages, 3 tables, accepted at SemEval 201
Probabilistic Relational Model Benchmark Generation
The validation of any database mining methodology goes through an evaluation
process where benchmarks availability is essential. In this paper, we aim to
randomly generate relational database benchmarks that allow to check
probabilistic dependencies among the attributes. We are particularly interested
in Probabilistic Relational Models (PRMs), which extend Bayesian Networks (BNs)
to a relational data mining context and enable effective and robust reasoning
over relational data. Even though a panoply of works have focused, separately ,
on the generation of random Bayesian networks and relational databases, no work
has been identified for PRMs on that track. This paper provides an algorithmic
approach for generating random PRMs from scratch to fill this gap. The proposed
method allows to generate PRMs as well as synthetic relational data from a
randomly generated relational schema and a random set of probabilistic
dependencies. This can be of interest not only for machine learning researchers
to evaluate their proposals in a common framework, but also for databases
designers to evaluate the effectiveness of the components of a database
management system
Random Access Schemes in Wireless Systems With Correlated User Activity
Traditional random access schemes are designed based on the aggregate process
of user activation, which is created on the basis of independent activations of
the users. However, in Machine-Type Communications (MTC), some users are likely
to exhibit a high degree of correlation, e.g. because they observe the same
physical phenomenon. This paves the way to devise access schemes that combine
scheduling and random access, which is the topic of this work. The underlying
idea is to schedule highly correlated users in such a way that their
transmissions are less likely to result in a collision. To this end, we propose
two greedy allocation algorithms. Both attempt to maximize the throughput using
only pairwise correlations, but they rely on different assumptions about the
higher-order dependencies. We show that both algorithms achieve higher
throughput compared to the traditional random access schemes, suggesting that
user correlation can be utilized effectively in access protocols for MTC.Comment: Submitted to SPAWC 201
- …