1314 search results - page 6 / 263 » Approximate data mining in very large relational data |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
Several marketing problems involve prediction of customer purchase behavior and forecasting future preferences. We consider predictive modeling of large scale, bi-modal or multimo...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
FGCS
2007
13 years 7 months ago
2007
Grid Computing brought the promise of making high-performance computing cheaper and more easily available than traditional supercomputing platforms. Such a promise was very well r...