Journal of the Korean Data and Information Science Society

한국데이터정보과학회 (The Korean Data and Information Science Society)
권호 표지
DOI QR코드

DOI QR Code

KCI 등재 학술지의 분류를 위한 네트워크 군집화 방법의 비교

A classification of the journals in KCI using network clustering methods

  • 김진광 (영남대학교 통계학과) ;
  • 김소형 (한국연구재단 학술기반진흥팀) ;
  • 오창혁 (영남대학교 통계학과)
  • Kim, Jinkwang (Department of Statistics, Yeungnam University) ;
  • Kim, Sohyung (Academic Infrastructure Promotion Team, National Research Foundation of Korea) ;
  • Oh, Changhyuck (Department of Statistics, Yeungnam University)
  • 투고 : 2016.06.24
  • 심사 : 2016.07.22
  • 발행 : 2016.07.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

KCI는 국내 학술지 및 게재 논문과 인용에 대한 데이터베이스이며, 이를 이용하여 국내 학술지 간의 인용 관계를 파악할 수 있다. 현재 사용 중인 KCI의 학술지 분류는 각 학술지의 등재 신청 시 학술지 발간 주체가 선정한 분류로 인용 관계에 의한 분류가 아니다. 이로 인해 같은 분류에 속하는 학술지 사이의 인용관계가 없거나 낮은 현상이 발생하기도 하여 인용관계가 많은 학술지끼리 같이 묶여야 한다는 기준에 부합하지 않는 문제점이 발생하고 있다. 따라서 학술지 분류가 학술지 간의 인용정도를 잘 대표하지 못하는 것으로 알려져 있다. 본 연구에서는 KCI에 등재된 학술지 분류와 KCI 인용망에 네트워크 군집화 알고리즘을 적용한 군집 결과를 토대로 어떠한 차이가 있는지 살펴보았다. 이를 위해 최근 논문에서 대표적으로 다뤄지는 네트워크 알고리즘을 제시하고, 인용관계에 따른 각 알고리즘의 군집 결과 차이를 비교하였다. 그 결과 '인포맵' 알고리즘이 기존 KCI 분류망과 모듈화 구조 측면에서 유사성이 가장 높은 것으로 나타났다.

KCI is a database for the citations of journals and papers published in Korea. Classification of a journal listed in KCI was mainly determined by the publisher who registered the journal at the time of application for the journal. However, journal classification in KCI was known for not properly representing the quoting rate between journals. In this study, we extracted communities of the journals registerd in KCI based on quoting relationship using various network clustering algorithms. Among them, the infomap algorithm turned out to give a classification more being alike to the current KCI's in the aspect of the modular structure.

키워드

