7 search results - page 1 / 2 » Cost-Sensitive Learning Based on Bregman Divergences |
PKDD
2009
Springer
13 years 9 months ago
2009
Springer
SDM
2004
SIAM
13 years 5 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
KDD
2004
ACM
14 years 4 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
KDD
2005
ACM
14 years 4 months ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
ICASSP
2010
IEEE
13 years 4 months ago
2010
IEEE
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...