Results 21 to 30 of about 1,861,121 (138)
Clustered Matrix Approximation
In this paper we develop a novel clustered matrix approximation framework, first showing the motivation behind our research. The proposed methods are particularly well suited for problems with large scale sparse matrices that represent graphs and/or bipartite graphs from information science applications.
Berkant Savas, Inderjit S. Dhillon
openaire +4 more sources
Approximation Schemes for Clustering with Outliers [PDF]
Clustering problems are well studied in a variety of fields, such as data science, operations research, and computer science. Such problems include variants of center location problems, k -median and k -means to name a few.
Zachary Friggstad +3 more
openaire +5 more sources
On the Approximation of Correlation Clustering and Consensus Clustering
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paola Bonizzoni +3 more
openaire +3 more sources
Information Theoretical Clustering Is Hard to Approximate [PDF]
An impurity measures $I: \mathbb{R}^d \mapsto \mathbb{R}^+$ is a function that assigns a $d$-dimensional vector ${\bf v}$ to a non-negative value $I({\bf v})$ so that the more homogeneous ${\bf v}$, with respect to the values of its coordinates, the larger its impurity. A well known example of impurity measures is the Entropy impurity.
Ferdinando Cicalese, Eduardo Sany Laber
openaire +4 more sources
A Variational Cluster Approximation for the Heisenberg Model [PDF]
In this thesis we present a novel variational cluster approximation for Heisenberg spin systems. It is based on the self-energy functional theory by Potthoff for fermionic and bosonic models with local interactions.
Filor, Stephan +5 more
core +1 more source
Approximate Clustering with Same-Cluster Queries
Ashtiani et al. proposed a Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to make adaptive queries to a domain expert. The queries are of the kind "do two given points belong to the same optimal cluster?" There are many clustering contexts where such same-cluster queries are feasible. Ashtiani et al.
Nir Ailon +3 more
openaire +6 more sources
Approximation algorithms for stochastic clustering
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term ...
David G. Harris 0001 +4 more
openaire +5 more sources
Cluster correlations in the Zel'dovich approximation [PDF]
9 pages including 6 figures, uuencoded compressed postscript file, Ref.
BORGANI, STEFANO +2 more
openaire +3 more sources
Stability, instability, and error of the force-based quasicontinuum approximation [PDF]
Due to their algorithmic simplicity and high accuracy, force-based model coupling techniques are popular tools in computational physics. For example, the force-based quasicontinuum (QCF) approximation is the only known pointwise consistent quasicontinuum
Luskin, Mitchell Barry +6 more
core +1 more source
On Approximate Geometric k -Clustering [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

