697 search results - page 50 / 140 » Approximation of Information Granule Sets |
104
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
84
Voted
RECSYS
2009
ACM
15 years 7 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
111
click to vote
ALENEX
2009
14 years 10 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
103
click to vote
ITCC
2002
IEEE
15 years 5 months ago
2002
IEEE
The emergence of the world-wide-web has led to an increased interest in methods for searching for information. A key characteristic of many of the online document collections is t...
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Modern retrieval test collections are built through a process called pooling in which only a sample of the entire document set is judged for each topic. The idea behind pooling is...