165 search results - page 12 / 33 » Dominant Sets and Pairwise Clustering |
108
click to vote
OL
2011
14 years 4 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
SDM
2007
SIAM
14 years 11 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 ...
94
Voted
TKDE
2008
14 years 9 months ago
2008
Semisupervised clustering algorithms partition a given data set using limited supervision from the user. The success of these algorithms depends on the type of supervision and also...
87
Voted
IJCAI
2003
14 years 11 months ago
2003
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled example...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
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...