Sciweavers

1098 search results - page 57 / 220
» Large-Scale Parallel Data Clustering
Sort
View
114
Voted
IPPS
2003
IEEE
15 years 7 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
IPPS
2000
IEEE
15 years 7 months ago
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
138
Voted
IPPS
2010
IEEE
15 years 14 days ago
Improving MapReduce performance through data placement in heterogeneous Hadoop clusters
MapReduce has become an important distributed processing model for large-scale data-intensive applications like data mining and web indexing. Hadoop
Jiong Xie, Shu Yin, Xiaojun Ruan, Zhiyang Ding, Yu...
153
Voted
PVLDB
2008
182views more  PVLDB 2008»
15 years 2 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
147
Voted
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 4 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang