1314 search results - page 180 / 263 » Approximate data mining in very large relational data |
139
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
117
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
132
click to vote
ADMA
2009
Springer
15 years 11 months ago
2009
Springer
It is of high biomedical interest to identify gene interactions and networks that are associated with developmental and physiological functions in the mouse embryo. There are now v...
154
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Co-authorship networks, an important type of social networks, have been studied extensively from various angles such as degree distribution analysis, social community extraction a...
127
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...