Results 81 to 90 of about 3,294 (168)

Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

open access: yes, 2008
In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor clustering [8,34 ...
Banerjee, Arindam   +2 more
core   +1 more source

Dangerous Times, Deliberate Acts: A Talk on Violence, Agency and Some Possibilities for Response

open access: yes
Journal of Advanced Nursing, Volume 82, Issue S1, Page S10-S14, March 2026.
Colleen Varcoe
wiley   +1 more source

Improving clustering using Bregman divergences [PDF]

open access: yes, 2014
We review Bregman divergences and use them in clustering algorithms which we have previously developed to overcome one of the difficulties of the standard k-means algorithm which is its sensitivity to initial conditions which leads to finding sub-optimal local minima. We show empirical results on artificial data sets.
Ashour, Wesam M., Fyfe, Colin
openaire  

Quantization and clustering with Bregman divergences

open access: yesJournal of Multivariate Analysis, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Conformal mirror descent with logarithmic divergences. [PDF]

open access: yesInf Geom, 2023
Kainth AS, Wong TL, Rudzicz F.
europepmc   +1 more source

Convex Relaxations of Bregman Divergence Clustering

open access: yes, 2013
Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)
Cheng, Hao   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy