Sciweavers

2228 search results - page 220 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
EUROPAR
2007
Springer
15 years 10 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 7 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen
CIKM
2006
Springer
15 years 10 months ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
16 years 6 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...