961 search results - page 42 / 193 » Significance-Driven Graph Clustering |
103
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
101
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
113
click to vote
MICAI
2007
Springer
15 years 6 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
115
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
107
click to vote
SAC
2005
ACM
15 years 6 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...