820 search results - page 44 / 164 » Finding low-utility data structures |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
ICANN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...