77 search results - page 4 / 16 » PBIRCH: A Scalable Parallel Clustering algorithm for Increme... |
PAMI
2011
13 years 3 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
PPOPP
2003
ACM
14 years 1 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
SCHOLARPEDIA
2011
12 years 11 months ago
2011
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
TC
2010
13 years 7 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...