Personalized information delivery: an analysis of information filtering methods
Communications of the ACM - Special issue on information filtering
On multiple choice secretary problems
Mathematics of Operations Research
A study of retrospective and on-line event detection
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
On-line new event detection and tracking
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
WebCQ-detecting and delivering information changes on the web
Proceedings of the ninth international conference on Information and knowledge management
Information delivery systems: an exploration of Web pull and push technologies
Communications of the AIS
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Hermes: a notification service for digital libraries
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
A study of thresholding strategies for text categorization
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
The score-distributional threshold optimization for adaptive binary classification tasks
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Maximum likelihood estimation for filtering thresholds
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Continuous queries over data streams
ACM SIGMOD Record
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Publish/Subscribe on the Web at Extreme Speed
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Alert: An Architecture for Transforming a Passive DBMS into an Active DBMS
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Information Alert in Distributed Digital Libraries: The Models, Languages, and Architecture of DIAS
ECDL '02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries
Using graded relevance assessments in IR evaluation
Journal of the American Society for Information Science and Technology
Monitoring the dynamic web to respond to continuous queries
WWW '03 Proceedings of the 12th international conference on World Wide Web
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Adaptive sampling for thresholding in document filtering and classification
Information Processing and Management: an International Journal
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient filtering of composite events
BNCOD'03 Proceedings of the 20th British national conference on Databases
Fostering knowledge sharing by inverse search
Proceedings of the 4th international conference on Knowledge capture
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
Closing Information Gaps with Inverse Search
PAKM '08 Proceedings of the 7th International Conference on Practical Aspects of Knowledge Management
Optimization of bounded continuous search queries based on ranking distributions
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Optimizing queries to remote resources
Journal of Intelligent Information Systems
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed top-k full-text content dissemination
Distributed and Parallel Databases
Hi-index | 0.00 |
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous search queries may concern not only the quality of retrieved results but also the freshness of results, i.e. the time between the availability of a respective data object on the Web and the notification of a user by the search engine. In some cases a user should be notified immediately since the value of the respective information decreases quickly, as e.g. news about companies that affect the value of respective stocks, or sales offers for products that may no longer be available after a short period of time. In the document filtering literature, the optimization of such queries is usually based on threshold classification. Documents above a quality threshold are returned to a user. The threshold is tuned in order to optimize the quality of retrieved results. The disadvantage of such approaches is that the amount of information returned to a user may hardly be controlled without further user-interaction. In this paper, we consider the optimization of bounded continuous search queries where only the estimated best k elements are returned to a user. We present a new optimization method for bounded continuous search queries based on the optimal stopping theory and compare the new method to methods currently applied by Web search systems. The new method provides results of significantly higher quality for the cases where very fresh results have to be delivered.