• Journal of the Korean Society for information Management
• /
• v.25 no.2
• /
• pp.157-166
• /
• 2008

In this study, pathfinder network analysis has been carried out to identify subject domains of documents which cited articles in the ASIST Proceedings. This represents how articles in the ASIST Proceedings are flowed and used in what subjects areas. For this analysis, 240 documents were selected through a search of the Scopus database. The complete linkage clustering method was used to draw out 16 clusters from 240 documents. Through MDS and pathfinder network analysis, knowledge networks of clusters have been produced. As a result. articles in the ASIST Proceedings relating to knowledge management, bibliometrics, information retrieval and digital libraries have been cited actively by other publications. The most frequent citation flow type of ASIST proceedings was citation from proceedings(ASIST) to reviews(ARIST), via journals, and the most popular subject areas related to documents were bibliometrics.

• Journal of the Korean Society for information Management
• /
• v.23 no.4 s.62
• /
• pp.215-231
• /
• 2006

Recently there are many bibliometric studies attempting to utilize Pathfinder networks(PFNets) for examining and analyzing the intellectual structure of a scholarly field. Pathfinder network scaling has many advantages over traditional multidimensional scaling, including its ability to represent local details as well as global intellectual structure. However there are some limitations in PFNets including very high time complexity. And Pathfinder network scaling cannot be combined with cluster analysis, which has been combined well with traditional multidimensional scaling method. In this paper, a new method named as Parallel Nearest Neighbor Clustering (PNNC) are proposed for complementing those weak points of PFNets. Comparing the clustering performance with traditional hierarchical agglomerative clustering methods shows that PNNC is not only a complement to PFNets but also a fast and powerful clustering method for organizing informations.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.333-355
• /
• 2006

Network generation methods to visualize bibliometric data for examining the intellectual structure of knowledge domains are investigated in some detail. Among the four methods investigated in this study, pathfinder network algorithm is the most effective method in representing local details as well as global intellectual structure. The nearest neighbor graph, although never used in bibliometic analysis, also has some advantages such as its simplicity and clustering ability. The effect of input data preparation process on resulting intellectual structures are examined, and concluded that unlike MDS map with clusters, the network structure could be changed significantly by the differences in data matrix preparation process. The network generation methods investigated in this paper could be alternatives to conventional multivariate analysis methods and could facilitate our research on examining intellectual structure of knowledge domains.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2012.08a
• /
• pp.133-136
• /
• 2012

지적구조의 시각적인 표현을 위해서 오랫동안 다차원척도법이 사용되어 왔으나, 최근에는 패스파인더 네트워크와 같이 네트워크의 형태로 표현하는 방법이 확산되고 있다. 다차원척도법에 대해서는 생성된 2차원 지도의 품질을 평가하기 위한 합치도 지표로 STRESS나 RSQ를 비롯한 여러 종류가 사용되고 있는 반면, 네트워크 표현에 대해서는 마땅한 합치도 지표가 아직까지 제안되지 않았다. 이 글에서는 개체 간의 연관성을 네트워크로 표현할 경우에, 생성된 네트워크 구조를 평가하기 위한 합치도 지표로 NetRSQ를 제안하였다.

• Journal of the Korean Society for information Management
• /
• v.25 no.4
• /
• pp.327-345
• /
• 2008

The main purposes of this study are to construct a Korean science network from journal contributions data of Korean researchers, and to analyze the structure and characteristics of the network. First of all, the association matrix of 140 scholarly domains are calculated based on the number of contributions in common journals, and then the Pathfinder network algorithm is applied to those matrix. The resulting network has several hubs such as 'Biology', 'Korean Language & Linguistics', 'Physics', etc. The entropy formula and several centrality measures for the weighted networks are adopted to identify the centralities and interdisciplinarity of each scholarly domain. In particular, the date hubs, which have several weak links, are successively distinguished by local and global triangle betweenness centrality measures.

• Journal of the Korean Society for Library and Information Science
• /
• v.55 no.2
• /
• pp.147-178
• /
• 2021

In this study, co-word analysis was conducted to investigate the intellectual structure of the domestic open access area. Through KCI and RISS, 124 research articles related to open access in Korea were selected for analysis, and a total of 1,157 keywords were extracted from the title and abstract. Network analysis was performed on the selected keywords. As a result, 3 domains and 20 clusters were extracted, and intellectual relations among keywords from open access area were visualized through PFnet. The centrality analysis of weighted networks was used to identify the core keywords in this area. Finally, 5 clusters from cluster analysis were displayed on a multidimensional scaling map, and the intellectual structure was proposed based on the correlation between keywords. The results of this study can visually identify and can be used as basic data for predicting the future direction of open access research in Korea.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.337-338
• /
• 2016

녹색기술정보포털 기사 정보와 회원정보를 이용하여 전체 녹색기술 분야에 대한 패스파인더 네트워크와 최근접 이웃 중심성을 도출하고 분야별 융합 동향을 분석하였다. 분석결과, 전체 녹색기술 분야 중에서 실리콘 태양전지 및 고효율 2차전지 등의 에너지 고효율화 분야에 대해 회원들의 관심이 높은 것으로 나타났으며, 실리콘 태양전지 분야에서 다른 녹색기술과의 융합이 가장 활발하게 이루어지는 것으로 분석되었다.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2005.08a
• /
• pp.349-356
• /
• 2005

지적 구조 분석을 위해서 계량서지적 자료를 시각적으로 표현하는 다양한 네트워크 형성 방식에 대해서 사례와 함께 각각의 특성을 살펴보았다. 동시인용을 비롯한 계량서지적 자료의 시각적인 표현은 지적구조의 분석에 있어서 매우 효과적인 방법으로 인식되어왔다. 시각화를 위해서는 전통적으로 다차원척도법이나 군집분석, 대응일치분석 등의 다변량통계 분석 기법이 사용되어왔다. 최근 들어 패스파인더 네트워크를 비롯한 새로운 네트워크 형성 기법이 전통적인 기법의 대체 도구로 제시되고 있으나, 사실상 네트워크의 형태로 지적 구조를 분석하는 것은 인용분석 연구의 초기부터라고 할 수 있다. 다양한 네트워크 형성 방식의 특성에 대해서 살펴봄으로써 계량서지적 분석을 활성화하는데 도움이 되리라고 기대한다.

• Journal of the Korean Society for information Management
• /
• v.37 no.2
• /
• pp.333-352
• /
• 2020

This study aimed to analyze research trends of 'digital divide' in Library and Information Science. To this end, we coded research subjects with 11 subcategories, and research objectives with 4 subcategories, and research methods with 4 subcategories, and constructed keyword networks to which a pathfinder algorithm was applied. As a result of the analysis, 79.5% of studies are on the disabled, multicultural families, and the elderly among information vulnerable groups, and it was found to be concentrated in specific groups. In addition, digital divide related studies have been actively conducted for the purpose of resolving information vulnerabilities such as people with disabilities. We also found that these studies focused on verifying the effectiveness by designing and applying treatments such as informatization education, information utilization, and reading programs. Lastly, the most frequently used research method in the digital divide was found to use case studies or questionnaires simultaneously with literature research.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.233-254
• /
• 2022

Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.