Results 41 to 50 of about 1,861,121 (138)
Cluster approximation for the contact process [PDF]
9 pages, Latex format, 2 postscript ...
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
Clustering what Matters: Optimal Approximation for Clustering with Outliers
Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set X of n points and two numbers k, m, the clustering with outliers aims to exclude m points from X and partition the remaining points into k clusters that minimizes a certain cost function.
Akanksha Agrawal 0001 +3 more
openaire +4 more sources
The Dynamical Cluster Approximation: Non-Local Dynamics of Correlated Electron Systems [PDF]
We recently introduced the dynamical cluster approximation (DCA), a technique that includes short-ranged dynamical correlations in addition to the local dynamics of the dynamical mean-field approximation while preserving causality. The technique is based
Mukherjee, M. +7 more
core +1 more source
Approximation algorithms for clustering with dynamic points
We study two generalizations of classic clustering problems called dynamic ordered $k$-median and dynamic $k$-supplier, where the points that need clustering evolve over time, and we are allowed to move the cluster centers between consecutive time steps.
Shichuan Deng +2 more
openaire +5 more sources
Annealed Alloy of Ising Magnets Within Two-Site Cluster Approximation [PDF]
Ising mixture with equilibrium disorder is considered. The nearest neighbour spin coupling and direct interatomic interaction are taken into account within two-site cluster approximation.
Levitskii, R. R. +2 more
core +1 more source
Approximate clustering of incomplete fingerprints
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andres Figueroa +5 more
openaire +1 more source
Distance approximations for clustering
Die Clusteranalyse ist ein mächtiges Werkzeug um Gruppen von Datenpunkten mit ähnlichen Eigenschaften zu identifizieren. Verschiedene Algorithmen finden diese Gruppen indem sie das k-means Optimierungsproblem lösen. Da die Lösung dieses Problems NP-schwer ist, wurden Heuristiken entwickelt um die Optimierung zu beschleunigen.
openaire +3 more sources
Cluster robust error estimates for the Rayleigh-Ritz approximation II: Estimates for eigenvalues
This is the second part of a paper that deals with error estimates for the Rayleigh–Ritz approximations of the spectrum and invariant subspaces of a bounded Hermitian operator in a Hilbert or Euclidean space.
E. Ovtchinnikov, Ovtchinnikov, E.
core +1 more source
Graph Approximation and Clustering on a Budget
We consider the problem of learning from a similarity matrix (such as spectral clustering and lowd imensional embedding), when computing pairwise similarities are costly, and only a limited number of entries can be observed. We provide a theoretical analysis using standard notions of graph approximation, significantly generalizing previous results ...
Ethan Fetaya, Ohad Shamir, Shimon Ullman
openaire +4 more sources
Exact and Approximate Hierarchical Clustering Using A*
Hierarchical clustering is a critical task in numerous domains. Many approaches are based on heuristics and the properties of the resulting clusterings are studied post hoc. However, in several applications, there is a natural cost function that can be used to characterize the quality of the clustering.
Craig S. Greenberg +8 more
openaire +4 more sources

