Stream Reasoning: a Survey and Outlook: A summary of ten years of research and a vision for the next decade

D Dell'Aglio, E Della Valle, F van Harmelen… - Data …, 2017 - journals.sagepub.com
Stream reasoning studies the application of inference techniques to data characterised by
being highly dynamic. It can find application in several settings, from Smart Cities to Industry …

Recent advancements in event processing

M Dayarathna, S Perera - ACM Computing Surveys (CSUR), 2018 - dl.acm.org
Event processing (EP) is a data processing technology that conducts online processing of
event information. In this survey, we summarize the latest cutting-edge work done on EP …

Foundations and modeling of dynamic networks using dynamic graph neural networks: A survey

J Skarding, B Gabrys, K Musial - iEEE Access, 2021 - ieeexplore.ieee.org
Dynamic networks are used in a wide range of fields, including social network analysis,
recommender systems and epidemiology. Representing complex networks as structures …

Competitive caching with machine learned advice

T Lykouris, S Vassilvitskii - Journal of the ACM (JACM), 2021 - dl.acm.org
Traditional online algorithms encapsulate decision making under uncertainty, and give ways
to hedge against all possible future events, while guaranteeing a nearly optimal solution, as …

[BOOK][B] Machine learning for data streams: with practical examples in MOA

A Bifet, R Gavalda, G Holmes, B Pfahringer - 2023 - books.google.com
A hands-on approach to tasks and techniques in data stream mining and real-time analytics,
with examples in MOA, a popular freely available open-source software framework. Today …

Near-optimal bounds for online caching with machine learned advice

D Rohatgi - Proceedings of the Fourteenth Annual ACM-SIAM …, 2020 - SIAM
In the model of online caching with machine learned advice, introduced by Lykouris and
Vassilvitskii, the goal is to solve the caching problem with an online algorithm that has …

Fast memory-efficient anomaly detection in streaming heterogeneous graphs

E Manzoor, SM Milajerdi, L Akoglu - Proceedings of the 22nd ACM …, 2016 - dl.acm.org
Given a stream of heterogeneous graphs containing different types of nodes and edges,
how can we spot anomalous ones in real-time while consuming bounded memory? This …

Massively parallel computation: Algorithms and applications

S Im, R Kumar, S Lattanzi, B Moseley… - … and Trends® in …, 2023 - nowpublishers.com
The algorithms community has been modeling the underlying key features and constraints of
massively parallel frameworks and using these models to discover new algorithmic …

Spotlight: Detecting anomalies in streaming graphs

D Eswaran, C Faloutsos, S Guha… - Proceedings of the 24th …, 2018 - dl.acm.org
How do we spot interesting events from e-mail or transportation logs? How can we detect
port scan or denial of service attacks from IP-IP communication data? In general, given a …

Exploiting locality in graph analytics through hardware-accelerated traversal scheduling

A Mukkara, N Beckmann, M Abeydeera… - 2018 51st Annual …, 2018 - ieeexplore.ieee.org
Graph processing is increasingly bottlenecked by main memory accesses. On-chip caches
are of little help because the irregular structure of graphs causes seemingly random memory …