Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SDM
2007
SIAM

favoriteEmaildiscussreport

143views Data Mining» more SDM 2007»

Clustering by weighted cuts in directed graphs

13 years 5 months ago

Clustering by weighted cuts in directed graphs

Download www.stat.washington.edu

In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends several popular criteria like the normalized cut and the averaged cut to asymmetric aﬃnity data. We show that this problem can be relaxed to a Rayleigh quotient problem for a symmetric matrix obtained from the original aﬃnities and therefore a large body of the results and algorithms developed for spectral clustering of symmetric data immediately extends to asymmetric cuts.

Marina Meila, William Pentney

Real-time Traffic

Data Mining | Directed Graph | Rayleigh Quotient Problem | SDM 2007 | Spectral Clustering |

claim paper

Related Content

» Weighted Graph Cuts without Eigenvectors A Multilevel Approach

» A Novel WeightedGraphBased Grouping Algorithm for Metadata Prefetching

» Clustering Fiber Traces Using Normalized Cuts

» Bounded Size Graph Clustering with Applications to Stream Processing

» Clustering Pairwise Distances with Missing Data Maximum Cuts Versus Normalized Cuts

» Kernel kmeans spectral clustering and normalized cuts

» A combinatorial primaldual approach to semidefinite programs

» WICER A Weighted InterCluster Edge Ranking for Clustered Graphs

» A fast kernelbased multilevel algorithm for graph clustering

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	SDM
Authors	Marina Meila, William Pentney

Comments (0)