Revision as of 13:43, 4 May 2016 edit Cle003 (talk \| contribs) 14 edits →Bipartitioning a graph with the eigenvector ← Previous edit		Revision as of 13:44, 4 May 2016 edit undo SineBot (talk \| contribs) Bots 2,564,833 edits m Signing comment by Cle003 - "→Bipartitioning a graph with the eigenvector: " Next edit →
Line 18: How does one "use the eigenvector with the smallest eigenvalue to bipartition the graph"? Is there another article to which we could link that would provide those details? --[[Special:Contributions/76.27.96.159\|76.27.96.159]] ([[User talk:76.27.96.159\|talk]]) 04:29, 10 December 2008 (UTC) Shi and Malik, 2000 advice to use the second smallest eigenvector to bipartition the graph <small><span class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Cle003\|Cle003]] ([[User talk:Cle003\|talk]] • [[Special:Contributions/Cle003\|contribs]]) 13:43, 4 May 2016 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> == Example ==

Talk:Segmentation-based object categorization: Difference between revisions