2014 · 21 citations · 7 references
ComputingComputer ScienceInformation TechnologyData MiningInformation RetrievalText AnalyticsDocument AnalysisDocument DatingDocument ManagementEvent DetectionTemporal Data MiningTrend DetectionBurstiness Modeling
A large number of mainstream applications, like temporal search, event detection, and trend identification, assume knowledge of the timestamp of every document in a given textual collection. In many cases, however, the required timestamps are either unavailable or ambiguous. A charac- teristic instance of this problem emerges in the context of large repositories of old digitized documents. For such doc- uments, the timestamp may be corrupted during the digiti- zation process, or may simply be unavailable. In this paper, we study the task of approximating the timestamp of a doc- ument, so-called document dating. We propose a content- based method and use recent advances in the domain of term burstiness, which allow it to overcome the drawbacks of pre- vious document dating methods, e.g. the fix time partition strategy. We use an extensive experimental evaluation on different datasets to validate the efficacy and advantages of our methodology, showing that our method outperforms the state of the art methods on document dating.
7
On-Line New Event Detection and Tracking
James Allan, Ron Papka, Victor Lavrenko · ACM SIGIR Forum · 2017 · 653 citations
On-line new event detection and tracking
James Allan, Ron Papka, Victor Lavrenko · 1998 · 524 citations
Rosie Jones, Fernando Díaz · ACM Transactions on Information Systems · 2007 · 202 citations
On burstiness-aware search for document sequences
Theodoros Lappas, Benjamin Arai, Manolis Platakis et al. · 2009 · 82 citations