Author image not provided
 Casper Petersen

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.40
Citation Count7
Publication count5
Publication years2015-2016
Available for download5
Average downloads per article139.00
Downloads (cumulative)695
Downloads (12 Months)290
Downloads (6 Weeks)25
Arrow RightAuthor only

See all colleagues of this author


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
Sort by:

1 published by ACM
October 2016 CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 37,   Downloads (Overall): 37

Full text available: PDFPDF
Divergence From Randomness (DFR) ranking models assume that informative terms are distributed in a corpus differently than non-informative terms. Different statistical models (e.g. Poisson, geometric) are used to model the distribution of non-informative terms, producing different DFR models. An informative term is then detected by measuring the divergence of its ...
Keywords: adaptive retrieval, divergence from randomness

2 published by ACM
September 2016 ICTIR '16: Proceedings of the 2016 ACM International Conference on the Theory of Information Retrieval
Publisher: ACM
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 31,   Downloads (Overall): 69

Full text available: PDFPDF
Document coherence describes how much sense text makes in terms of its logical organisation and discourse flow. Even though coherence is a relatively difficult notion to quantify precisely, it can be approximated automatically. This type of coherence modelling is not only interesting in itself, but also useful for a number ...
Keywords: bipartite graphs, discourse, document coherence, information retrieval

3 published by ACM
July 2016 PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 56,   Downloads (Overall): 86

Full text available: PDFPDF
A labeling scheme is a method of distributing the information about the structure of a graph among its vertices by assigning short labels, such that a selected function on pairs of vertices can be computed using only their labels. A labeling scheme consists of an encoder that has access to ...
Keywords: power-law graphs, labeling schemes

4 published by ACM
February 2016 ACM Transactions on Information Systems (TOIS): Volume 34 Issue 2, April 2016
Publisher: ACM
Citation Count: 4
Downloads (6 Weeks): 12,   Downloads (12 Months): 157,   Downloads (Overall): 400

Full text available: PDFPDF
Several properties of information retrieval (IR) data, such as query frequency or document length, are widely considered to be approximately distributed as a power law. This common assumption aims to focus on specific characteristics of the empirical probability distribution of such data (e.g., its scale-free nature or its long/fat tail). ...
Keywords: Statistical model selection, power laws

5 published by ACM
September 2015 ICTIR '15: Proceedings of the 2015 International Conference on The Theory of Information Retrieval
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 3,   Downloads (12 Months): 34,   Downloads (Overall): 84

Full text available: PDFPDF
We present two novel models of document coherence and their application to information retrieval (IR). Both models approximate document coherence using discourse entities, e.g. the subject or object of a sentence. Our first model views text as a Markov process generating sequences of discourse entities (entity n -grams); we use ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us