Content deleted Content added
m Signing comment by 70.166.151.52 - "→Ncut: " |
|||
Line 4:
In the section "The Ncut algorithm" the value "D" is introduced without explanation. Also, none of the "figures" actually occur in the article.
To follow this comment, the "ncut algorithm" section should refer/link to the [[degree_matrix|degree]] and [[adjacency_matrix|adjacency]] matrix of a graph (or even the [[Laplacian_matrix|Laplacian matrix]]) when defining D and W, as well as the [[Algebraic_connectivity|algebraic connectivity]] of the graph when referencing the second smallest eigenvalue. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/70.166.151.52|70.166.151.52]] ([[User talk:70.166.151.52#top|talk]]) 16:24, 15 February 2017 (UTC)</small> <!--Autosigned by SineBot-->
Are arbitrary values allowed for the weights (similarity measures), or are they restricted to some range (non-negative, [0,1], ...)? It seems to me that negative weights can potentially invert the sign of some of the fraction denominators causing semantic havoc. [[User:Mspreitz|Mspreitz]] ([[User talk:Mspreitz|talk]]) 02:40, 11 April 2011 (UTC)
| |||