9,595 research outputs found
Entity Ranking on Graphs: Studies on Expert Finding
Todays web search engines try to offer services for finding various information in addition to simple web pages, like showing locations or answering simple fact queries. Understanding the association of named entities and documents is one of the key steps towards such semantic search tasks. This paper addresses the ranking of entities and models it in a graph-based relevance propagation framework. In particular we study the problem of expert finding as an example of an entity ranking task. Entity containment graphs are introduced that represent the relationship between text fragments on the one hand and their contained entities on the other hand. The paper shows how these graphs can be used to propagate relevance information from the pre-ranked text fragments to their entities. We use this propagation framework to model existing approaches to expert finding based on the entity's indegree and extend them by recursive relevance propagation based on a probabilistic random walk over the entity containment graphs. Experiments on the TREC expert search task compare the retrieval performance of the different graph and propagation models
Adaptive Incremental Mixture Markov chain Monte Carlo
We propose Adaptive Incremental Mixture Markov chain Monte Carlo (AIMM), a
novel approach to sample from challenging probability distributions defined on
a general state-space. While adaptive MCMC methods usually update a parametric
proposal kernel with a global rule, AIMM locally adapts a semiparametric
kernel. AIMM is based on an independent Metropolis-Hastings proposal
distribution which takes the form of a finite mixture of Gaussian
distributions. Central to this approach is the idea that the proposal
distribution adapts to the target by locally adding a mixture component when
the discrepancy between the proposal mixture and the target is deemed to be too
large. As a result, the number of components in the mixture proposal is not
fixed in advance. Theoretically, we prove that there exists a process that can
be made arbitrarily close to AIMM and that converges to the correct target
distribution. We also illustrate that it performs well in practice in a variety
of challenging situations, including high-dimensional and multimodal target
distributions
Bayesian Inference Analysis of Unmodelled Gravitational-Wave Transients
We report the results of an in-depth analysis of the parameter estimation
capabilities of BayesWave, an algorithm for the reconstruction of
gravitational-wave signals without reference to a specific signal model. Using
binary black hole signals, we compare BayesWave's performance to the
theoretical best achievable performance in three key areas: sky localisation
accuracy, signal/noise discrimination, and waveform reconstruction accuracy.
BayesWave is most effective for signals that have very compact time-frequency
representations. For binaries, where the signal time-frequency volume decreases
with mass, we find that BayesWave's performance reaches or approaches
theoretical optimal limits for system masses above approximately 50 M_sun. For
such systems BayesWave is able to localise the source on the sky as well as
templated Bayesian analyses that rely on a precise signal model, and it is
better than timing-only triangulation in all cases. We also show that the
discrimination of signals against glitches and noise closely follow analytical
predictions, and that only a small fraction of signals are discarded as
glitches at a false alarm rate of 1/100 y. Finally, the match between
BayesWave- reconstructed signals and injected signals is broadly consistent
with first-principles estimates of the maximum possible accuracy, peaking at
about 0.95 for high mass systems and decreasing for lower-mass systems. These
results demonstrate the potential of unmodelled signal reconstruction
techniques for gravitational-wave astronomy.Comment: 10 pages, 7 figure
When Things Matter: A Data-Centric View of the Internet of Things
With the recent advances in radio-frequency identification (RFID), low-cost
wireless sensor devices, and Web technologies, the Internet of Things (IoT)
approach has gained momentum in connecting everyday objects to the Internet and
facilitating machine-to-human and machine-to-machine communication with the
physical world. While IoT offers the capability to connect and integrate both
digital and physical entities, enabling a whole new class of applications and
services, several significant challenges need to be addressed before these
applications and services can be fully realized. A fundamental challenge
centers around managing IoT data, typically produced in dynamic and volatile
environments, which is not only extremely large in scale and volume, but also
noisy, and continuous. This article surveys the main techniques and
state-of-the-art research efforts in IoT from data-centric perspectives,
including data stream processing, data storage models, complex event
processing, and searching in IoT. Open research issues for IoT data management
are also discussed
Reasoning with Individuals for the Description Logic SHIQ
While there has been a great deal of work on the development of reasoning
algorithms for expressive description logics, in most cases only Tbox reasoning
is considered. In this paper we present an algorithm for combined Tbox and Abox
reasoning in the SHIQ description logic. This algorithm is of particular
interest as it can be used to decide the problem of (database) conjunctive
query containment w.r.t. a schema. Moreover, the realisation of an efficient
implementation should be relatively straightforward as it can be based on an
existing highly optimised implementation of the Tbox algorithm in the FaCT
system.Comment: To appear at CADE-1
- …