Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases

Details Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases

2010-05-14

arxiv.org/abs/1005.2603v5

Computer Science

Learning

9 pages, no figure, to appear in ICEIE 2010

Scientific paper

This paper presents a concise tutorial on spectral clustering for broad spectrum graphs which include unipartite (undirected) graph, bipartite graph, and directed graph. We show how to transform bipartite graph and directed graph into corresponding unipartite graph, therefore allowing a unified treatment to all cases. In bipartite graph, we show that the relaxed solution to the $K$-way co-clustering can be found by computing the left and right eigenvectors of the data matrix. This gives a theoretical basis for $K$-way spectral co-clustering algorithms proposed in the literatures. We also show that solving row and column co-clustering is equivalent to solving row and column clustering separately, thus giving a theoretical support for the claim: ``column clustering implies row clustering and vice versa''. And in the last part, we generalize the Ky Fan theorem---which is the central theorem for explaining spectral clustering---to rectangular complex matrix motivated by the results from bipartite graph analysis.

Affiliated with

Also associated with

No associations

Rating

Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520375