Remaking the Markov clusters of word data using the example of "The Little prince" by Saint-Exupery (人文科学とコンピュータ)

スポンサーリンク

概要

• 論文の詳細を見る

• The aim of this paper is to develop a new graph clustering algorithm called Branching Markov Clustering (BMCL). This new algorithm addresses the cluster size unbalance issue that is evidenced when ordinary MCL approaches are applied to documents or corpora. Furthermore,we propose a new windowing method called Incrementally Advancing Window (IAW) that generates co-occurring word pairs that can be used as inputs to the Incremental Routing Algorithm of BMCL. Finally,the effectiveness of these techniques is tested by creating the semantic network corresponding to the story map for the very famous novel of Saint-Exupery,"Le petit prince".

• 2007-09-27

著者

• Akama Hiroyuki

  Tokyo Institute Of Technology

• Miyake Maki

  University Of Osaka

• Jung Jaeyoung

  Tokyo Institute of Technology

• Jung Jaeyoung

  東京工大

関連論文

• Remaking the Markov clusters of word data using the example of "The Little prince" by Saint-Exupery (人文科学とコンピュータ)

スポンサーリンク