1314 search results - page 165 / 263 » Approximate data mining in very large relational data |
145
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
144
click to vote
EUROMICRO
2002
IEEE
15 years 9 months ago
2002
IEEE
Internet services like the world-wide web and multimedia applications like News- and Video-on-Demand have become very popular over the last years. Due to the large number of users ...
168
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
152
click to vote
WSDM
2012
ACM
13 years 12 months ago
2012
ACM
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
159
click to vote
SGAI
2009
Springer
15 years 11 months ago
2009
Springer
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...