Tim Gollub

Tim Gollub

Auto-generated profile, based on publicly available information

Tim Gollub

Bauhaus-Universität Weimar

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 August 2019
Verified
Book Chapter
Closed access
PDF file
MPMartin Potthast
Martin Potthast
TGTim Gollub
Tim Gollub
MWMatti Wiegmann
Matti Wiegmann
BSBenno Stein
Benno Stein

12 July 2011 in Information Retrieval Journal
Verified
Journal Article
Open access
PDF file
Norbert FuhrNorbert Fuhr
Norbert Fuhr
MLMarc Lechtenfeld
Marc Lechtenfeld
BSBenno Stein
Benno Stein
TGTim Gollub
Tim Gollub
Document clustering offers the potential of supporting users in interactive retrieval, especially when users have problems in specifying their information need precisely. In this paper, we present a theoretic foundation for optimum document clustering. Key idea is to base cluster analysis and evalutation on a set of queries, by defining documents as being similar if they are relevant to the same queries. Three components are essential within our optimum clustering framework, OCF: (1) a set of queries, (2) a probabilistic retrieval method, and (3) a document similarity metric. After introducing an appropriate validity measure, we define optimum clustering with respect to the estimates of the relevance probability for the query-document pairs under consideration. Moreover, we show that well-known clustering methods are implicitly based on the three components, but that they use heuristic design decisions for some of them. We argue that with our framework more targeted research for developing better document clustering methods becomes possible. Experimental results demonstrate the potential of our considerations.

1 January 2016
Verified
Book Chapter
Closed access
PDF file
MHMatthias Hagen
Matthias Hagen
ABAnna Beyer
Anna Beyer
TGTim Gollub
Tim Gollub
KKKristof Komlossy
Kristof Komlossy
BSBenno Stein
Benno Stein

3 May 2010
Verified
Book Chapter
Closed access
PDF file
TGTim Gollub
Tim Gollub
BSBenno Stein
Benno Stein

29 October 2012
Verified
Conference Paper
Open access
PDF file
BSBenno Stein
Benno Stein
TGTim Gollub
Tim Gollub
DHDennis Hoppe
Dennis Hoppe

28 December 2018 in arXiv
Verified
Preprint
Open access
PDF file
MPMartin Potthast
Martin Potthast
TGTim Gollub
Tim Gollub
MHMatthias Hagen
Matthias Hagen
BSBenno Stein
Benno Stein
Clickbait has grown to become a nuisance to social media users and social media operators alike. Malicious content publishers misuse social media to manipulate as many users as possible to visit their websites using clickbait messages. Machine learning technology may help to handle this problem, giving rise to automatic clickbait detection. To accelerate progress in this direction, we organized the Clickbait Challenge 2017, a shared task inviting the submission of clickbait detectors for a comparative evaluation. A total of 13 detectors have been submitted, achieving significant improvements over the previous state of the art in terms of detection performance. Also, many of the submitted approaches have been published open source, rendering them reproducible, and a good starting point for newcomers. While the 2017 challenge has passed, we maintain the evaluation system and answer to new registrations in support of the ongoing research on better clickbait detectors.