Sciweavers

2600 search results - page 30 / 520
» Clustering with or without the Approximation
Sort
View
PVLDB
2010
178views more  PVLDB 2010»
13 years 6 months ago
Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...
Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, A...
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
PODC
2011
ACM
12 years 10 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
14 years 4 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
DAWAK
2007
Springer
14 years 1 months ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...