3643 search results - page 256 / 729 » Learning Submodular Functions |
179
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
182
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
154
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Typical gene expression clustering algorithms are restricted to a specific underlying pattern model while overlooking the possibility that other information carrying patterns may ...
169
click to vote
ADBIS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
156
click to vote
ICA
2004
Springer
15 years 12 months ago
2004
Springer
Post-nonlinear (PNL) independent component analysis (ICA) is a generalisation of ICA where the observations are assumed to have been generated from independent sources by linear mi...