897 search results - page 28 / 180 » Correlational spectral clustering |
88
Voted
ECML
2004
Springer
15 years 3 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...
ICC
2009
IEEE
15 years 4 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...
81
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
WAIM
2009
Springer
15 years 4 months ago
2009
Springer
Finding linear correlations in dataset is an important data mining task, which can be widely applied in the real world. Existing correlation clustering methods combine clustering w...
ICML
2010
IEEE
14 years 10 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...