English
Related papers

Related papers: SWOOP: Top-k Similarity Joins over Set Streams

200 papers

Similarity search is the task of retrieving data items that are similar to a given query. In this paper, we introduce the time-sensitive notion of similarity search over endless data-streams (SSDS), which takes into account data quality and…

Information Retrieval · Computer Science 2017-08-08 Naama Kraus , David Carmel , Idit Keidar

In this contribution, we develop an accurate and effective event detection method to detect events from a Twitter stream, which uses visual and textual information to improve the performance of the mining process. The method monitors a…

Information Retrieval · Computer Science 2015-03-16 Samar M. Alqhtani , Suhuai Luo , Brian Regan

We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-05-07 John Augustine , Anisur Rahaman Molla , Ehab Morsy , Gopal Pandurangan , Peter Robinson , Eli Upfal

We consider the scenario of $n$ sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order…

Data Structures and Algorithms · Computer Science 2017-09-22 Felix Biermeier , Björn Feldkord , Manuel Malatyali , Friedhelm Meyer auf der Heide

One of the most fundamental tasks in data science is to assist a user with unknown preferences in finding high-utility tuples within a large database. To accurately elicit the unknown user preferences, a widely-adopted way is by asking the…

Databases · Computer Science 2023-07-07 Guangyi Zhang , Nikolaj Tatti , Aristides Gionis

Consistent sampling is a technique for specifying, in small space, a subset $S$ of a potentially large universe $U$ such that the elements in $S$ satisfy a suitably chosen sampling condition. Given a subset $\mathcal{I}\subseteq U$ it…

Data Structures and Algorithms · Computer Science 2014-04-21 Konstantin Kutzkov , Rasmus Pagh

A public dataset, with a variety of properties suitable for sentiment analysis [1], event prediction, trend detection and other text mining applications, is needed in order to be able to successfully perform analysis studies. The vast…

Computation and Language · Computer Science 2018-02-01 Semiha Makinist , Ibrahim Riza Hallac , Betul Ay Karakus , Galip Aydin

We present an analysis of the dynamics of discussions in Twitter (before it became X) among supporters of various candidates in the 2022 French presidential election, and followers of different types of media. Our study demonstrates that we…

Social and Information Networks · Computer Science 2025-03-10 Rémi Perrier , Laura Hernández , J. Ignacio Alvarez-Hamelin , Mariano G. Beiró Dimitris Kotzinos

Receiving timely and relevant security information is crucial for maintaining a high-security level on an IT infrastructure. This information can be extracted from Open Source Intelligence published daily by users, security organisations,…

Cryptography and Security · Computer Science 2019-04-04 Fernando Alves , Aurélien Bettini , Pedro M. Ferreira , Alysson Bessani

Keyword-based web queries with local intent retrieve web content that is relevant to supplied keywords and that represent points of interest that are near the query location. Two broad categories of such queries exist. The first encompasses…

Databases · Computer Science 2016-08-01 Dingming Wu , Christian S. Jensen

An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where each item arrives with its own expiration time. The special…

Data Structures and Algorithms · Computer Science 2025-09-10 Lotte Blank , Sergio Cabello , MohammadTaghi Hajiaghayi , Robert Krauthgamer , Sepideh Mahabadi , André Nusser , Jeff M. Phillips , Jonas Sauer

We consider in this paper top-k query answering in social tagging systems, also known as folksonomies. This problem requires a significant departure from existing, socially agnostic techniques. In a network-aware context, one can (and…

Information Retrieval · Computer Science 2012-10-08 Silviu Maniu , Bogdan Cautis

Search techniques make use of elementary information such as term frequencies and document lengths in computation of similarity weighting. They can also exploit richer statistics, in particular the number of documents in which any two terms…

Information Retrieval · Computer Science 2020-07-20 Bodo Billerbeck , Justin Zobel , Nicholas Lester , Nick Craswell

Topic modeling is a key component in unsupervised learning, employed to identify topics within a corpus of textual data. The rapid growth of social media generates an ever-growing volume of textual data daily, making online topic modeling…

Machine Learning · Computer Science 2025-10-23 Federica Granese , Benjamin Navet , Serena Villata , Charles Bouveyron

Social networks play a fundamental role in propagation of information and news. Characterizing the content of the messages becomes vital for different tasks, like breaking news detection, personalized message recommendation, fake users…

Information Retrieval · Computer Science 2022-01-04 Federico Albanese , Esteban Feuerstein

The number of publicly available Web services (WS) is continuously growing. To perform efficient WS discovery, it is desirable to organize the WS space. Works in this direction propose to group WS according to certain shared properties.…

Information Retrieval · Computer Science 2013-05-02 Chantal Cherifi , Vincent Labatut , Jean-François Santucci

Utilizing code snippets on Stack Overflow (SO) is a common practice among developers for problem-solving. Although SO code snippets serve as valuable resources, it is important to acknowledge their imperfections, reusing problematic code…

Software Engineering · Computer Science 2024-08-20 Yubo Mai , Zhipeng Gao , Haoye Wang , Tingting Bi , Xing Hu , Xin Xia , Jianling Sun

Recently, considerable efforts have been devoted to approximately computing the global and local (i.e., incident to each node) triangle counts of a large graph stream represented as a sequence of edges. Existing approximate triangle…

Data Structures and Algorithms · Computer Science 2018-11-27 Pinghui Wang , Peng Jia , Yiyan Qi , Yu Sun , Jing Tao , Xiaohong Guan

Social networks are quickly becoming the primary medium for discussing what is happening around real-world events. The information that is generated on social platforms like Twitter can produce rich data streams for immediate insights into…

Social and Information Networks · Computer Science 2019-07-26 Mateusz Fedoryszak , Brent Frederick , Vijay Rajaram , Changtao Zhong

We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets to be a family of itemsets which includes (resp., excludes)…

Data Structures and Algorithms · Computer Science 2012-04-23 Andrea Pietracaprina , Matteo Riondato , Eli Upfal , Fabio Vandin