- 5
- 0
- 约9.34千字
- 约 52页
- 2019-11-14 发布于广东
- 举报
Subject to: Observations(I) Maximizing Nassoc is the same as minimizing Ncut, since they are related: How to minimize Ncut? Transform Ncut equation to a matricial form. After simplifying: Rayleigh quotient NP-Hard! y’s values are quantized Instead, relax into the continuous domain by solving generalized eigenvalue system: Which gives: Note that so, the first eigenvector is y0=1 with eigenvalue 0. The second smallest eigenvector is the real valued solution to this problem!! Observations(II) min Algorithm Define a similarity function between 2 nodes. i.e.: Compute af
原创力文档

文档评论(0)