812 research outputs found
Data Leak Detection As a Service: Challenges and Solutions
We describe a network-based data-leak detection (DLD)
technique, the main feature of which is that the detection
does not require the data owner to reveal the content of the
sensitive data. Instead, only a small amount of specialized
digests are needed. Our technique – referred to as the fuzzy
fingerprint – can be used to detect accidental data leaks due
to human errors or application flaws. The privacy-preserving
feature of our algorithms minimizes the exposure of sensitive
data and enables the data owner to safely delegate the
detection to others.We describe how cloud providers can offer
their customers data-leak detection as an add-on service
with strong privacy guarantees.
We perform extensive experimental evaluation on the privacy,
efficiency, accuracy and noise tolerance of our techniques.
Our evaluation results under various data-leak scenarios
and setups show that our method can support accurate
detection with very small number of false alarms, even
when the presentation of the data has been transformed. It
also indicates that the detection accuracy does not degrade
when partial digests are used. We further provide a quantifiable
method to measure the privacy guarantee offered by our
fuzzy fingerprint framework
A survey of recommender systems for energy efficiency in buildings: Principles, challenges and prospects
Recommender systems have significantly developed in recent years in parallel
with the witnessed advancements in both internet of things (IoT) and artificial
intelligence (AI) technologies. Accordingly, as a consequence of IoT and AI,
multiple forms of data are incorporated in these systems, e.g. social,
implicit, local and personal information, which can help in improving
recommender systems' performance and widen their applicability to traverse
different disciplines. On the other side, energy efficiency in the building
sector is becoming a hot research topic, in which recommender systems play a
major role by promoting energy saving behavior and reducing carbon emissions.
However, the deployment of the recommendation frameworks in buildings still
needs more investigations to identify the current challenges and issues, where
their solutions are the keys to enable the pervasiveness of research findings,
and therefore, ensure a large-scale adoption of this technology. Accordingly,
this paper presents, to the best of the authors' knowledge, the first timely
and comprehensive reference for energy-efficiency recommendation systems
through (i) surveying existing recommender systems for energy saving in
buildings; (ii) discussing their evolution; (iii) providing an original
taxonomy of these systems based on specified criteria, including the nature of
the recommender engine, its objective, computing platforms, evaluation metrics
and incentive measures; and (iv) conducting an in-depth, critical analysis to
identify their limitations and unsolved issues. The derived challenges and
areas of future implementation could effectively guide the energy research
community to improve the energy-efficiency in buildings and reduce the cost of
developed recommender systems-based solutions.Comment: 35 pages, 11 figures, 1 tabl
A Comparative Study of Pairwise Learning Methods based on Kernel Ridge Regression
Many machine learning problems can be formulated as predicting labels for a
pair of objects. Problems of that kind are often referred to as pairwise
learning, dyadic prediction or network inference problems. During the last
decade kernel methods have played a dominant role in pairwise learning. They
still obtain a state-of-the-art predictive performance, but a theoretical
analysis of their behavior has been underexplored in the machine learning
literature.
In this work we review and unify existing kernel-based algorithms that are
commonly used in different pairwise learning settings, ranging from matrix
filtering to zero-shot learning. To this end, we focus on closed-form efficient
instantiations of Kronecker kernel ridge regression. We show that independent
task kernel ridge regression, two-step kernel ridge regression and a linear
matrix filter arise naturally as a special case of Kronecker kernel ridge
regression, implying that all these methods implicitly minimize a squared loss.
In addition, we analyze universality, consistency and spectral filtering
properties. Our theoretical results provide valuable insights in assessing the
advantages and limitations of existing pairwise learning methods.Comment: arXiv admin note: text overlap with arXiv:1606.0427
Social software for music
Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 200
- …