Min sum clustering with penalties
نویسندگان
چکیده
منابع مشابه
Min Sum Clustering with Penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects , called outliers, may exert a disproportionately strong influence over the solution. In this work we investigate the k-min-sum clustering problem while addressing outliers in a meaningful way. Given a complete graph G = (V,...
متن کاملApproximation Algorithms for Min-sum p-clustering
We consider the following problem: Given a graph with edge lengths satisfying the triangle inequality, partition its node set into p subsets, minimizing the total length of edges whose two ends are in the same subset. For this problem we present an approximation algorithm which comes to at most twice the optimal value. For clustering into two equal-sized sets, the exact bound on the maximum pos...
متن کاملMin-sum Clustering of Protein Sequences with Limited Distance Information
We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and must query them during the execution of the algorithm. Our goal is to find an accurate clustering using few queries. We model the problem as a point set S with an unknown metric d on S, and assume that we have access...
متن کاملPolynomial Time Approximation Schemes for Metric Min-Sum Clustering
We give polynomial time approximation schemes for the problem of partitioning an input set of n points into a xed number k of clusters so as to minimize the sum over all clusters of the total pairwise distances in a cluster. Our algorithms work for arbitrary metric spaces as well as for points in R d where the distance between two points x; y is measured by kx ? yk 2 2 (notice that (R d ; k k 2...
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.03.004