1314 search results - page 65 / 263 » Approximate data mining in very large relational data |
111
click to vote
DAWAK
2005
Springer
15 years 7 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
107
click to vote
KDD
1995
ACM
15 years 5 months ago
1995
ACM
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
153
Voted
ICDM
2006
IEEE
15 years 7 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...
115
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
110
click to vote
SISAP
2008
IEEE
15 years 8 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...