3.8 Article

Comparison of graph clustering methods for analyzing the mathematical subject classification codes

出版社

KOREAN STATISTICAL SOC
DOI: 10.29220/CSAM.2020.27.5.569

关键词

mathematical subject classification; Markov chain clustering; entropy graph clustering

资金

  1. Basic Science Research Program through the National Research Foundation of Korea (NRF) - Ministry of Education [2017R1A6A3A04005963, 2018R1D1 A1B07050910]
  2. Ministry of Science, ICT and Future Planning [2019R1A6A1A11051177]
  3. National Research Foundation of Korea [2017R1A6A3A04005963] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

向作者/读者索取更多资源

Various graph clustering methods have been introduced to identify communities in social or biological networks. This paper studies the entropy-based and the Markov chain-based methods in clustering the undirected graph. We examine the performance of two clustering methods with conventional methods based on quality measures of clustering. For the real applications, we collect the mathematical subject classification (MSC) codes of research papers from published mathematical databases and construct the weighted code-to-document matrix for applying graph clustering methods. We pursue to group MSC codes into the same cluster if the corresponding MSC codes appear in many papers simultaneously. We compare the MSC clustering results based on the several assessment measures and conclude that the Markov chain-based method is suitable for clustering the MSC codes.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据