268 search results - page 11 / 54 » Learning Pairwise Similarity for Data Clustering |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
TKDE
2002
13 years 7 months ago
2002
SOCIALCOM
2010
13 years 5 months ago
2010
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...