Arthur Nádas
IEEE Transactions on Neural Networks
In this paper we address the issue of continuous keyword queries on multiple textual streams and explore techniques for extracting useful information from them. The paper represents, to our best knowledge, the first approach that performs keyword search on a multiplicity of textual streams. The scenario that we consider is quite intuitive; let's assume that a research or financial analyst is searching for information on a topic, continuously polling data from multiple (and possibly heterogeneous) text streams, such as RSS feeds, blogs, etc. The topic of interest can be described with the aid of several keywords. Current filtering approaches would just identify single text streams containing some of the keywords. However, it would be more flexible and powerful to search across multiple streams, which may collectively answer the analyst's question. We present such model that takes in consideration the continuous flow of text in streams and uses efficient pipelined algorithms such that results are output as soon as they are available. The proposed model is evaluated analytically and experimentally, where the Enron dataset and a variety of blog datasets are used for our experiments.
Arthur Nádas
IEEE Transactions on Neural Networks
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022