On the spatiotemporal burstiness of terms
Authors:
Open Access
- 1 May 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (9) , 836-847
Abstract
Thousands of documents are made available to the users via the web on a daily basis. One of the most extensively studied problems in the context of such document streams is burst identification . Given a term t , a burst is generally exhibited when an unusually high frequency is observed for t . While spatial and temporal burstiness have been studied individually in the past, our work is the first to simultaneously track and measure spatiotemporal term burstiness . In addition, we use the mined burstiness information toward an efficient document-search engine: given a user's query of terms, our engine returns a ranked list of documents discussing influential events with a strong spatiotemporal impact. We demonstrate the efficiency of our methods with an extensive experimental evaluation on real and synthetic datasets.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- SwarmProceedings of the VLDB Endowment, 2010
- Discovery of convoys in trajectory databasesProceedings of the VLDB Endowment, 2008
- Bursty Feature Representation for Clustering Text Streams2007
- Efficient Mining of Emerging Events in a Dynamic Spatiotemporal EnvironmentLecture Notes in Computer Science, 2006
- Indexing spatiotemporal archivesThe VLDB Journal, 2005
- Efficient Mining of Spatiotemporal Patterns2001
- Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine LearningJournal of Computer and System Sciences, 1996
- On the Maximum Weight Clique ProblemMathematics of Operations Research, 1987
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- DIRECT AND INVERSE SOLUTIONS OF GEODESICS ON THE ELLIPSOID WITH APPLICATION OF NESTED EQUATIONSSurvey Review, 1975