333 search results - page 25 / 67 » B-Matching for Spectral Clustering |
108
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
114
click to vote
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Corner detection plays an important role in object recognition and motion analysis. In this paper, we propose a hierarchical corner detection framework based on spectral clusterin...
112
Voted
ECML
2004
Springer
15 years 5 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
96
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—To date, most studies on spam have focused only on the spamming phase of the spam cycle and have ignored the harvesting phase, which consists of the mass acquisition of email ad...
95
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...