Persistent queries over dynamic text streams
by Javed Aslam, Ekaterina Pelekhov, Daniela Rus
International Journal of Electronic Business (IJEB), Vol. 3, No. 3/4, 2005

Abstract: We wish to develop automated tools for information organisation that support information processing in the age of information overload. We present a filtering-based approach to persistent queries that uses clustering. We use the online version of the star algorithm developed in our previous work as our clustering tool because this algorithm computes, with high precision, naturally occurring topics in a collection and it admits an efficient online solution for dynamic streams of text. We describe the principle behind the filtering algorithms and show experimental data. We then discuss a system that uses these algorithms in support of information push by allowing users to submit persistent queries. Finally, we evaluate the persistent query system using TREC data.

Online publication date: Thu, 30-Jun-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Business (IJEB):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com