Presentation 2006-07-27
Possibilities of the Bipartite Graph Clustering in Text Analysis
Hiroyuki AKAMA, Maki MIYAKE, Jaeyoung JUNG,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the fields of text analysis, results of Markov Clustering and Recurrent Markov Clustering applied to a bi-partite graph made of pairs between key words and co-occurring words would be useful to be compared with those of multivariate analysis.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) MCL / RMCL / Bipartite Graph / Multivariate Analysis
Paper # NLC2006-4
Date of Issue

Conference Information
Committee NLC
Conference Date 2006/7/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Natural Language Understanding and Models of Communication (NLC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Possibilities of the Bipartite Graph Clustering in Text Analysis
Sub Title (in English)
Keyword(1) MCL
Keyword(2) RMCL
Keyword(3) Bipartite Graph
Keyword(4) Multivariate Analysis
1st Author's Name Hiroyuki AKAMA
1st Author's Affiliation Graduate School of Decision Science and Technology, Tokyo Institute of Technology()
2nd Author's Name Maki MIYAKE
2nd Author's Affiliation Graduate School of Decision Science and Technology, Tokyo Institute of Technology
3rd Author's Name Jaeyoung JUNG
3rd Author's Affiliation Graduate School of Decision Science and Technology, Tokyo Institute of Technology
Date 2006-07-27
Paper # NLC2006-4
Volume (vol) vol.106
Number (no) 190
Page pp.pp.-
#Pages 6
Date of Issue