Sciweavers

108 search results - page 7 / 22
» Clustering with Bregman Divergences
Sort
View
SWAT
2010
Springer
222views Algorithms» more  SWAT 2010»
14 years 18 days ago
Bregman Clustering for Separable Instances
Marcel R. Ackermann, Johannes Blömer
ICPR
2008
IEEE
14 years 2 months ago
Feature selection for clustering with constraints using Jensen-Shannon divergence
In semi-supervised clustering, domain knowledge can be converted to constraints and used to guide the clustering. In this paper we propose a feature selection algorithm for semi-s...
Yuanhong Li, Ming Dong, Yunqian Ma
ICML
2009
IEEE
14 years 8 months ago
Surrogate regret bounds for proper losses
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
Mark D. Reid, Robert C. Williamson
ICML
2006
IEEE
14 years 8 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...