%0 Conference Paper %1 Kotsakos:2014:BAD:2600428.2609495 %A Kotsakos, Dimitrios %A Lappas, Theodoros %A Kotzias, Dimitrios %A Gunopulos, Dimitrios %A Kanhabua, Nattiya %A Nørv\aag, Kjetil %B Proceedings of the 37th International ACM SIGIR Conference on Research &\#38; Development in Information Retrieval %C New York, NY, USA %D 2014 %I ACM %K alexandria %P 1003--1006 %R 10.1145/2600428.2609495 %T A Burstiness-aware Approach for Document Dating %U http://doi.acm.org/10.1145/2600428.2609495 %X 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. %@ 978-1-4503-2257-7

@inproceedings{Kotsakos:2014:BAD:2600428.2609495, abstract = {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.}, acmid = {2609495}, added-at = {2016-10-18T14:54:25.000+0200}, address = {New York, NY, USA}, author = {Kotsakos, Dimitrios and Lappas, Theodoros and Kotzias, Dimitrios and Gunopulos, Dimitrios and Kanhabua, Nattiya and N{\o}rv{\aa}g, Kjetil}, biburl = {https://www.bibsonomy.org/bibtex/2768fb38915056d53a49295f1fbada1d3/alexandriaproj}, booktitle = {Proceedings of the 37th International ACM SIGIR Conference on Research \&\#38; Development in Information Retrieval}, doi = {10.1145/2600428.2609495}, interhash = {d9ffa1ad19c4a642a02a65cf6e03ff09}, intrahash = {768fb38915056d53a49295f1fbada1d3}, isbn = {978-1-4503-2257-7}, keywords = {alexandria}, location = {Gold Coast, Queensland, Australia}, numpages = {4}, pages = {1003--1006}, publisher = {ACM}, series = {SIGIR '14}, timestamp = {2016-10-18T14:54:25.000+0200}, title = {A Burstiness-aware Approach for Document Dating}, url = {http://doi.acm.org/10.1145/2600428.2609495}, year = 2014 }