Reliable Distributed Clustering with Redundant Data Assignment
In this paper, we present distributed generalized clustering algorithms that can handle large scale data across multiple machines in spite of straggling or unreliable machines. We propose a novel data assignment scheme that enables us to obtain global information about the entire data even when some machines fail to respond with the results of the assigned local computations. The assignment scheme leads to distributed algorithms with good approximation guarantees for a variety of clustering and dimensionality reduction problems.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDimensionality ReductionSimilar Papers 제목 키워드 기반
A Quantum Annealing-Based Approach to Extreme Clustering
Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In the l…
ClusteringOn the Effect of Task-to-Worker Assignment in Distributed Computing Systems with Stragglers
We study the expected completion time of some recently proposed algorithms for distributed computing which redundantly assign computing tasks to multiple machines in order to tolerate a certain number of machine failures…
Distributed ComputingRedundancy-Free Self-Supervised Relational Learning for Graph Clustering
Graph clustering, which learns the node representations for effective cluster assignments, is a fundamental yet challenging task in data analysis and has received considerable attention accompanied by graph neural networ…
AttributeClusteringGraph ClusteringRelation+2Self-Enhanced Image Clustering with Cross-Modal Semantic Consistency
While large language-image pre-trained models like CLIP offer powerful generic features for image clustering, existing methods typically freeze the encoder. This creates a fundamental mismatch between the model's task-ag…
Image ClusteringDeep ClusteringSemi-supervised Clustering for Short Text via Deep Representation Learning
In this work, we propose a semi-supervised method for short text clustering, where we represent texts as distributed vectors with neural networks, and use a small amount of labeled data to specify our intention for clust…
ClusteringRepresentation LearningShort Text ClusteringText Clustering