Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Albert Blarer

dblp:161/4379 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-1525-0315ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Web and social media mining · 67% Information retrieval · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 77% Reconfigurable computing and FPGAs · 23%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph mining
graph pattern mining
0.712023
GraphINC: Graph Pattern Mining at Network Speed · Proc. ACM Manag. Data 2023
Web and social media mining
event detection
0.512021
Event Detection on Microposts: A Comparison of Four Approaches · IEEE Trans. Knowl. Data Eng. 2021
Information retrieval › search engines
semantic search
0.512021
Event Detection on Microposts: A Comparison of Four Approaches · IEEE Trans. Knowl. Data Eng. 2021

Methods — techniques the papers use, named apart from their topics

hardware offloading · 1.3graph partitioning · 1.3word embeddings · 0.5temporal query expansion · 0.5keyword search · 0.5
YearPublicationVenuePosition
2023 GraphINC: Graph Pattern Mining at Network Speed
abstract
Graph Pattern Mining (GPM) is a class of algorithms that identifies given shapes within a graph, e.g., cliques of a certain size. Any area of a graph can contain a shape of interest, but in real-world graphs, these shapes tend to be concentrated in areas deemed skewed. Because mining skewed areas can dominate GPM computations, the overwhelming majority of state-of-the-art GPM techniques break such areas into many small parts and load balance them across servers. This paper takes a diametrically opposite approach: we suggest a framework that concentrates rather than divides the skewed areas. Our framework, called GraphINC, relies on two key innovations. First, it introduces a new graph partitioning scheme capable of separating the skewed area from the rest of the graph. Second, it offloads the skewed part onto a new class of hardware accelerator, a programmable network switch. We implemented our framework to leverage a commercial 100 Gbps switch and obtained results 6.5 to 52.4× faster thanks to our novel offloading technique.
Rana Hussein, Alberto Lerner, André Ryser, Lucas David Bürgi, Albert Blarer, Philippe Cudré-Mauroux
Proc. ACM Manag. Data5
2021 Event Detection on Microposts: A Comparison of Four Approaches
abstract
Microblogging services such as Twitter are important, up-to-date, and live sources of information on a multitude of topics and events. An increasing number of systems use such services to detect and analyze events in real-time as they unfold. In this context, we recently proposed ArmaTweet-a system developed in collaboration among armasuisse and the Universities of Oxford and Fribourg to support semantic event detection on Twitter streams. Our experiments have shown that ArmaTweet is successful at detecting many complex events that cannot be detected by simple keyword-based search methods alone. Building up on this work, we explore in this paper several approaches for event detection on microposts. In particular, we describe and compare four different approaches based on keyword search (Plain-Seed-Query), information retrieval (Temporal Query Expansion), Word2Vec word embeddings (Embedding), and semantic retrieval (ArmaTweet). We provide an extensive empirical evaluation of these techniques using a benchmark dataset of about 200 million tweets on six event categories that we collected. While the performance of individual systems varies depending on the event category, our results show that ArmaTweet outperforms the other approaches on five out of six categories, and that a combined approach offers highest recall without adversely affecting precision of event detection.
Akansha Bhardwaj, Albert Blarer, Philippe Cudré-Mauroux, Vincent Lenders, Boris Motik, Axel Tanner, Alberto Tonon
IEEE Trans. Knowl. Data Eng.2
2017 ArmaTweet: Detecting Events by Semantic Tweet Analysis
Alberto Tonon, Philippe Cudré-Mauroux, Albert Blarer, Vincent Lenders, Boris Motik
ESWC (2)3