Sciweavers

25 search results - page 1 / 5
» Bregman Clustering for Separable Instances
Sort
View
SWAT
2010
Springer
222views Algorithms» more  SWAT 2010»
13 years 9 months ago
Bregman Clustering for Separable Instances
Marcel R. Ackermann, Johannes Blömer
MA
2010
Springer
206views Communications» more  MA 2010»
13 years 3 months ago
Quantization and clustering with Bregman divergences
 This paper deals with the quantization problem of a random variable X taking values in a separable and reexive Banach space, and with the related question of clustering independ...
Aurélie Fischer
SDM
2004
SIAM
189views Data Mining» more  SDM 2004»
13 years 6 months ago
An Abstract Weighting Framework for Clustering Algorithms
act Weighting Framework for Clustering Algorithms Richard Nock Frank Nielsen Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmi...
Richard Nock, Frank Nielsen
DATAMINE
2007
110views more  DATAMINE 2007»
13 years 4 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 5 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney