30 search results - page 4 / 6 » Anytime Measures for Top-k Algorithms |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Data mining promises to discover valid and potentially useful patterns in data. Often, discovered patterns are not useful to the user. "Actionability" addresses this pro...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
MM
2004
ACM
14 years 1 months ago
2004
ACM
The ellipse Hough transform (EHT) is a widely-used technique. Most of the previous modifications to the standard EHT improved either the voting procedure that computes the absolut...
ALENEX
2010
13 years 9 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...