Results 131 to 138 of about 1,861,121 (138)
Some of the next articles are maybe not open access.
Optimal algorithms for approximate clustering
Proceedings of the twentieth annual ACM symposium on Theory of computing, 1988In a clustering problem, the aim is to partition a given set of n points in d-dimensional space into k groups, called clusters, so that points within each cluster are near each other. Two objective functions frequently used to measure the performance of a clustering algorithm are, for any L4 metric, (a) the maximum distance between pairs of points in ...
Tomás Feder, Daniel H. Greene
openaire +1 more source
Approximations to Bayesian Clustering Rules
Biometrika, 1981SUMMARY The amount of computation required for implementing the Bayesian cluster analysis suggested by Binder (1978) is often too large for exact results to be feasible. A general algorithm is proposed for approximating the similarity matrix and the resulting optimal partition. This algorithm is applied to artificial and to real data. For the real data,
openaire +1 more source
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003Let k be a fixed integer. We consider the problem of partitioning an input set of points endowed with a distance function into k clusters. We give polynomial time approximation schemes for the following three clustering problems: Metric k-Clustering, l 22k-Clustering, and l22k-Median. In the k-Clustering problem, the objective is to minimize the sum of
Wenceslas Fernandez de la Vega +3 more
openaire +1 more source
On Approximate Balanced Bi-clustering
2005We consider the balanced bi-clustering problem for a given data set, where the number of entities in each cluster is bounded, and its special case where the number of entities in each cluster is fixed. Several algorithms to attack these problems are proposed.
Guoxuan Ma, Jiming Peng, Yu Wei 0003
openaire +1 more source
Approximation Algorithms for Tensor Clustering
2009We present the first (to our knowledge) approximation algorithm for tensor clustering--a powerful generalization to basic 1D clustering. Tensors are increasingly common in modern applications dealing with complex heterogeneous data and clustering them is a fundamental tool for data analysis and pattern discovery. Akin to their 1D cousins, common tensor
Stefanie Jegelka +2 more
openaire +2 more sources
Approximation algorithms for clustering problems
Proceedings of the twelfth annual conference on Computational learning theory, 1999Clustering is a ubiquitous problem that arises in many applications in different fields such as data mining, image processing, machine learning, and bioinformatics. Clustering problems have been extensively studied as optimization problems with various objective functions in the Operations Research and Computer Science literature.
openaire +2 more sources
Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013
Clustering never seems to live up to the hype. To paraphrase the popular saying, clustering looks good in theory, yet often fails to deliver in practice. Why? You would think that something so simple and elegant as finding groups of similar items in data would be incredibly useful. Yet often it isn't.
openaire +1 more source
Clustering never seems to live up to the hype. To paraphrase the popular saying, clustering looks good in theory, yet often fails to deliver in practice. Why? You would think that something so simple and elegant as finding groups of similar items in data would be incredibly useful. Yet often it isn't.
openaire +1 more source
FPT approximation for capacitated clustering with outliers
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajni Dabas +2 more
openaire +3 more sources