참고문헌

  1. Arenas, A., Duch, J., Fernandez, A. and Gomez, S. (2007). Size reduction of complex networks preserving modularity. New Journal of Physics, 9, 176. https://doi.org/10.1088/1367-2630/9/6/176
  2. Barnes, E. R. (1982). An algorithm for partitioning the nodes of a graph. SIAM Journal on Algebraic Discrete Methods, 3, 541-550. https://doi.org/10.1137/0603056
  3. Blondel, V. D., Guillaume, J. L., Lambiotte, R. and Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, P10008. https://doi.org/10.1088/1742-5468/2008/10/P10008
  4. Carpenter, M. P. and Narin, F. (1973). Clustering of scientific journals. Journal of the American Society for Information Science, 24, 425-436. https://doi.org/10.1002/asi.4630240604
  5. Chun, H., and Leem, B. (2014). Face/non-face channel fit comparison of life insurance company and non-life insurance company using social network analysis. Journal of the Korean Data & Information Science Society, 25, 1207-1219. https://doi.org/10.7465/jkdi.2014.25.6.1207
  6. Clauset, A., Newman, M. and Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70, 066111. https://doi.org/10.1103/PhysRevE.70.066111
  7. Copic, J., Jackson, M. O. and Kirman, A. (2009). Identifying community structures from network data via maximum likelihood methods, The BE Journal of Theoretical Economics, 9.
  8. Danon, L., Diaz-Guilera, A. and Arenas, A. (2006). The effect of size heterogeneity on community identification in complex networks. Journal of Statistical Mechanics: Theory and Experiment, 2006, P11010. https://doi.org/10.1088/1742-5468/2006/11/P11010
  9. Donath, W. E. and Hoffman, A. J. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17, 420-425. https://doi.org/10.1147/rd.175.0420
  10. Fawcett, T. (2006). An introduction to ROC analysis. Pattern recognition letters, 27, 861-874. https://doi.org/10.1016/j.patrec.2005.10.010
  11. Flake, G. W., Lawrence, S. and Giles, C. L. (2000). Efficient identification of web communities. In Proceedings of the sxth ACM SIGKDD international conference on knowledge discovery and data mining, 150-160, ACM.
  12. Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486, 74-174.
  13. Fortunato, S. and Barthelemy, M. (2007). Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104, 36-41. https://doi.org/10.1073/pnas.0605965104
  14. Kernighan, B. W. and Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49, 291-307. https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
  15. Kim, H. (2008). Citation flow of the ASIST proceedings using pathfinder network analysis. Journal of the Korean Society for Information Management, 25, 157-166. https://doi.org/10.3743/KOSIM.2008.25.2.157
  16. Kim, J. K., Kim, S. H. and Oh, C. H. (2015). Comparison of journal clustering methods based on citation structure. Journal of the Korean Data & Information Science Society, 26, 827-839. https://doi.org/10.7465/jkdi.2015.26.4.827
  17. Lancichinetti, A. and Fortunato, S. (2009b). Community detection algorithms: A comparative analysis. Physical Review E, 80, 056117. https://doi.org/10.1103/PhysRevE.80.056117
  18. Leydesdorff, L. (2004). Clusters and maps of science journals based on bi-connected graphs in the Journal Citation Reports. Journal of Documentation, 60, 371-427. https://doi.org/10.1108/00220410410548144
  19. Malliaros, F. D. and Vazirgiannis, M. (2013). Clustering and community detection in directed networks: A survey. Physics Reports, 533, 95-142. https://doi.org/10.1016/j.physrep.2013.08.002
  20. Narin, F., Carpenter, M. and Berlt, N. (1972). Interrelationships of scientific journals. Journal of the American Society for Information Science, 23, 323-331. https://doi.org/10.1002/asi.4630230508
  21. Newman, M. E. and Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69, 026113. https://doi.org/10.1103/PhysRevE.69.026113
  22. Newman, M. E. (2004). Detecting community structure in networks. The European Physical Journal BCondensed Matter and Complex Systems, 38, 321-330. https://doi.org/10.1140/epjb/e2004-00124-y
  23. Newman, M. E. and Leicht, E. A. (2007). Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Sciences, 104, 9564-9569. https://doi.org/10.1073/pnas.0610537104
  24. O'Malley, A. J. and Marsden, P. V. (2008). The analysis of social networks. Health Services and Outcomes Research Methodology, 8, 222-269. https://doi.org/10.1007/s10742-008-0041-z
  25. Orman, G. K., Labatut, V. and Cherifi, H. (2011). On accuracy of community structure discovery algorithms, arXiv preprint arXiv:1112.4134. https://doi.org/10.4156/jcit.vol6.issue11.32
  26. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., and Parisi, D. (2004). Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America, 101, 2658-2663. https://doi.org/10.1073/pnas.0400054101
  27. Rosvall, M. and Bergstrom, C. T. (2008). An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences, 104, 7327-7331.
  28. Schaeffer, S. E. (2007). Graph clustering. Computer Science Review, 1, 27-64. https://doi.org/10.1016/j.cosrev.2007.05.001
  29. Scott, J. (2012). Social network analysis, Sage.
  30. Soffer, S. N. and Vazquez, A. (2005). Network clustering coefficient without degree-correlation biases. Physical Review E, 71, 057101. https://doi.org/10.1103/PhysRevE.71.057101
  31. Suaris, P. R. and Kedem, G. (1988). An algorithm for quadrisection and its application to standard cell placement. IEEE Transactions on Circuits and Systems, 35, 294-303. https://doi.org/10.1109/31.1742
  32. Tang, L. and Liu, H. (2010). Community detection and mining in social media. Synthesis Lectures on Data Mining and Knowledge Discovery, 2, 1-137.
  33. Wasserman, S. and Faust, K. (1994). Social network analysis: Methods and applications. Cambridge university press, 8.
  34. Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of small-world networks. Nature, 393, 440-442. https://doi.org/10.1038/30918
  35. Won, D., and Choi, K. (2014). Network analysis and comparing citation index of statistics journals. Journal of the Korean Data & Information Science Society, 25, 317-325. https://doi.org/10.7465/jkdi.2014.25.2.317
  36. Zhang, L., Liu, X., Janssens, F., Liang, L. and Glanzel, W. (2010). Subject clustering analysis based on ISI category classification. Journal of Informetrics, 4, 185-193. https://doi.org/10.1016/j.joi.2009.11.005

피인용 문헌

  1. Assessing the Utilization and Interrelatedness of Scopus Subject Categories vol.50, pp.1, 2016, https://doi.org/10.16981/kliss.50.1.201903.251
  2. 국내 학술지평가에서 인용지수 반영 방법의 개선방안 vol.37, pp.1, 2016, https://doi.org/10.3743/kosim.2020.37.1.197