2033 search results - page 332 / 407 » Ranking on Data Manifolds |
PVLDB
2008
14 years 9 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
101
click to vote
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...