Bipartition of graphs based on the normalized cut and spectral methods, Part Ⅰ : Minimum normalized cut - Collections

＜journal article＞
Bipartition of graphs based on the normalized cut and spectral methods, Part Ⅰ : Minimum normalized cut

Creator	Creator Name Perera, K. K. K. R.
Creator	Creator Name Mizoguchi, Yoshihiro 溝口, 佳寛ミゾグチ, ヨシヒロ
Language	English
Publisher	Faculty of Mathematics, Kyushu University
Publisher	九州大学大学院数理学研究院
Date	2013
Source Title	Journal of Math-for-Industry (JMI)
Vol	5
Issue	A
First Page	59
Last Page	72
Publication Type	Version of Record
Access Rights	open access
Related DOI	JMI ; 2013A-8
Related DOI	Journal of Math-for-Industry \|\| 5(A) \|\| p59-72
	JMI \|\| 5(A) \|\| p59-72
	http://gcoe-mi.jp/
Related URI	Journal of Math-for-Industry \|\| 5(A) \|\| p59-72
	JMI \|\| 5(A) \|\| p59-72
	http://gcoe-mi.jp/
Relation	JMI ; 2013A-8
	Journal of Math-for-Industry \|\| 5(A) \|\| p59-72
	JMI \|\| 5(A) \|\| p59-72
	http://gcoe-mi.jp/
Abstract	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>.show more

File	FileType	Size	Views	Description
2013A-8	pdf	218 KB	502

Record ID	1397719
Peer-Reviewed	Refereed
Subject Terms	spectral clustering
	normalized Laplacian matrices
	difference Laplacian matrices
	signless Laplacian matrices
	normalized cut
ISSN	1884-4774
NCID	AA12444018
Notes	MI: Global COE Program Education-and-Research Hub for Mathematics-for-Industry
Notes	グローバルCOEプログラム「マス･フォア･インダストリ教育研究拠点」
Type	学術雑誌論文
Created Date	2014.01.07
Modified Date	2020.10.26