1625 search results - page 86 / 325 » Learning to Find Pre-Images |
ML
2002
ACM
14 years 11 months ago
2002
ACM
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
SIGIR
2002
ACM
14 years 11 months ago
2002
ACM
Most test collections (like TREC and CLEF) for experimental research in information retrieval apply binary relevance assessments. This paper introduces a four-point relevance scal...
125
click to vote
TIP
2002
14 years 11 months ago
2002
An unsupervised classification algorithm is derived by modeling observed data as a mixture of several mutually exclusive classes that are each described by linear combinations of i...
ML
2007
ACM
14 years 11 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
IJCAT
2010
14 years 10 months ago
2010
: The task of 3D shape classification is to assign a set of unordered shapes into pre-tagged classes with class labels, and find the most suitable class for a newly given shape. In...