58 search results - page 10 / 12 » Fast approximate correlation for massive time-series data |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
VLDB
2001
ACM
13 years 12 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...