961 search results - page 61 / 193 » Significance-Driven Graph Clustering |
176
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
137
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
157
click to vote
PAMI
2008
15 years 4 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
159
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
102
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...