697 search results - page 50 / 140 » Approximation of Information Granule Sets |
171
click to vote
CIKM
2010
Springer
15 years 3 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 ...
145
click to vote
RECSYS
2009
ACM
16 years 11 days 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...
161
click to vote
ALENEX
2009
15 years 3 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...
155
Voted
ITCC
2002
IEEE
15 years 10 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...
162
click to vote
SIGIR
2006
ACM
15 years 11 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...