4886 search results - page 461 / 978 » Approximate Data Exchange |
188
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
324
click to vote
VLDB
2002
ACM
16 years 7 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
198
click to vote
NIPS
2008
15 years 8 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
134
click to vote
NIPS
2003
15 years 8 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
185
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we study probabilistic modeling of heterogeneously attributed multi-dimensional arrays. The model can manage the heterogeneity by employing an individual exponential...