Bipartition of graphs based on the normalized cut and spectral methods, Part Ⅰ : Minimum normalized cut
スポンサーリンク
概要
- 論文の詳細を見る
The main objective of this paper is to solve the problem of finding graphs on which the spectral clustering method and the normalized cut produce different partitions. To this end, we derive formulae for minimum normalized cut for graphs in some classes such as paths, cycles, complete graphs, double-trees, lollipop graphs LP_<n,m>, roach type graphs R_<n,k> and weighted paths P_<n,k>.
- Faculty of Mathematics, Kyushu Universityの論文
Faculty of Mathematics, Kyushu University | 論文
- Generalisation of Mack's formula for claims reserving with arbitrary exponents for the variance assumption
- EDITORIAL (Czech Japanese Seminar in Applied Mathematics 2010 : Praha/Telc, September 2010)
- Symbolic-numeric hybrid optimization for plant/controller integrated design in H∞ loop-shaping design
- Weierstrass representation for semi-discrete minimal surfaces, and comparison of various discretized catenoids
- A note on the quasi-additive bound for Boolean functions